The Community for Technology Leaders
Green Image
Issue No. 10 - Oct. (2013 vol. 24)
ISSN: 1045-9219
pp: 2015-2024
Abdallah Khreishah , Temple University, Philadelphia
Issa Khalil , United Arab Emirates University, Al Ain
Jie Wu , Temple University, Philadelphia
The performance of wireless networks can be enhanced by performing network coding on the intermediate relay nodes. To enhance the throughput of large wireless networks, we can decompose them into a superposition of simple relay networks called two-hop relay networks. Previously, the capacity region of two-hop relay networks with multiple unicast sessions and limited feedback was characterized where packet erasure channels are used. A near-optimal coding scheme that exploits the broadcast nature and the diversity of the wireless links was proposed. However, the complexity of the scheme is exponential in terms of the number of sessions, as it requires the knowledge of the packets that are received by any subset of the receivers. In this paper, we provide a polynomial time coding scheme and characterize its performance using linear equations. The coding scheme uses random network coding to carefully mix intra and intersession network coding and makes a linear, not exponential, number of decisions. For two-hop relay networks with two sessions, we provide an optimal coding scheme that does not require the knowledge of the channel conditions. We also provide a linear programming formulation that uses our two-hop relay network results as a building block in large lossy multihop networks.
Relays, Encoding, Network coding, Wireless networks, Joints, Throughput, Complexity theory, fairness, Network coding, lossy wireless networks, two-hop relay networks, capacity

A. Khreishah, I. Khalil and J. Wu, "Low Complexity and Provably Efficient Algorithm for Joint Inter and Intrasession Network Coding in Wireless Networks," in IEEE Transactions on Parallel & Distributed Systems, vol. 24, no. , pp. 2015-2024, 2013.
88 ms
(Ver 3.3 (11022016))