An ad hoc routing protocol providing short backup routes

Authors:
N. Ventura;Li-Hsing Yen;Kun-Ming Yu
Affiliations:
Chung Hua Univ., Hsin-Chu, Taiwan;Chung Hua Univ., Hsin-Chu, Taiwan;Chung Hua Univ., Hsin-Chu, Taiwan
Venue:
ICCS '02 Proceedings of the The 8th International Conference on Communication Systems - Volume 02
Year:
2002

Citing 0
Cited 3

Adaptive backup routing for ad-hoc networks

Computer Communications
Computing subgraph probability of random geometric graphs with applications in quantitative analysis of ad hoc networks

IEEE Journal on Selected Areas in Communications - Special issue on stochastic geometry and random graphs for the analysis and designof wireless networks
Computing subgraph probability of random geometric graphs: quantitative analyses of wireless ad hoc networks

FORTE'05 Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

When the rate of topological changes in the network is high, most of existing ad hoc routing protocols are not able to react fast enough to maintain routing. TORA is thus designed to minimize reaction to topological change, but it does not take routing optimality into consideration. In this paper, we propose a routing protocol that not only reacts fast but also adopts short routes. In the protocol, backup routes are constructed to surround the main route. When links go down, our protocol intelligently selects a short route among the backup routes and replaces these failed links with it. Note that in our protocol backup routes are constructed and updated to the present network topology.