Cooperation above the physical layer: the case of a simple network

  • Authors:
  • Beiyu Rong;Anthony Ephremides

  • Affiliations:
  • Department of Electrical and Computer Engineering, University of Maryland, College Park, MD;Department of Electrical and Computer Engineering, University of Maryland, College Park, MD

  • Venue:
  • ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we investigate the effects of "network-level" cooperation in a wireless three-node network with packet erasure links. Cooperation is achieved through the relaying of packets from the node farthest away from the destination by the intermediate node. We consider both scheduled access and random access, and compare the performance metrics of "stability region" and "throughput region". We observe that the throughput region depends on the priority choices at the relay node, and mayor may not be equal to the stability region, which is shown to be independent of the priority choices. By contrast, in the non-cooperative random access system, the stability region and the throughput region are proved to be identical. Furthermore, if we apply network coding at the relay node, there is no improvement either in the stability region or in the throughput region over plain store-and-forward routing.