TY - GEN
T1 - Mercury-like routing for high mobility wireless ad hoc networks
AU - Ho, Ai Hua
AU - Ho, Yao Hua
AU - Hua, Kien
PY - 2011
Y1 - 2011
N2 - Supporting high mobility is essential to mobile ad hoc networks in a wide range of emerging applications such as vehicular networks. Communication links of an established communication path that extends between source and destination nodes 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 Communication Path abstraction in this paper. A communication path is a dynamically-created geographical area that connects the source and destination nodes. The routing functionality of a communication path is provided by the physical nodes (i.e., mobile devices) currently within the geographical region served by the path. These physical nodes take turns in forwarding data packets for the path. Since a path can be supported by many alternative nodes, this scheme is much less susceptible to node mobility. Our simulation results show the Communication Path approach can achieve several times better performance than traditional approach based on a fixed sequence of physical links.
AB - Supporting high mobility is essential to mobile ad hoc networks in a wide range of emerging applications such as vehicular networks. Communication links of an established communication path that extends between source and destination nodes 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 Communication Path abstraction in this paper. A communication path is a dynamically-created geographical area that connects the source and destination nodes. The routing functionality of a communication path is provided by the physical nodes (i.e., mobile devices) currently within the geographical region served by the path. These physical nodes take turns in forwarding data packets for the path. Since a path can be supported by many alternative nodes, this scheme is much less susceptible to node mobility. Our simulation results show the Communication Path approach can achieve several times better performance than traditional approach based on a fixed sequence of physical links.
KW - Communication Path
KW - Link Break
KW - Mobile Ad-hoc Networks
KW - Node Mobility
UR - http://www.scopus.com/inward/record.url?scp=84856140146&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84856140146&partnerID=8YFLogxK
U2 - 10.1109/LCN.2011.6115505
DO - 10.1109/LCN.2011.6115505
M3 - Conference contribution
AN - SCOPUS:84856140146
SN - 9781612849287
T3 - Proceedings - Conference on Local Computer Networks, LCN
SP - 537
EP - 545
BT - Proceedings of the 36th Annual IEEE Conference on Local Computer Networks, LCN 2011
T2 - 36th Annual IEEE Conference on Local Computer Networks, LCN 2011
Y2 - 4 October 2011 through 7 October 2011
ER -