IRR: a novel incremental recoverable routing protocol for mobile ad hoc networks

Authors:
Yu Zhou;Yao Yu;Sidan Du
Affiliations:
Department of Electronics Science and Engineering, Nanjing University, Nanjing, China;Department of Electronics Science and Engineering, Nanjing University, Nanjing, China;Department of Electronics Science and Engineering, Nanjing University, Nanjing, China
Venue:
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Year:
2009

Citing 5
Cited 0

Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers

SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
GloMoSim: a library for parallel simulation of large-scale wireless networks

PADS '98 Proceedings of the twelfth workshop on Parallel and distributed simulation
Wireless Communications: Principles and Practice

Wireless Communications: Principles and Practice
Ad-hoc On-Demand Distance Vector Routing

WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
On-Demand Multi Path Distance Vector Routing in Ad Hoc Networks

ICNP '01 Proceedings of the Ninth International Conference on Network Protocols

Quantified Score

Hi-index	0.00

Visualization

Abstract

In traditional routing protocols for Mobile Ad Hoc Networks (MANETs), it costs highly to rebuild routes by flooding query messages again and again over the whole network. A novel routing protocol for MANETs, Incremental Recoverable Routing (IRR) Protocol, is proposed in this paper. Unlike the previous protocols, nodes in IRR perform routing discovery and maintenance based on the use of the process of incremental recovery among a limited number of nodes, named infected nodes. Those nodes are dynamically infected during the period of content delivery without any additional information exchanging employed. By performing such recovery process, the routes will be recovered, improved incrementally and eventually form the shortest paths between the sources and the destinations. Once the routing path become unavailable aroused from sudden link breakage, the source node first uses the process of incremental recovery to rebuild a route for the destination. In case none of the available paths can be built among all the infected nodes, a query message will be flooded over the whole network. By investigating among extensive simulation results, it suggests that the process of incremental recovery is usually sufficient for routing maintenance in most cases and the IRR protocol performs well regardless of nodes mobility.