Opportunistic media access for multirate ad hoc networks
Proceedings of the 8th annual international conference on Mobile computing and networking
A framework for opportunistic scheduling in wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
MOAR: A Multi-Channel Opportunistic Auto-Rate Media Access Protocol for Ad Hoc Networks
BROADNETS '04 Proceedings of the First International Conference on Broadband Networks
ExOR: opportunistic multi-hop routing for wireless networks
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Trading structure for randomness in wireless opportunistic routing
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Numerical Methods for Special Functions
Numerical Methods for Special Functions
IEEE Transactions on Signal Processing
On routing in random Rayleigh fading networks
IEEE Transactions on Wireless Communications
The capacity of wireless networks
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
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.