Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Capacity of Ad Hoc wireless networks
Proceedings of the 7th annual international conference on Mobile computing and networking
Wireless ATM and Ad-Hoc Networks: Protocols and Architectures
Wireless ATM and Ad-Hoc Networks: Protocols and Architectures
Distributed Algorithms
Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
Analysis of link reversal routing algorithms for mobile ad hoc networks
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Distributed communication algorithms for ad hoc mobile networks
Journal of Parallel and Distributed Computing - Special issue on wireless and mobile ad hoc networking and computing
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Performance evaluation of routing protocols for ad hoc wireless networks
Mobile Networks and Applications
Wireless Communications & Mobile Computing - Special Issue: Mobility Management in Wireless and Mobile Networks
Routing protocols for efficient communication in wireless ad-hoc networks
Proceedings of the 3rd ACM international workshop on Performance evaluation of wireless ad hoc, sensor and ubiquitous networks
The capacity of wireless networks
IEEE Transactions on Information Theory
Determining the optimal configuration for the zone routing protocol
IEEE Journal on Selected Areas in Communications
Scalability of MANET routing protocols for heterogeneous and homogenous networks
Computers and Electrical Engineering
Hi-index | 0.01 |
In ad-hoc mobile networks (MANET), the mobility of the nodes is a complicating factor that significantly affects the effectiveness and performance of the routing protocols. Our work builds upon the 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 adopting 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 necessery implementation changes required to incorporate existing routing protocols in 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 the existing routing protocols.