Utility optimal coding for packet transmission over wireless networks - Part I: Networks of binary symmetric channels

K. Premkumar*, Xiaomin Chen, Douglas J. Leith

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Citations (Scopus)

Abstract

We consider multi-hop networks comprising Binary Symmetric Channels (BSCs). The network carries unicast flows for multiple users. The utility of the network is the sum of the utilities of the flows, where the utility of each flow is a concave function of its throughput. Given that the network capacity is shared by the flows, there is a contention for network resources like coding rate (at the physical layer), scheduling time (at the MAC layer), etc., among the flows. We propose a proportional fair transmission scheme that maximises the sum utility of flow throughputs subject to the rate and the scheduling constraints. This is achieved by jointly optimising the packet coding rates of all the flows through the network.

Original languageEnglish
Title of host publication2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011
Pages1592-1599
Number of pages8
DOIs
Publication statusPublished - 2011
Externally publishedYes
Event2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011 - Monticello, IL, United States
Duration: 28 Sept 201130 Sept 2011

Publication series

Name2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011

Conference

Conference2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011
Country/TerritoryUnited States
CityMonticello, IL
Period28/09/1130/09/11

Fingerprint

Dive into the research topics of 'Utility optimal coding for packet transmission over wireless networks - Part I: Networks of binary symmetric channels'. Together they form a unique fingerprint.

Cite this