Cooperative Strategies and Achievable Rate for Tree Networks With Optimal Spatial Reuse
Authors:
- 24 September 2007
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 53 (10) , 3596-3614
Abstract
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.Keywords
This publication has 36 references indexed in Scilit:
- Distributed Low-Complexity Maximum-Throughput Scheduling for Wireless Backhaul Networks2007
- Half-Duplex Estimate-and-Forward Relaying: Bounds and Code Design2006
- Relaying protocols for two colocated usersIEEE Transactions on Information Theory, 2006
- Capacity-Approaching Turbo Coding and Iterative Decoding for Relay ChannelsIEEE Transactions on Communications, 2005
- Cooperative strategies and capacity theorems for relay networksIEEE Transactions on Information Theory, 2005
- Lower Bounds on Data Collection Time in Sensory NetworksIEEE Journal on Selected Areas in Communications, 2004
- Distributed turbo coded diversity for relay channelElectronics Letters, 2003
- Near Shannon limit error-correcting coding and decoding: Turbo-codes. 12002
- Elements of Information Theory2001
- Capacity theorems for the relay channelIEEE Transactions on Information Theory, 1979