Connectivity of Large-Scale CSMA Networks

被引:16
作者
Yang, Tao [1 ]
Mao, Guoqiang [1 ]
Zhang, Wei [2 ]
机构
[1] Univ Sydney, Sch Elect & Informat Engn, Sydney, NSW 2006, Australia
[2] Univ New S Wales, Sch Elect Engn & Telecommun, Sydney, NSW 2052, Australia
关键词
Connectivity; CSMA; wireless network; AD-HOC NETWORKS; WIRELESS; INTERFERENCE; IMPACT;
D O I
10.1109/TWC.2012.041912.111475
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Wireless multi-hop networks are being increasingly used in military and civilian applications. Connectivity is a prerequisite in wireless multi-hop networks for providing many network functions. In a wireless network with many concurrent transmissions, signals transmitted at the same time will mutually interfere with each other. In this paper we consider the impact of interference on the connectivity of CSMA networks. Specifically, consider a network with n nodes uniformly and i.i.d. on a square [-root n/2,root n/2](2) where a node can only transmit if the sensed power from any other active transmitter is below a threshold, i.e. subject to the carrier-sensing constraint, and the transmission is successful if and only if the SINR is greater than or equal to a predefined threshold. We provide a sufficient condition and a necessary condition, i.e. an upper bound and a lower bound on the transmission power, required for the above network to be asymptotically almost surely (a.a.s.) connected as n -> infinity. The two bounds differ by a constant factor only as n -> infinity. It is shown that the transmission power only needs to be increased by a constant factor to combat interference and maintain connectivity compared with that considering a unit disk model (UDM) without interference. This result is also in stark contrast with previous results considering the connectivity of ALOHA networks under the SINR model.
引用
收藏
页码:2266 / 2275
页数:10
相关论文
共 31 条
[1]  
[Anonymous], 2009, 6624 INRIA
[2]  
[Anonymous], P 2007 IEEE INFOCOM
[3]  
[Anonymous], IEEE T MOBILE UNPUB
[4]  
[Anonymous], P 2005 IEEE INFOCOM
[5]  
[Anonymous], P 1998 IEEE C DEC CO
[6]  
[Anonymous], COMPUT J
[7]  
[Anonymous], IEEE ACM T IN PRESS
[8]  
[Anonymous], P 2009 ACM INT S PER
[9]  
[Anonymous], P 2003 IEEE AER C
[10]  
[Anonymous], P 2002 ACM INT S MOB