We propose a novel routing algorithm, called backup source routing (BSR) to establish and maintain backup paths based on the concepts of similar path. The BSR algorithm selects a backup path that is piggybacked with the primary path in the header of data packets in order to achieve the most durable routes between any pair of communicating mobile nodes. We define a new routing metric, called the route durability, to provide the criterion for the backup path selection. We have developed a mathematical model from which the new routing metric can be defined in order to allow the evaluation of our algorithm. Extensive simulations demonstrated that such routing strategy has two interesting futures: (1) in less stressful situations of lower load and mobility, BSR has similar performance to DSR; (2) in more challenging situations of high mobility, BSR can improve the performance significantly.
[1]
David A. Maltz,et al.
Dynamic Source Routing in Ad Hoc Wireless Networks
,
1994,
Mobidata.
[2]
Toh C-k.
Long-lived Ad Hoc Routing based on the Concept of Associativity
,
1999
.
[3]
J. Broach,et al.
The dynamic source routing protocol for mobile ad-hoc networks
,
1998
.
[4]
Samir Ranjan Das,et al.
Performance of Multipath Routing for On-Demand Protocols in Mobile Ad Hoc Networks
,
2001,
Mob. Networks Appl..
[5]
Elizabeth M. Belding-Royer,et al.
A review of current routing protocols for ad hoc mobile wireless networks
,
1999,
IEEE Wirel. Commun..