Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Location-aided routing (LAR) in mobile ad hoc networks
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
A distance routing effect algorithm for mobility (DREAM)
MobiCom '98 Proceedings of the 4th annual ACM/IEEE 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
GPS-Free Positioning in Mobile ad-hoc Networks
HICSS '01 Proceedings of the 34th Annual Hawaii International Conference on System Sciences ( HICSS-34)-Volume 9 - Volume 9
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
When Does Opportunistic Routing Make Sense?
PERCOMW '05 Proceedings of the Third IEEE International Conference on Pervasive Computing and Communications Workshops
ExOR: opportunistic multi-hop routing for wireless networks
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Hi-index | 0.00 |
Mobile ad hoc networks consist of mobile nodes which have no fixed infrastructure or centralized administration. Routing protocol design is critical to the performance and reliability of mobile ad hoc networks. Traditional routing protocols have been shown ineffective in coping with unreliable and unpredictable wireless medium. In this paper, we propose a Location-Aided Opportunistic Routing protocol (LAOR). LAOR uses nodes' location information to define the forwarding candidate set and to prioritize candidates. The priority of nodes in forwarding candidate set is defined by their distances to destination node, the nearer to destination node, the higher priority. Moreover, LAOR minimizes resource consumption and duplicate transmissions by judiciously selecting forwarding nodes to prevent routes from diverging. To further protect against packet losses, LAOR uses local recovery to retransmit a packet when an ACK is not received within a specified time. In the end, we validate LAOR using NS -2 simulations.