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
Routing with guaranteed delivery in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Dynamic fine-grained localization in Ad-Hoc networks of sensors
Proceedings of the 7th annual international conference on Mobile computing and networking
Introduction to algorithms
Geometric ad-hoc routing: of theory and practice
Proceedings of the twenty-second annual symposium on Principles of distributed computing
A high-throughput path metric for multi-hop wireless routing
Proceedings of the 9th annual international conference on Mobile computing and networking
Understanding packet delivery performance in dense wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Energy-efficient forwarding strategies for geographic routing in lossy wireless sensor networks
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Simulating the power consumption of large-scale sensor network applications
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
When Does Opportunistic Routing Make Sense?
PERCOMW '05 Proceedings of the Third IEEE International Conference on Pervasive Computing and Communications Workshops
Modeling and Analysis of Opportunistic Routing in Low Traffic Scenarios
WIOPT '05 Proceedings of the Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Efficient geographic routing in multihop wireless networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
ExOR: opportunistic multi-hop routing for wireless networks
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
WiseMAC: an ultra low power MAC protocol for the downlink of infrastructure wireless sensor networks
ISCC '04 Proceedings of the Ninth International Symposium on Computers and Communications 2004 Volume 2 (ISCC"04) - Volume 02
On Geographic Collaborative Forwarding in Wireless Ad Hoc and Sensor Networks
WASA '07 Proceedings of the International Conference on Wireless Algorithms,Systems and Applications
Geographic Random Forwarding (GeRaF) for Ad Hoc and Sensor Networks: Energy and Latency Performance
IEEE Transactions on Mobile Computing
Energy-Efficient Beaconless Geographic Routing in Wireless Sensor Networks
IEEE Transactions on Parallel and Distributed Systems
FSA: a fast coordination scheme for opportunistic routing
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
QMOR: QoS-Aware Multi-sink Opportunistic Routing for Wireless Multimedia Sensor Networks
Wireless Personal Communications: An International Journal
Hi-index | 0.00 |
Geographic opportunistic routing (GOR) is an emerging technique that can improve energy efficiency in lossy multihop wireless networks. GOR makes local routing decision by using nodes' location information, and exploits the broadcast nature and spatial diversity of the wireless medium to improve the packet forwarding reliability. In this paper, our goal is to fully understand the principles and tradeoffs in GOR, thus provide insightful analysis and guidance to the design of more efficient routing protocols in multihop wireless networks. We propose a local metric, one-hop energy efficiency (OEE), to balance the packet advancement, reliability and energy consumption in GOR. We identify and prove important properties about GOR on selecting and prioritizing the forwarding candidates in order to maximize the expected packet advancement. Leveraging the proved properties, we then propose two localized candidate selection algorithms with O(N 3) running time to determine the forwarding candidate set that maximizes OEE, where N is the number of available next-hop neighbors. Through extensive simulations, we show that GOR applying OEE achieves better energy efficiency than the existing geographic routing and blind opportunistic routing schemes under different node densities and packet sizes.