Connectivity in finite ad-hoc networks

【摘要】 Research on ad-hoc network connectivity has mainly focused on asymptotic results in the number of nodes in the network. For a one-dimensional ad-hoc network G1, assuming all the nodes are independently uniform distributed in a closed interval [0,Z](z ∈ R+), we derive a generic formula for the probability that the network is connected. The finite connected ad-hoc networks is analyzed. And we separately suggest necessary conditions to make the ad-hoc network to be connected in one and two dimensional cases, facing possible failed nodes (f-nodes). Based on the necessary condition and unit-disk assumption for the node transmission, we prove that the nodes of the connected two-dimensional ad-hoc networks (G2) can be divided into at most five different groups. For an f-node n0 in either of the five groups, we derive a close formula for the probability that there is at least one route between a pair of nodes in G2 - {n0}.更多还原

【Abstract】 Research on ad-hoc network connectivity has mainly focused on asymptotic results in the number of nodes in the network. For a one-dimensional ad-hoc network G1, assuming all the nodes are independently uniform distributed in a closed interval [0,Z](z ∈ R+), we derive a generic formula for the probability that the network is connected. The finite connected ad-hoc networks is analyzed. And we separately suggest necessary conditions to make the ad-hoc network to be connected in one and two dimensional cases, facing possible failed nodes (f-nodes). Based on the necessary condition and unit-disk assumption for the node transmission, we prove that the nodes of the connected two-dimensional ad-hoc networks (G2) can be divided into at most five different groups. For an f-node n0 in either of the five groups, we derive a close formula for the probability that there is at least one route between a pair of nodes in G2 - {n0}.更多还原