Elements of information theory
Elements of information theory
Topology control and routing in ad hoc networks: a survey
ACM SIGACT News
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Wireless Personal and Local Area Networks
Wireless Personal and Local Area Networks
An algebraic approach to network coding
IEEE/ACM Transactions on Networking (TON)
Network coding: an instant primer
ACM SIGCOMM Computer Communication Review
rDCF: A Relay-Enabled Medium Access Control Protocol for Wireless Ad Hoc Networks
IEEE Transactions on Mobile Computing
XORs in the air: practical wireless network coding
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
IEEE Transactions on Information Theory
Insufficiency of linear coding in network information flow
IEEE Transactions on Information Theory
Hi-index | 0.24 |
This paper proposes a relay-aided network coding (RANC) scheme that considers how to improve the performance gain of network coding by exploiting the physical layer multi-rate capability in multi-hop wireless networks. In RANC, nodes are allowed to transmit at different rates according to the channel condition. Different from the recently proposed opportunistic overhearing and coding schemes by COPE [S. Katti, H. Rahul, W. Hu, D. Katabi, M. Medard, J. Crowcroft, XORs in the air: practical wireless network coding, in: Proc. of ACM SIGCOMM'06, September 2006.], each node may either send its own packet or relay the packets received from its neighbors in form of a coded packet. Since the relayed packets can usually be transmitted at a high rate, the total packets that are necessary for decoding can be delivered to each destination node much faster than direct transmissions. We conduct rigorous analysis to find the design principles and study the tradeoff in the performance gain of RANC. Based on the analytical results, we provide a practical solution by decomposing the original design problem into two sub-problems, which are the flow partition problem and the scheduling problem. The performance of RANC is also evaluated via simulations. The simulation results show that, compared to COPE, RANC can significantly improve the performance gain of network coding.