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
Performance of multipath routing for on-demand protocols in mobile ad hoc networks
Mobile Networks and Applications
On-Demand Multi Path Distance Vector Routing in Ad Hoc Networks
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
Pair-wise path key establishment in wireless sensor networks
Computer Communications
End-to-end pairwise key establishment using node disjoint secure paths in wireless sensor networks
International Journal of Security and Networks
Efficient path key establishment for wireless sensor networks
EURASIP Journal on Wireless Communications and Networking
Implementing distributed multicost routing in mobile ad hoc networks using dsr
Proceedings of the 6th ACM international symposium on Mobility management and wireless access
A survey on secure multipath routing protocols in WSNs
Computer Networks: The International Journal of Computer and Telecommunications Networking
Recovering extra routes with the path from loop recovery protocol
MSN'05 Proceedings of the First international conference on Mobile Ad-hoc and Sensor Networks
Multi-path routing in Spatial Wireless Ad Hoc networks
Computers and Electrical Engineering
A flexible family of multi-path routing protocols over a MANET
International Journal of Ad Hoc and Ubiquitous Computing
| Hi-index | 0.00 |
Mobile ad hoc networks are characterized by the use of wireless links with limited bandwidth, dynamically varying network topology and multi-hop connectivity. AODV and DSR are the two most widely studied on-demand ad hoc routing protocols. Previous work has shown some limitations of the two protocols: whenever there is a link break on the active route, each of the two routing protocols has to invoke a route discovery process. This leads to increase in both delay and control overhead as well as decrease in packet delivery ratio. To alleviate these problems, we modify and extend AODV to include the path accumulation feature of DSR in route request/reply packets so that lower route overhead is employed to discover multiple node-disjoint routing paths. The extended AODV is called Node-Disjointness-Based Multipath Routing Protocol (NDMR), which has two novel aspects compared to the other on-demand multipath protocols: it reduces routing overhead dramatically and achieves multiple node-disjoint routing paths. Simulation results show that performance of NDMR is much better than that of AODV and DSR.