Throughput optimal control of cooperative relay networks

  • Yeh E
  • Berry R
  • 1


    Mendeley users who have this article in their library.
  • 72


    Citations of this article.


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.

Author-supplied keywords

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

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Get full text


  • Edmund M. Yeh

  • Randall A. Berry

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free