A mobility aware protocol synthesis for efficient routing in ad hoc mobile networks

被引:25
作者
Bamis, Athanasios [2 ]
Boukerche, Azzedine [3 ]
Chatzigiannakis, Loannis [1 ,4 ]
Nikoletseas, Sofiris [1 ,4 ]
机构
[1] Univ Patras, Res Acad Comp Technol Inst, Res Unit 1, GR-26500 Patras, Greece
[2] Yale Univ, ENALAB, New Haven, CT 06520 USA
[3] Univ Ottawa, SITE, Ottawa, ON K1N 6N5, Canada
[4] Univ Patras, CEID, GR-26500 Patras, Greece
基金
加拿大自然科学与工程研究理事会; 加拿大创新基金会;
关键词
wireless ad hoc; mobile networks; mobility classification; routing; algorithmic design; simulation; performance evaluation;
D O I
10.1016/j.comnet.2007.09.023
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
In mobile ad hoc networks (MANETs), the mobility of the nodes is a complicating factor that significantly affects the effectiveness and performance of the routing protocols. Our work builds upon recent results on the effect of node mobility on the performance of available routing strategies (i.e., path-based, using support) and proposes a protocol framework that exploits the usually different mobility rates of the nodes by adapting the routing strategy during execution. We introduce a metric for the relative mobility of the nodes, according to which the nodes are classified into mobility classes. These mobility classes determine, for any pair of origin and destination, the routing technique that best corresponds to their mobility properties. Moreover, special care is taken for nodes remaining almost stationary or moving with high (relative) speeds. Our key design goal is to limit the necessary implementation changes required to incorporate existing routing protocols into our framework. We provide extensive evaluation of the proposed framework, using a well-known simulator (NS2). Our first findings demonstrate that the proposed framework improves, in certain cases, the performance of existing routing protocols. (C) 2007 Elsevier B.V. All rights reserved.
引用
收藏
页码:130 / 154
页数:25
相关论文
共 34 条
[1]   Performance evaluation of routing protocols for ad hoc wireless networks [J].
Boukerche, A .
MOBILE NETWORKS & APPLICATIONS, 2004, 9 (04) :333-342
[2]  
Boukerche A, 2002, LECT NOTES COMPUT SC, V2400, P957
[3]  
BOUKERCHE A, 2003, ACM KLUWER WIRELESS, V9, P261
[4]   Analysis of link reversal routing algorithms [J].
Busch, C ;
Tirthapura, S .
SIAM JOURNAL ON COMPUTING, 2005, 35 (02) :305-326
[5]  
Busch C., 2003, PROC SPAA, P210
[6]  
CAMP T, 2002, SPECIAL ISSUE MOBILE, V2, P483
[7]   Distributed communication algorithms for ad hoc mobile networks [J].
Chatzigiannakis, I ;
Nikoletseas, S ;
Spirakis, P .
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2003, 63 (01) :58-74
[8]  
CHATZIGIANNAKIS I, 2004, WIRELESS COMMUNICATI, V4, P1
[9]  
CHATZIGIANNAKIS I, 2006, 4 ACM IEEE INT WORKS, P52
[10]  
CHATZIGIANNAKIS I, 2006, ACM WORKSH PERF EV W, P90