DocumentCode :
846388
Title :
On the connectivity in finite ad hoc networks
Author :
Desai, Madhav ; Manjunath, D.
Author_Institution :
Dept. of Electr. Eng., Indian Inst. of Technol., Mumbai, India
Volume :
6
Issue :
10
fYear :
2002
Firstpage :
437
Lastpage :
439
Abstract :
Connectivity and capacity analysis of ad hoc networks has usually focused on asymptotic results in the number of nodes in the network. In this letter we analyze finite ad hoc networks. With the standard assumption of uniform distribution of nodes in [0, z], z > 0, for a one-dimensional network, we obtain the exact formula for the probability that the network is connected. We then extend this result to find bounds for the connectivity in a two-dimensional network in [0, z]/sup 2/.
Keywords :
packet radio networks; probability; capacity analysis; connectivity; finite ad hoc networks; multihop radio networks; one-dimensional network; probability; two-dimensional network; uniform distribution of nodes; Ad hoc networks; Intelligent networks; Land mobile radio cellular systems; Radio network; Spread spectrum communication; Switching circuits; Upper bound;
fLanguage :
English
Journal_Title :
Communications Letters, IEEE
Publisher :
ieee
ISSN :
1089-7798
Type :
jour
DOI :
10.1109/LCOMM.2002.804241
Filename :
1042240
Link To Document :
بازگشت