On calculating connected dominating set for efficient routing in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
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
A New Multipath Routing Approach to Enhancing TCP Security in Ad Hoc Wireless Networks
ICPPW '05 Proceedings of the 2005 International Conference on Parallel Processing Workshops
Salvaging route reply for on-demand routing protocols in mobile ad-hoc networks
MSWiM '05 Proceedings of the 8th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems
A belt-zone method for decreasing control messages in ad hoc networks
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III
Design of Knowledge Discovery Agent for a Bit-Map on Ad Hoc Mobile Networks
KES-AMSTA '07 Proceedings of the 1st KES International Symposium on Agent and Multi-Agent Systems: Technologies and Applications
A discovery method for node-disjoint multi-paths by valid source-destination edges
AsiaCSN '07 Proceedings of the Fourth IASTED Asian Conference on Communication Systems and Networks
ICNVS'10 Proceedings of the 12th international conference on Networking, VLSI and signal processing
A cost matrix agent for shortest path routing in ad hoc networks
Journal of Network and Computer Applications
Path hopping based on reverse AODV for security
APNOMS'06 Proceedings of the 9th Asia-Pacific international conference on Network Operations and Management: management of Convergence Networks and Services
| Hi-index | 0.00 |
In mobile ad hoc networks, mobile devices wander autonomously for the use of wireless links and dynamically varying network topology. AODV (Ad-hoc on-demand Distance vector routing) is a representative among the most widely studied on-demand ad hoc routing protocols. Previous protocols have shown some shortcomings on performance. AODV and most of the on-demand ad hoc routing protocols use single route reply along reverse path. Rapid change of topology causes that the route reply could not arrive to the source node, i.e. after a source node sends several route request messages, the node obtains a reply message, especially on high speed mobility. This increases both in communication delay and power consumption as well as decrease in packet delivery ratio. To avoid these problems, we propose a reverse AODV which tries multiple route replies. The extended AODV is called reverse AODV (R-AODV), which has a novel aspect compared to other on-demand routing protocols on Ad-hoc Networks: it reduces path fail correction messages and obtains better performance than the AODV and other protocols have. We design the R-AODV protocol and implement simulation models using NS-2. Simulation results show that the reverse AODV provides good experimental results on packet delivery ratio, power consumption and communication delay.