On routing in lossy wireless networks with realistic channel models

Authors:
Rong Zheng
Affiliations:
University of Houston, Houston, TX, USA
Venue:
Proceedings of the 1st ACM international workshop on Foundations of wireless ad hoc and sensor networking and computing
Year:
2008

Citing 8
Cited 0

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
Opportunistic large arrays: cooperative transmission in wireless multihop ad hoc networks to reach far distances

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper concerns routing performance in lossy wireless networks with Rayleigh fading channel. We investigate the efficiency of a few representative deterministic and opportunistic routing protocols under light-loaded traffic conditions. This work deviates from existing work that assumes idealistic packet reception, and is thus of practical relevant. Our study shows that opportunistic routing significantly outperforms its deterministic counterparts in average effective progress in a single hop transmission. In deterministic routing schemes, tuning of parameters based on node density is critical to achieve optimal performance.