Throughput optimal control of cooperative relay networks

Edmund M. Yeh*, Randall A. Berry

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

80 Scopus citations

Abstract

In cooperative relaying, multiple nodes cooperate to forward a packet within a network. To date, such schemes have been primarily investigated at the physical layer with the focus on communication of a single end-to-end flow. This paper considers cooperative relay networks with multiple stochastically varying flows, which may be queued within the network. Throughput optimal network control policies are studied that take into account queue dynamics to jointly optimize routing, scheduling and resource allocation. To this end, a generalization of the Maximum Differential Backlog algorithm is given, which takes into account the cooperative gains in the network. Several structural characteristics of this policy are discussed for the special case of parallel relay networks.

Original languageEnglish (US)
Pages (from-to)3827-3833
Number of pages7
JournalIEEE Transactions on Information Theory
Volume53
Issue number10
DOIs
StatePublished - Oct 2007

Keywords

  • Backpressure algorithm
  • Cooperative relaying
  • Wireless networks
  • Wireless resource allocation

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Fingerprint Dive into the research topics of 'Throughput optimal control of cooperative relay networks'. Together they form a unique fingerprint.

Cite this