TY - JOUR
T1 - Throughput optimal control of cooperative relay networks
AU - Yeh, Edmund M.
AU - Berry, Randall A.
N1 - Funding Information:
Manuscript received September 2, 2006; revised May 13, 2007. This research was supported in part by NSF under Grants CCR-0313329 and CCR-0313183, by ARO under Grant DAAD19-03-1-0229, and by DARPA under Grant W911NF-07-1-0028. The material in this correspondence was presented in part at the IEEE International Symposium on Information Theory, Nice, France, June 2007.
PY - 2007/10
Y1 - 2007/10
N2 - 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.
AB - 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.
KW - Backpressure algorithm
KW - Cooperative relaying
KW - Wireless networks
KW - Wireless resource allocation
UR - http://www.scopus.com/inward/record.url?scp=35148834600&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=35148834600&partnerID=8YFLogxK
U2 - 10.1109/TIT.2007.904978
DO - 10.1109/TIT.2007.904978
M3 - Article
AN - SCOPUS:35148834600
VL - 53
SP - 3827
EP - 3833
JO - IEEE Transactions on Information Theory
JF - IEEE Transactions on Information Theory
SN - 0018-9448
IS - 10
ER -