Dynamic fine-grained localization in Ad-Hoc networks of sensors
Proceedings of the 7th annual international conference on Mobile computing and networking
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
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
The medium time metric: high throughput route selection in multi-rate ad hoc wireless networks
Mobile Networks and Applications
Trading structure for randomness in wireless opportunistic routing
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
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: Multihop Performance
IEEE Transactions on Mobile Computing
Geographic Random Forwarding (GeRaF) for Ad Hoc and Sensor Networks: Energy and Latency Performance
IEEE Transactions on Mobile Computing
On throughput efficiency of geographic opportunistic routing in multihop wireless networks
The Fourth International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness & Workshops
The capacity of wireless networks
IEEE Transactions on Information Theory
Opportunistic real-time routing in multi-hop wireless sensor networks
Proceedings of the 2009 ACM symposium on Applied Computing
IEEE Transactions on Wireless Communications
TO-GO: topology-assist geo-opportunistic routing in urban vehicular grids
WONS'09 Proceedings of the Sixth international conference on Wireless On-Demand Network Systems and Services
A backoff differentiation scheme for contention resolution in wireless converge-cast networks
Concurrency and Computation: Practice & Experience
| Hi-index | 0.00 |
Geographic opportunistic routing (GOR) has shown throughput efficiency in coping with unreliable transmissions in multihop wireless networks. The basic idea behind opportunistic routing is to take advantage of the broadcast nature and spacial diversity of the wireless medium by involving multiple neighbors of the sender into the local forwarding, thus improve transmission reliability. The existing GOR schemes typically involve as many as available next-hop neighbors into the local forwarding, and give the nodes closer to the destination higher relay priorities. In this paper, we show that it is not always the optimal way to achieve the best throughput. We introduce a framework to analyze the one-hop throughput of GOR, provide a deeper insight into the trade-off between the benefit (packet advancement and transmission reliability) and cost (medium time delay) associated with the node collaboration, and propose a local metric named expected one-hop throughput (EOT) to balance the benefit and cost. We also identify an upper bound of EOT and its concavity, which indicates that even if the candidate coordination delay were negligible, the throughput gain would become marginal when the number of forwarding candidates increases. Based on the EOT, we also propose a local candidate selection and prioritization algorithm. Simulation results validate our analysis and show that the EOT metric leads to both better one-hop and path throughput than the corresponding pure GOR and geographic routing.