Handling high mobility in next-generation wireless ad hoc networks

被引:14
作者
Ho, Ai Hua [1 ]
Ho, Yao Hua [1 ]
Hua, Kien A. [1 ]
机构
[1] Univ Cent Florida, Sch Elect Engn & Comp Sci, Orlando, FL 32816 USA
基金
美国国家科学基金会;
关键词
link break; mobile ad hoc networks; node mobility; virtual router; PROTOCOL;
D O I
10.1002/dac.1056
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Next-generation ad hoc networks need to be able to handle high mobility in order to support a wide range of emerging applications such as vehicular networks. Maintaining communication links of an established communication path that extends between source and destination nodes is a significant challenge in mobile ad hoc networks due to the movement of the mobile nodes. In particular, such communication links are often broken under a high mobility environment. Although a new communication route can be established when a break in the communication path occurs, repeatedly reestablishing new routes incurs delay and substantial overhead. To address this limitation, we introduce the Virtual Router abstraction in this paper. A virtual router is a dynamically created logical router that is associated with a particular geographical area. Its routing functionality is provided by the physical nodes (i.e. mobile devices) currently within the geographical region served by the virtual router. These physical nodes take turns in forwarding data packets for the virtual router. In this environment, data packets are transmitted from a source node to a destination node over a series of virtual routers. Since virtual routers do not move, this scheme is much less susceptible to node mobility. We give simulation results to demonstrate the effectiveness of this technique in handling high mobility. They show that the Virtual Router approach can achieve several times better performance than the traditional approach based on physical routers (i.e. relay nodes). Copyright (C) 2009 John Wiley & Sons, Ltd.
引用
收藏
页码:1078 / 1092
页数:15
相关论文
共 33 条
[1]  
AGUAYO D, 2004, P ACM SIGCOMM 2004 P
[2]  
[Anonymous], DYNAMIC SOU IN PRESS
[3]  
[Anonymous], 2003, P 9 ANN INT C MOBILE, DOI DOI 10.1145/938985.939012
[4]  
[Anonymous], AD HOC NETWORKS
[5]  
[Anonymous], AD HOC ON D IN PRESS
[6]  
Balasubramanian A., 2007, CHANTS 07, P59, DOI DOI 10.1145/1287791.1287803
[7]   Opportunistic routing in multi-hop wireless networks [J].
Biswas, S ;
Morris, R .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2004, 34 (01) :69-74
[8]  
BISWAS S, 2005, P ACM SIGCOMM PHIL P, P133
[9]  
BLAZEVIC L, 2006, LECT NOTES COMPUTER, V2345, P141
[10]  
CHIANG CC, 1997, P IEEE 6 INT C UN PE, V2, P546