A practical joint network-channel coding scheme for reliable communication in wireless networks
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Distributed coding for cooperative wireless networks: an overview and recent advances
IEEE Communications Magazine
Phoenix: making cooperation more efficient through network coding in wireless networks
IEEE Transactions on Wireless Communications
Network-coded cooperative diversity in multi-hop cellular networks
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
APCC'09 Proceedings of the 15th Asia-Pacific conference on Communications
Outage probability analysis of linear block network coding (LBNC) in wireless relay networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
On performance of multi-timeslots network coding (MTNC) in wireless relay networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Is network coding always good for cooperative communications?
INFOCOM'10 Proceedings of the 29th conference on Information communications
Block-Markov encoding with network coding for cooperative communications
Computer Communications
Multiple-user cooperative communications based on linear network coding
IEEE Transactions on Communications
Enhanced cooperative communication MAC for mobile wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.01 |
We consider user cooperation in a relay network that comprises a large collection of transmitters sending wireless data to a common receiver. A new framework exploiting the network coding technology, referred to as adaptive network coded cooperation (ANCC), is proposed to combat the lossy nature of wireless links and to adapt to the changing network topology. The central idea is to match network-on-graph, i.e. instantaneous network topologies described in graphs, with the well-known class of code-on-graph, i.e. low-density parity-check (LDPC) codes and LDPC-like codes. Both achievable rates and outage probabilities are evaluated for ANCC, and closed-form expressions are derived for the asymptotic case where the network size increases without bound. Compared with the existing schemes, ANCC significantly outperforms repetition-based schemes and performs on par with space-time coded cooperation (STCC), but obviates the need for stringent inter-user synchronization at the bit/baud level.