Cooperative Strategies and Optimal Scheduling for Tree Networks

In this paper, we develop and analyze a low-complexity cooperative protocol that significantly increases the average throughput of multi-hop upstream transmissions for wireless tree networks. We consider a system in which transmissions are assigned to nodes in a collision free, spatial time division fashion. This 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. We derive the achievable rate and propose an optimal schedule that realizes this rate for any regular tree network. We show that our protocol dramatically outperforms the conventional scheme where intermediate nodes simply forward the packets hop by hop. At high signal-to-noise ratio, it yields approximatively 80% throughput gain.