Paper Info
Title
Connectivity in finite ad-hoc networks.
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 G 1, assuming all the nodes are independently uniform distributed in a closed interval [0, Z](z ∈ ℝ+), 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 (G 2) can be divided into at most five different groups. For an f-node n 0 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 G 2 − {n 0}.
Year
DOI
Venue
2008
10.1007/s11432-008-0011-7
Science in China Series F: Information Sciences
Keywords
Field
DocType
uniform distribution,ad hoc network
Network connectivity,Discrete mathematics,Wireless ad hoc network,Mathematics
Journal
Volume
Issue
ISSN
51
4
18622836
Citations 
PageRank 
References 
5
0.54
12
Authors
4
Name
Order
Citations
PageRank
Hanxing Wang1171.95
Guilin Lu2162.20
Weijia Jia32656221.35
Wei Zhao43532404.01