How good is opportunistic routing?: a reality check under Rayleigh fading channels

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.

REFERENCES

• 1: Sanjit Biswas , Robert Morris, ExOR: opportunistic multi-hop routing for wireless networks, Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications, August 22-26, 2005, Philadelphia, Pennsylvania, USA
• 2: Szymon Chachulski , Michael Jennings , Sachin Katti , Dina Katabi, Trading structure for randomness in wireless opportunistic routing, Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications, August 27-31, 2007, Kyoto, Japan
• 3: Amparo Gil , Javier Segura , Nico M. Temme, Numerical Methods for Special Functions, Society for Industrial and Applied Mathematics, Philadelphia, PA, 2007
• 4: P. Gupta and P. R. Kumar. The capacity of wireless networks. IEEE Transactions on Information Theory, pages 388--404, Mar 2000.
• 5: M. Haenggi. On routing in random Rayleigh fading networks. IEEE Trans. on Wireless Communications, 4(4):1553--1562, 2005.
• 6: V. Kanodia , A. Sabharwal , E. Knightly, MOAR: A Multi-Channel Opportunistic Auto-Rate Media Access Protocol for Ad Hoc Networks, Proceedings of the First International Conference on Broadband Networks, p.600-610, October 25-29, 2004 [doi>10.1109/BROADNETS.2004.46]
• 7: Xin Liu , Edwin K. P. Chong , Ness B. Shroff, A framework for opportunistic scheduling in wireless networks, Computer Networks: The International Journal of Computer and Telecommunications Networking, v.41 n.4, p.451-474, 15 March 2003 [doi>10.1016/S1389-1286(02)00401-2]
• 8: H. Q. Nguyen, F. Baccelli, and D. Kofman. A Stochastic Geometry Analysis of Dense IEEE 802.11 Networks. In Proc. of IEEE Infocom'07, Mar 2007.
• 9: B. Sadeghi , V. Kanodia , A. Sabharwal , E. Knightly, Opportunistic media access for multirate ad hoc networks, Proceedings of the 8th annual international conference on Mobile computing and networking, September 23-28, 2002, Atlanta, Georgia, USA [doi>10.1145/570645.570650]
• 10: A. Scaglione and Y.W. Hong. Opportunistic large arrays: Cooperative transmission in wireless multihop ad hoc networks to reach far distances. IEEE transactions on Signal Processing, 51(8):2082--2092, 2003.
• 11: D. Stoyan, W. S. Kendall, and J. Mecke. Stochastic Geometry and its Applications. Chichester-Wesley, 2nd edition, 1995.

INDEX TERMS

Primary Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.1 Network Architecture and Design
          Subjects: Wireless communication

Additional Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.1 Network Architecture and Design
          Subjects: Distributed networks

General Terms:
Algorithms, Theory

Keywords:
average progress, opportunistic routing, rayleigh fading channel