An analytical expression for k-connectivity probability of wireless ad hoc networks in presence of channel randomness

This paper work investigated the k-connectivity of a wireless multi hop network with homogeneous random node distribution. We derived an analytical expression which will support the theoretical background, and provides more practical result. We have investigated the requirement to achieve more than one connected network. We can find out how many nodes are needed to cover a certain area with a k-connected network. Our results are of practical value for researchers and developers who perform simulations or design of static and mobile ad hoc networks. Our results can also be used in the implementation of real ad hoc systems. Finally, we would like to note that the results of this paper work are applicable to any kind of multi hop system. The proposed mathematical model can be analyzed for MRC diversity scheme as well as MRC Nakagami-m fading. The extension of work can be possible for MIMO (Multiple-Input and Multiple-Output) scheme.