pith. sign in

arxiv: 1107.1890 · v1 · pith:J3U4PDXJnew · submitted 2011-07-10 · 💻 cs.IT · cs.NI· math.IT

Utility Optimal Coding for Packet Transmission over Wireless Networks - Part II: Networks of Packet Erasure Channels

classification 💻 cs.IT cs.NImath.IT
keywords packetcodingflownetworknetworkstransmissionallocationerasure
0
0 comments X
read the original 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 {\em jointly optimising the packet coding rates and the allocation of bits of coded packets across transmission slots.}

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.