Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
The Cricket location-support system
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
A scalable location service for geographic ad hoc routing
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Routing with guaranteed delivery in ad hoc wireless networks
Wireless Networks
SHARP: a hybrid adaptive routing protocol for mobile ad hoc networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Geographic routing without location information
Proceedings of the 9th annual international conference on Mobile computing and networking
Proceedings of the 10th annual international conference on Mobile computing and networking
Stochastic properties of the random waypoint mobility model
Wireless Networks
Scalable routing strategies for ad hoc wireless networks
IEEE Journal on Selected Areas in Communications
Performance evaluation of location-aided routing protocols in ad hoc networks
GIIS'09 Proceedings of the Second international conference on Global Information Infrastructure Symposium
Improving routing in networks of Unmanned Aerial Vehicles: Reactive-Greedy-Reactive
Wireless Communications & Mobile Computing
Hi-index | 0.00 |
Random loss in wireless ad hoc networks derives from two main causes: lossy wireless links and node mobility. Packet loss and link breakage can dramatically degrade the performance of any network protocol thus making routing in mobile ad hoc networks extremely challenging. In this study we focus on applications that exhibit mobility and random packet loss. Possible scenarios include search and rescue, urban homeland defense, small unit battlefield operations, and car to car network gaming. We explore the robustness of the routing solutions in regards to speed (up to vehicular ranges), random packet loss, and traffic load. Traditional routing protocol candidates are proactive, reactive and location-assisted (i.e., geographic) such as OLSR, AODV and GPSR. However, the performances of each protocol varies significantly with mobility and random loss shown in the paper. In our approach we seek to a hybrid solution AODV-DFR (AODV with Directional Forward Routing) that combines the positive aspects of previously proposed schemes. AODV-DFR utilizes the positive features of both proactive and reactive routing schemes, in addition, it borrows the greedy forwarding concept found in geo-routing. This allows for AODVDFR to automatically find good candidates for packet forwarding in case of route breakage. Greedy forwarding here takes the form of "directional forwarding". Each node keeps a gradient direction toward the destination. This direction is dynamically refreshed based on periodic, proactive updates issued by the destination. Simulation studies show that AODV-DFR outperforms conventional protocols and previous hybrid routing solutions across a wide range of network characteristics.