The Community for Technology Leaders
Green Image
Issue No. 10 - Oct. (2012 vol. 11)
ISSN: 1536-1233
pp: 1425-1435
Arsalan Sharif-Nassab , Sharif University of Technology, Tehran
Farid Ashtiani , Sharif University of Technology, Tehran
In this paper, we propose an analytical approach to compute the probability of connectivity for one-dimensional ad hoc networks. The proposed analysis gives the exact probability of connectivity for an arbitrary distribution of nodes, provided that nodes are independently and identically distributed. We conduct separate analyses for two cases; in the first case, the number of nodes varies by time under a stationary distribution and in the second case, there is a fixed (known) number of nodes in the network. Using the approaches presented in this work, we are able to derive closed-form formulas for the probability of connectivity for some spatial distributions, while for more complicated distributions, our approach leads to tractable numerical algorithms. As an example, we apply our method to a special case (uniform distribution) and derive a closed-form formula for its probability of connectivity. Finally, we confirm the validity of our analytical approach by simulation for several distributions and show higher accuracy and applicability of the proposed approach compared with existing methods.
Density functional theory, Equations, Computational modeling, Vehicles, Ad hoc networks, Mobile computing, Approximation methods, spatial distribution., Ad hoc network, connectivity, spatial density

A. Sharif-Nassab and F. Ashtiani, "Connectivity Analysis of One-Dimensional Ad Hoc Networks with Arbitrary Spatial Distribution for Variable and Fixed Number of Nodes," in IEEE Transactions on Mobile Computing, vol. 11, no. , pp. 1425-1435, 2012.
85 ms
(Ver 3.3 (11022016))