An algebraic approach to network coding
IEEE/ACM Transactions on Networking (TON)
Error Control Coding, Second Edition
Error Control Coding, Second Edition
Fundamentals of wireless communication
Fundamentals of wireless communication
Optimal decoding and performance analysis of a noisy channel network with network coding
IEEE Transactions on Communications
High performance cooperative transmission protocols based on multiuser detection and network coding
IEEE Transactions on Wireless Communications
IEEE Transactions on Wireless Communications
IEEE Transactions on Information Theory
Distributed space-time-coded protocols for exploiting cooperative diversity in wireless networks
IEEE Transactions on Information Theory
Outage analysis of coded cooperation
IEEE Transactions on Information Theory
Information flow decomposition for network coding
IEEE Transactions on Information Theory
A Random Linear Network Coding Approach to Multicast
IEEE Transactions on Information Theory
A Network Coding Approach to Cooperative Diversity
IEEE Transactions on Information Theory
Hi-index | 0.00 |
We propose a new scheme for cooperative wireless networking based on linear network codes. The network consists of multiple (M ≥ 2) users having independent information to be transmitted to a common basestation (BS), assuming block-fading channels with independent fading for different codewords. The users collaborate in relaying messages. Because of potential transmission errors in links, resulting in erasures, the network topology is dynamic. To efficiently exploit the diversity available by cooperation and time-varying fading, we propose the use of diversity network codes (DNCs) over finite fields. These codes are designed such that the BS is able to rebuild the user information from a minimum possible set of coded blocks conveyed through the dynamic network. We show the existence of deterministic DNCs. We also show that the resulting diversity order using the proposed DNCs is 2M-1, which is higher than schemes without network coding or with binary network coding. Numerical results from simulations also show substantial improvement by the proposed DNCs over the benchmark schemes. We also propose simplified versions of the DNCs, which have much lower design complexity and still achieve the diversity order 2M - 1.