Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
A performance comparison of multi-hop wireless ad hoc network routing protocols
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Associativity-Based Routing for Ad Hoc Mobile Networks
Wireless Personal Communications: An International Journal
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
DOA: DSR over AODV Routing for Mobile Ad Hoc Networks
IEEE Transactions on Mobile Computing
ROAR: a multi-rate opportunistic AODV routing protocol for wireless ad-hoc networks
ADHOC-NOW'06 Proceedings of the 5th international conference on Ad-Hoc, Mobile, and Wireless Networks
Multi-path routing protocols in wireless mobile ad hoc networks: a quantitative comparison
NEW2AN'06 Proceedings of the 6th international conference on Next Generation Teletraffic and Wired/Wireless Advanced Networking
Computers and Electrical Engineering
Hi-index | 0.00 |
In Mobile Ad-hoc Networks (MANETs), Multipath routing is wildly researched for its superiority over singlepath routing. Ad hoc On-demand Multipath Distance Vector (AOMDV) Routing Protocol performs very well and has been extensively studied. We present an efficient multipath routing algorithm, called Link Optimization Ad-hoc On-Demand Multipath Distance Vector Routing (LOAOMDV). We use 4 bies information of the RREP (Route Request) packet, and present a new route reply process. The new routing protocol establishes the omitted reverse path and reduces the number of common node in several paths. This protocol can reduced the end-to-end delay, extend the network lifetime, and salvages packet timely, reduces the ratio of packet chaotic sequence. Specifically the protocol has no additional routing overhead. The simulation results proved that it is more effective.