TY - JOUR
T1 - Proportional Fair Coding for Wireless Mesh Networks
AU - Premkumar, Karumbu
AU - Chen, Xiaomin
AU - Leith, Douglas J.
PY - 2015/2/1
Y1 - 2015/2/1
N2 - We consider multihop wireless networks carrying unicast flows for multiple users. Each flow has a specified delay deadline, and the lossy wireless links are modeled as binary symmetric channels (BSCs). Since transmission time, also called airtime, on the links is shared among flows, increasing the airtime for one flow comes at the cost of reducing the airtime available to other flows sharing the same link. We derive the joint allocation of flow airtimes and coding rates that achieves the proportionally fair throughput allocation. This utility optimization problem is nonconvex, and one of the technical contributions of this paper is to show that the proportional fair utility optimization can nevertheless be decomposed into a sequence of convex optimization problems. The solution to this sequence of convex problems is the unique solution to the original nonconvex optimization. Surprisingly, this solution can be written in an explicit form that yields considerable insight into the nature of the proportional fair joint airtime/coding rate allocation. To our knowledge, this is the first time that the utility fair joint allocation of airtime/coding rate has been analyzed, and also one of the first times that utility fairness with delay deadlines has been considered.
AB - We consider multihop wireless networks carrying unicast flows for multiple users. Each flow has a specified delay deadline, and the lossy wireless links are modeled as binary symmetric channels (BSCs). Since transmission time, also called airtime, on the links is shared among flows, increasing the airtime for one flow comes at the cost of reducing the airtime available to other flows sharing the same link. We derive the joint allocation of flow airtimes and coding rates that achieves the proportionally fair throughput allocation. This utility optimization problem is nonconvex, and one of the technical contributions of this paper is to show that the proportional fair utility optimization can nevertheless be decomposed into a sequence of convex optimization problems. The solution to this sequence of convex problems is the unique solution to the original nonconvex optimization. Surprisingly, this solution can be written in an explicit form that yields considerable insight into the nature of the proportional fair joint airtime/coding rate allocation. To our knowledge, this is the first time that the utility fair joint allocation of airtime/coding rate has been analyzed, and also one of the first times that utility fairness with delay deadlines has been considered.
KW - Binary symmetric channels
KW - code rate selection
KW - cross-layer optimization
KW - network utility maximization
KW - optimal packet size
KW - resource allocation
KW - scheduling
U2 - 10.1109/TNET.2014.2298974
DO - 10.1109/TNET.2014.2298974
M3 - Article
SN - 1063-6692
VL - 23
SP - 269
EP - 281
JO - IEEE/ACM Transactions on Networking
JF - IEEE/ACM Transactions on Networking
IS - 1
ER -