4th International ICST Conference on Wireless Internet

Research Article

Throughput and stability of digital and analog network coding for wireless networks with single and multiple relays

Download312 downloads
  • @INPROCEEDINGS{10.4108/ICST.WICON2008.4967,
        author={Yalin Evren  Sagduyu and Dongning Guo and Randall Berry},
        title={Throughput and stability of digital and analog network coding for wireless networks with single and multiple relays},
        proceedings={4th International ICST Conference on Wireless Internet},
        publisher={ICST},
        proceedings_a={WICON},
        year={2010},
        month={5},
        keywords={Analog network coding digital network coding queue stability stable throughput region throughput optimal control.},
        doi={10.4108/ICST.WICON2008.4967}
    }
    
  • Yalin Evren Sagduyu
    Dongning Guo
    Randall Berry
    Year: 2010
    Throughput and stability of digital and analog network coding for wireless networks with single and multiple relays
    WICON
    ICST
    DOI: 10.4108/ICST.WICON2008.4967
Yalin Evren Sagduyu1,*, Dongning Guo1,*, Randall Berry1,*
  • 1: Electrical Engineering and Computer Science, Northwestern University, Evanston, IL 60208, USA
*Contact email: y-sagduyu@northwestern.edu, dguo@northwestern.edu, rberry@ece._northwestern.edu

Abstract

We evaluate the throughput and stability properties of digital and analog network coding for wireless terminals exchanging broadcast traffic with the assistance of relay nodes. For stochastically varying traffic, the stable operation is compared under the different schemes of plain routing, and digital and analog network coding, at the packet and the signal levels, respectively. For each network coding scheme, the queue dynamics are specified for the terminal and relay nodes, and the maximum throughput region is optimized over all transmission schedules. We then give generalizations of the well-known back-pressure policy for each scheme, which accounts for the coupling of the queues due to network coding and is throughput optimal, i.e., it stabilizes the network whenever this is possible. Our initial analysis focuses on a network with a single relay node. We then discuss extensions of this to arbitrary terminal-relay configurations in a general multihop network. A general framework is established to construct the maximum throughput region and throughput optimal scheduling is jointly designed with network coding for relay networks with general channel rates. For any achievable rates in the maximum throughput region the dynamic scheduling and coding ensure that the average queue lengths at the terminal and relay nodes are asymptotically bounded.