Exact probability of connectivity in one-dimensional ad hoc wireless networks

被引:0
作者
Ghasemi, A [1 ]
Nader-Esfahani, S [1 ]
机构
[1] Univ Tehran, Sch Elect & Comp Engn, Tehran, Iran
关键词
ad hoc networks; connectivity; one-dimensional; wireless networks;
D O I
10.1109/LCOMM.2006.1613737
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
The probability that a one-dimensional stationary ad hoc wireless network is composed of at most C clusters is presented. The probability of network connectivity, i.e. the case of C = 1, can be derived as a special case. A very simple approximate formula is also presented for the probability of network connectivity. We also explain our approximation heuristically, which confirms the analytical result. The analysis is validated by computing the probability of network connectivity and comparing it with the Mont Carlo simulation results.
引用
收藏
页码:251 / 253
页数:3
相关论文
共 7 条
[1]   On the connectivity of Ad hoc networks [J].
Bettstetter, C .
COMPUTER JOURNAL, 2004, 47 (04) :432-447
[2]  
Bettstetter C., 2002, P 3 ACM INT S MOB AD, P80, DOI [10.1145/513800.513811, DOI 10.1145/513800.513811]
[3]  
David H.A., 1970, ORDER STAT
[4]   On the connectivity in finite ad hoc networks [J].
Desai, M ;
Manjunath, D .
IEEE COMMUNICATIONS LETTERS, 2002, 6 (10) :437-439
[5]  
FOH CH, 2004, IEEE ICC 04, V6, P3739
[6]  
GUPTA P, 1999, SYS CON FDN, P547
[7]   The critical transmitting range for connectivity in sparse wireless ad hoc networks [J].
Santi, P ;
Blough, DM .
IEEE TRANSACTIONS ON MOBILE COMPUTING, 2003, 2 (01) :25-39