Utility optimal coding for packet transmission over wireless networks - Part II: Networks of packet erasure channels

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

*Corresponding author for this work

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

1 Citation (Scopus)

Abstract

We define a class of multi-hop erasure networks that approximates a wireless multi-hop network. The network carries unicast flows for multiple users, and each information packet within a flow is required to be decoded at the flow destination within a specified delay deadline. The allocation of coding rates amongst flows/users is constrained by network capacity. We propose a proportional fair transmission scheme that maximises the sum utility of flow throughputs. This is achieved by jointly optimising the packet coding rates and the allocation of bits of coded packets across transmission slots.

Original languageEnglish
Title of host publication2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011
Pages1600-1606
Number of pages7
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

Keywords

  • Code rate selection
  • cross layer optimisation
  • network utility maximisation
  • packet erasure channels
  • scheduling

Fingerprint

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

Cite this