How good is opportunistic routing?
Authors:
Open Access
- 27 October 2008
- conference paper
- Published by Association for Computing Machinery (ACM)
- Vol. 10 (1) , 260-267
Abstract
Considerations of realistic channel dynamics motivate the design of a new breed of opportunistic schemes, such as opportunistic transmission, scheduling and routing. Compared to their deterministic counter part, opportunistic schemes have been shown to increase network throughput, and/or reduce delay in limited experimental/simulation scenarios. In this paper, we propose analytical models that characterize the performance of routing protocols in lossy wireless networks with Rayleigh fading channels. We investigate the efficiency of a few representative deterministic and opportunistic routing protocols under both light-loaded and saturated traffic conditions. This work deviates from existing work that assumes idealistic packet reception, and is thus of practical relevance. Our study shows that opportunistic routing significantly outperforms its deterministic counterpart in average effective progresses made in single-hop transmissions. In deterministic routing schemes, tuning of parameters based on node density is critical to achieve optimal performance.Keywords
This publication has 9 references indexed in Scilit:
- Trading structure for randomness in wireless opportunistic routing2007
- A Stochastic Geometry Analysis of Dense IEEE 802.11 Networks2007
- On routing in random Rayleigh fading networksIEEE Transactions on Wireless Communications, 2005
- ExOR2005
- MOAR: a multi-channel opportunistic auto-rate media access protocol for ad hoc networks2004
- Opportunistic large arrays: cooperative transmission in wireless multihop ad hoc networks to reach far distancesIEEE Transactions on Signal Processing, 2003
- A framework for opportunistic scheduling in wireless networksComputer Networks, 2003
- Opportunistic media access for multirate ad hoc networks2002
- The capacity of wireless networksIEEE Transactions on Information Theory, 2000