Analysis on the connectivity in wireless ad hoc networks

Abstract

We first investigate when it is possible for two nodes in a wireless network to communicate with each other. Based on the result from bond percolation in a two-dimensional lattice, as long as the probability that a sub-square is closed is less than 0.5 and each sub-square contains at least four nodes, percolation occurs. Then, we establish the conditions for full connectivity in a network graph. How two adjacent sub-squares are connected differentiates this work from others. Two adjacent sub-squares are connected if there exists a communicating path between them instead of a direct communication link. The full connectivity occurs almost surely if each sub-square contains at least one node and the probability of having an open sub-edge is no less than 0.3822. Finally, simulations are conducted to validate the proposed conditions for percolation and full connectivity. © 2014 Springer-Verlag Berlin Heidelberg.