Improved Power-Delay Trade-off in Wireless Networks Using Opportunistic Routing

We study the benefits of opportunistic routing in wireless networks by examining how the power and delay scale as the number of source-destination (S-D) pairs in the network increases. The scaling behavior of conventional multi-hop transmission that does not employ opportunistic routing is also examined for comparison. Our results indicate that opportunistic routing can exhibit a better power--delay trade-off than that of conventional routing by providing up to a logarithmic boost in the scaling law. Such a gain is possible since the receivers can tolerate more interference due to the increased received signal power provided by the multi-user diversity (MUD) gain, which means having more simultaneous transmissions is possible. Computer simulations for both routing schemes are also performed, which show trends consistent with our analytical predictions.

[1]  Babak Hassibi,et al.  On the capacity of MIMO broadcast channels with partial side information , 2005, IEEE Transactions on Information Theory.

[2]  Jan M. Rabaey,et al.  Modeling and analysis of opportunistic routing in low traffic scenarios , 2005, Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt'05).

[3]  Muriel Médard,et al.  The effect upon channel capacity in wireless communications of perfect and imperfect knowledge of the channel , 2000, IEEE Trans. Inf. Theory.

[4]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[5]  Ayfer Özgür,et al.  Hierarchical Cooperation Achieves Optimal Capacity Scaling in Ad Hoc Networks , 2006, IEEE Transactions on Information Theory.

[6]  Michael Gastpar,et al.  On the capacity of large Gaussian relay networks , 2005, IEEE Transactions on Information Theory.

[7]  PrabhakarBalaji,et al.  Optimal throughput-delay scaling in wireless networks , 2006 .

[8]  Urs Niesen,et al.  On Capacity Scaling in Arbitrary Wireless Networks , 2007, IEEE Transactions on Information Theory.

[9]  Babak Hassibi,et al.  Communication over a wireless network with random connections , 2006, IEEE Transactions on Information Theory.

[10]  Massimo Franceschetti,et al.  Closing the Gap in the Capacity of Wireless Networks Via Percolation Theory , 2007, IEEE Transactions on Information Theory.

[11]  Michele Zorzi,et al.  Geographic Random Forwarding (GeRaF) for Ad Hoc and Sensor Networks: Multihop Performance , 2003, IEEE Trans. Mob. Comput..

[12]  Hongqiang Zhai,et al.  On End-to-End Throughput of Opportunistic Routing in Multirate and Multihop Wireless Networks , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[13]  Donald E. Knuth,et al.  Big Omicron and big Omega and big Theta , 1976, SIGA.

[14]  Massimo Franceschetti,et al.  On the throughput scaling of wireless relay networks , 2006, IEEE Transactions on Information Theory.

[15]  Robert Tappan Morris,et al.  Opportunistic routing in multi-hop wireless networks , 2004, Comput. Commun. Rev..

[16]  Devavrat Shah,et al.  Optimal throughput-delay scaling in wireless networks - part I: the fluid model , 2006, IEEE Transactions on Information Theory.

[17]  Abbas El Gamal,et al.  Optimal Hopping in Ad Hoc Wireless Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[18]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[19]  David Tse,et al.  Opportunistic beamforming using dumb antennas , 2002, IEEE Trans. Inf. Theory.

[20]  Adam Shwartz,et al.  Large Deviations For Performance Analysis , 2019 .

[21]  Raymond Knopp,et al.  Information capacity and power control in single-cell multiuser communications , 1995, Proceedings IEEE International Conference on Communications ICC '95.

[22]  Panganamala Ramana Kumar,et al.  Towards an information theory of large networks: an achievable rate region , 2003, IEEE Trans. Inf. Theory.

[23]  Alexander M. Haimovich,et al.  Opportunistic Relaying in Wireless Networks , 2007, IEEE Transactions on Information Theory.

[24]  Eytan Modiano,et al.  Capacity and delay tradeoffs for ad hoc mobile networks , 2004, IEEE Transactions on Information Theory.

[25]  Srihari Nelakuditi,et al.  On the Efficacy of Opportunistic Routing , 2007, 2007 4th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks.

[26]  Jeffrey G. Andrews,et al.  The Effect of Fading, Channel Inversion, and Threshold Scheduling on Ad Hoc Networks , 2007, IEEE Transactions on Information Theory.

[27]  Xiaoli Ma,et al.  Improving Geographical Routing for Wireless Networks with an Efficient Path Pruning Algorithm , 2006, 2006 3rd Annual IEEE Communications Society on Sensor and Ad Hoc Communications and Networks.

[28]  Rene L. Cruz,et al.  The Capacity of Wireless Networks in Nonergodic Random Fading , 2009, IEEE Transactions on Information Theory.

[29]  Suhas N. Diggavi,et al.  The worst additive noise under a covariance constraint , 2001, IEEE Trans. Inf. Theory.

[30]  Sae-Young Chung,et al.  On the transport capacity of wireless ad-hoc networks , 2006 .

[31]  Panganamala Ramana Kumar,et al.  The transport capacity of wireless networks over fading channels , 2004, IEEE Transactions on Information Theory.

[32]  P. Gupta,et al.  Towards an information theory of large networks: an achievable rate region , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).

[33]  Abhijeet Bhorkar,et al.  An adaptive opportunistic routing scheme for wireless ad-hoc networks , 2009, 2009 IEEE International Symposium on Information Theory.

[34]  Sanjeev R. Kulkarni,et al.  Upper bounds to transport capacity of wireless networks , 2004, IEEE Transactions on Information Theory.

[35]  Andrea J. Goldsmith,et al.  Large wireless networks under fading, mobility, and delay constraints , 2004, IEEE INFOCOM 2004.

[36]  Russ Bubley,et al.  Randomized algorithms , 1995, CSUR.

[37]  Amir K. Khandani,et al.  Throughput Scaling Laws for Wireless Networks With Fading Channels , 2007, IEEE Transactions on Information Theory.