By Topic

Adaptive network coded cooperation (ANCC) for wireless relay networks: matching code-on-graph with network-on-graph

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Xingkai Bao ; Student Member ; Jing Li

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.

Published in:

IEEE Transactions on Wireless Communications  (Volume:7 ,  Issue: 2 )