Distributed Routing Schemes with Accessibility Consideration in Multi-Hop Wireless Networks

被引:1
作者
Wang, Weiwei [1 ]
Cai, Jun [1 ]
Alfa, Attahiru S. [1 ]
机构
[1] Univ Manitoba, Dept Elect & Comp Engn, Winnipeg, MB R3T 5V6, Canada
基金
加拿大自然科学与工程研究理事会;
关键词
Distributed routing scheme; throughput-maximization bandwidth sharing; equal-time bandwidth sharing; accessibility; multi-hop wireless networks; EFFICIENT;
D O I
10.1109/TWC.2010.082710.091521
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In this paper, two novel distributed routing schemes, named adaptive-information-moving-rate routing scheme (AIMR) and adaptive-information-moving-distance-and-link-rate routing scheme (AIMDLR), are proposed for multi-hop wireless networks by jointly considering the number of hops and the link states. With one-hop information only, both schemes aim at improving the network spectral efficiency under two different bandwidth sharing methods (i.e., throughput-maximization bandwidth sharing and equal-time bandwidth sharing), respectively. In addition, a general scheme, called probability-based scheme (PBS), is proposed to improve the accessibility of distributed routing schemes, which is denoted by the success probability of finding a route reaching the destination. In the PBS, the node selection in each hop is based on a well-defined probability, which takes into account the locations of the transmitter and the receiver at each hop and the uncertainty in the subsequent hops. By combining the PBS with the AIMR and the AIMDLR, the proposed probability-based AIMR (PAIMR) and probability-based AIMDLR (PAIMDLR) can not only improve the accessibility significantly but also achieve higher effective spectral efficiency compared to the counterparts. Simulation results are finally presented to demonstrate the advantages of the proposed routing schemes.
引用
收藏
页码:3178 / 3188
页数:11
相关论文
共 36 条
[1]   Wireless sensor networks: a survey [J].
Akyildiz, IF ;
Su, W ;
Sankarasubramaniam, Y ;
Cayirci, E .
COMPUTER NETWORKS, 2002, 38 (04) :393-422
[2]   Wireless mesh networks: a survey [J].
Akyildiz, IF ;
Wang, XD ;
Wang, WL .
COMPUTER NETWORKS, 2005, 47 (04) :445-487
[3]   Routing techniques in wireless sensor networks: A survey [J].
Al-Karaki, JN ;
Kamal, AE .
IEEE WIRELESS COMMUNICATIONS, 2004, 11 (06) :6-28
[4]  
[Anonymous], 2001, WIRELESS COMMUNICATI
[5]  
Bertsekas D., 1987, DATA NETWORKS
[6]   Fading channels: Information-theoretic and communications aspects [J].
Biglieri, E ;
Proakis, J ;
Shamai, S .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1998, 44 (06) :2619-2692
[7]   Routing with guaranteed delivery in ad hoc wireless networks [J].
Bose, P ;
Morin, P ;
Stojmenovic, I ;
Urrutia, J .
WIRELESS NETWORKS, 2001, 7 (06) :609-616
[8]   Semi-distributed user relaying algorithm for amplify-and-forward wireless relay networks [J].
Cai, Jun ;
Shen, Xuemin Sherman ;
Mark, Jon W. ;
Alfa, Attahiru S. .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2008, 7 (04) :1348-1357
[9]   Distributed Spectrum-Efficient Routing Algorithms in Wireless Networks [J].
Chen, Deqiang ;
Haenggi, Martin ;
Laneman, J. Nicholas .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2008, 7 (12) :5297-5305
[10]  
Cormen T., 2001, Introduction to Algorithms