首页|A DSDV-based Multipath Routing Protocol for Ad-hoc Mobile Networks

A DSDV-based Multipath Routing Protocol for Ad-hoc Mobile Networks

扫码查看
原文链接
  • NETL
The rich connectivity makes ad-hoc wireless networks especially suitable for multipath routing and load balancing。 Although most current multipath routing protocols for ad-hoc networks can discover multiple routes， they don't use multiple routes at the same time to aggregate multiple paths and make full use of bandwidth。 This is because additional path identification overhead in packets is required and there may be problems with forwarding loops。 In this paper， we propose a multipath routing protocol M-DSDV， by extending DSDV， a proactive shortest path routing protocol。 The new protocol aims to discover and maintain multiple quasi-shortest paths to the destinations。 The shortest path is included in the multiple quasi-shortest paths to get loop-free forwarding and keep backward capability。 The special properties of quasi-shortest paths make it possible to do load balancing at each node without incurring additional path identification overhead in packets。 We have implemented this algorithm in ns-2 and compared the performance of the new routing protocol with DSDV。 Simulation results indicate that the new routing protocol achieves improvement in terms of packet delivery rate and end-to-end delay under light traffic load。

ad-hoc routing protocolmultipath routingad-hoc mobile networks

X. James Dong、Anuj Puri

展开 >

Department of Electrical Engineering and Computer Sciences University of California, Berkeley Berkeley, CA 94720

Proceedings of the International Conference on Wireless Networks ICWN'02

Las Vegas, NV(US);Las Vegas, NV(US)

International Conference on Wireless Networks ICWN'02, Jun 24-27, 2002, Las Vegas, Nevada, USA

p.407-413

2002