Answers are grounded in this paper and cite their sources.
In this paper, we propose a simple and practical opportunistic routing algorithm, and we analyze its performance along a multi-hop wireless network path, while considering link-level interference among the network nodes. Through our analysis, we show that our algorithm results in significant improvement in throughput, especially for short-haul paths. The proposed algorithm can be easily integrated into most routing protocols with only minor modifications. Consequently, the algorithm provides a practical and effective approach for implementation of opportunistic routing in wireless networks.
No takes yet. Share an insight, caveat, or question.
Lee et al. (2011) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: