An Aloha protocol for multihop mobile wireless networks

被引:490
作者
Baccelli, F [1 ]
Blaszczyszyn, B
Mühlethaler, P
机构
[1] Ecole Normale Super, INRIA, F-75230 Paris, France
[2] Univ Wroclaw, Inst Math, PL-50384 Wroclaw, Poland
[3] Inst Natl Rech Informat & Automat, HiPERCOM, F-78153 Le Chesnay, France
关键词
medium access control (MAC) layer; multiple-access protocol; network design; optimization; point process; queuing theory; signal-to-interference ratio; stochastic geometry; stochastic process; transport capacity;
D O I
10.1109/TIT.2005.862098
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
An Aloha-type access control mechanism for large mobile, multihop, wireless networks is defined and analyzed. This access scheme is designed for the multihop context, where it is important to find a compromise between the spatial density of communications and the range of each transmission. More precisely the analysis aims at optimizing the product of the number of simultaneously successful transmissions per unit of space (spatial reuse) by the average range of each transmission. The optimization is obtained via an averaging over all Poisson configurations for the location of interfering mobiles, where an exact evaluation of signal over noise ratio is possible. The main mathematical tools stem from stochastic geometry and are spatial versions of the so-called additive and max shot noise processes. The resulting medium access control (MAC) protocol exhibits some interesting properties. First, it can be implemented in a decentralized way provided some local geographic information is available to the mobiles. In addition, its transport capacity is proportional to the square root of the density of mobiles which is the upper bound of Gupta and Kumar. Finally, this protocol is self-adapting to the node density and it does not require prior knowledge of this density.
引用
收藏
页码:421 / 436
页数:16
相关论文
共 29 条
[1]  
ALAGHA K, 2000, RR3929 INRIA
[2]  
[Anonymous], 1997, 80211 IEEE
[3]  
[Anonymous], 2003, Proceedings of International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)
[4]  
[Anonymous], 1970, AFIPS CONF P
[5]   On a coverage process ranging from the Boolean model to the Poisson-Voronoi tessellation with applications to wireless communications [J].
Baccelli, F ;
Blaszczyszyn, B .
ADVANCES IN APPLIED PROBABILITY, 2001, 33 (02) :293-323
[6]  
Baccelli F., 2002, ELEMENTS QUEUEING TH, V2nd
[7]  
Bertsekas D., 1988, DATA NETWORKS
[8]  
Bharghavan V., 1994, Computer Communication Review, V24, P212, DOI 10.1145/190809.190334
[9]  
BLAZEVIC L, LOCATIOIN BASED ROUT
[10]  
Blough DM, 2002, INT FED INFO PROC, V96, P71