Cooperative Strategies and Achievable Rate for Tree Networks With Optimal Spatial Reuse

In this paper, a low-complexity cooperative protocol that significantly increases the average throughput of multihop upstream transmissions for wireless tree networks is developed and analyzed. A system in which transmissions are assigned to nodes in a collision free, spatial time division fashion is considered. The suggested protocol exploits the broadcast nature of wireless networks where the communication channel is shared between multiple adjacent nodes within interference range. For any upstream end-to-end flow in the tree, each intermediate node receives information from both one-hop and two-hop neighbors and transmits only sufficient information such that the next upstream one-hop neighbor will be able to decode the packet. This approach can be viewed as the generalization of the classical three node relay channel for end-to-end flows in which each intermediate node becomes successively source, relay and destination. The achievable rate for any regular tree network is derived and an optimal schedule that realizes this rate in most cases is proposed. Our protocol is shown to dramatically outperform the conventional scheme where intermediate nodes simply forward the packets hop by hop. At high signal-to-noise ratio (SNR), it yields approximately 66% throughput gain for practical scenarios.

[1]  Massimo Franceschetti,et al.  Information theoretic bounds on the throughput scaling of wireless relay networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[2]  Martin Haenggi,et al.  Bandwidth- and power-efficient routing in linear wireless networks , 2006, IEEE Transactions on Information Theory.

[3]  Ram Ramanathan,et al.  Challenges: a radically new architecture for next generation mobile ad hoc networks , 2005, MobiCom '05.

[4]  Edward W. Knightly,et al.  Measurement driven deployment of a two-tier urban mesh access network , 2006, MobiSys '06.

[5]  Ian F. Akyildiz,et al.  Wireless mesh networks: a survey , 2005, Comput. Networks.

[6]  E. Meulen,et al.  Three-terminal communication channels , 1971, Advances in Applied Probability.

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

[8]  Edward W. Knightly,et al.  Distributed Low-Complexity Maximum-Throughput Scheduling for Wireless Backhaul Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[9]  Philip Schniter,et al.  Achievable diversity-vs-multiplexing tradeoffs in half-duplex cooperative channels , 2004, Information Theory Workshop.

[10]  Gregory W. Wornell,et al.  Cooperative diversity in wireless networks: Efficient protocols and outage behavior , 2004, IEEE Transactions on Information Theory.

[11]  Zixiang Xiong,et al.  Wyner-Ziv coding for the half-duplex relay channel , 2005, Proceedings. (ICASSP '05). IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005..

[12]  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).

[13]  Koushik Kar,et al.  Achieving 2 / 3 Throughput Approximation with Sequential Maximal Scheduling under Primary Interference Constraints , 2006 .

[14]  鈴木 貴,et al.  Institute for Mathematics and Its Applications (IMA)について , 1985 .

[15]  Michael Gastpar,et al.  Cooperative strategies and capacity theorems for relay networks , 2005, IEEE Transactions on Information Theory.

[16]  Zheng Zhang,et al.  Capacity-approaching turbo coding and iterative decoding for relay channels , 2005, IEEE Transactions on Communications.

[17]  R. Gallager,et al.  The Gaussian parallel relay network , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).

[18]  Ashutosh Sabharwal,et al.  LDPC Code Design for Half-Duplex Decode-and-Forward Relaying , 2005 .

[19]  Elza Erkip,et al.  User cooperation diversity. Part I. System description , 2003, IEEE Trans. Commun..

[20]  Jean-Yves Le Boudec,et al.  Rate performance objectives of multihop wireless networks , 2004, IEEE INFOCOM 2004.

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

[22]  Sanjeev R. Kulkarni,et al.  Degraded Gaussian multirelay channel: capacity and optimal power allocation , 2004, IEEE Transactions on Information Theory.

[23]  Matthew C. Valenti,et al.  Distributed turbo coded diversity for relay channel , 2003 .

[24]  Edward W. Knightly,et al.  Congestion control in CSMA-based networks with inconsistent channel state , 2006, WICON '06.

[25]  Edward W. Knightly,et al.  End-to-end performance and fairness in multihop wireless backhaul networks , 2004, MobiCom '04.

[26]  Ashutosh Sabharwal,et al.  Half-Duplex Estimate-and-Forward Relaying: Bounds and Code Design , 2006, 2006 IEEE International Symposium on Information Theory.

[27]  Philip Schniter,et al.  On the achievable diversity-multiplexing tradeoff in half-duplex cooperative channels , 2005, IEEE Transactions on Information Theory.

[28]  Jean-Pierre Hubaux,et al.  A Fair Scheduling for Wireless Mesh Networks , 2005 .

[29]  A. Glavieux,et al.  Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1 , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.

[30]  Leonard Kleinrock,et al.  Spatial TDMA: A Collision-Free Multihop Channel Access Protocol , 1985, IEEE Trans. Commun..

[31]  Anders Høst-Madsen,et al.  Capacity bounds and power allocation for wireless relay channels , 2005, IEEE Transactions on Information Theory.

[32]  Massimo Franceschetti,et al.  Lower bounds on data collection time in sensory networks , 2004, IEEE Journal on Selected Areas in Communications.

[33]  A. de Baynast,et al.  A Systematic Construction of LDPC Codes for Relay Channel in Time-Division mode , 2006, 2006 Fortieth Asilomar Conference on Signals, Systems and Computers.

[34]  Halim Yanikomeroglu,et al.  Multihop diversity in wireless relaying channels , 2004, IEEE Transactions on Communications.

[35]  Michael L. Honig,et al.  Distributed interference compensation for wireless networks , 2006, IEEE Journal on Selected Areas in Communications.

[36]  Panganamala Ramana Kumar,et al.  An achievable rate for the multiple-level relay channel , 2005, IEEE Transactions on Information Theory.

[37]  Ramjee Prasad,et al.  OFDM for Wireless Multimedia Communications , 1999 .

[38]  Randall Berry,et al.  Distributed approaches for exploiting multiuser diversity in wireless networks , 2006, IEEE Transactions on Information Theory.

[39]  Min Cao,et al.  A tractable algorithm for fair and efficient uplink scheduling of multi-hop wimax mesh networks , 2006, 2006 2nd IEEE Workshop on Wireless Mesh Networks.

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

[41]  Shlomo Shamai,et al.  Relaying protocols for two colocated users , 2006, IEEE Transactions on Information Theory.

[42]  Lili Qiu,et al.  Impact of Interference on Multi-Hop Wireless Network Performance , 2003, MobiCom '03.

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

[44]  Zygmunt J. Haas,et al.  On the throughput enhancement of the downstream channel in cellular radio networks through multihop relaying , 2004, IEEE Journal on Selected Areas in Communications.

[45]  Abbas El Gamal,et al.  Capacity theorems for the relay channel , 1979, IEEE Trans. Inf. Theory.