TY - JOUR
T1 - Utility-optimal random-access control
AU - Lee, Jang Won
AU - Chiang, Mung
AU - Calderbank, A. Robert
N1 - Funding Information:
Manuscript received December 6, 2005; revised April 4, 2006 and June 23, 2006; accepted July 3, 2006. The associate editor coordinating the review of this paper and approving it for publication was M. Zorzi. This work was supported by Yonsei University research fund of 2005 and NSF Grants CCF-0430487, CCF-0440443, CNS-0417607, CNS-0427677, and CCF-0448012. The earlier version of this paper was presented at IEEE Infocom 2006 [1].
PY - 2007/7
Y1 - 2007/7
N2 - This paper designs medium access control (MAC) protocols for wireless networks through the network utility maximization (NUM) framework. A network-wide utility maximization problem is formulated, using a collision/persistenceprobabilistic model and aligning selfish utility with total social welfare. By adjusting the parameters in the utility objective functions of the NUM problem, we can also control the tradeoff between efficiency and fairness of radio resource allocation. We develop two distributed algorithms to solve the utility-optimal random-access control problem, which lead to random access protocols that have slightly more message passing overhead than the current exponential-backoff protocols, but significant potential for efficiency and fairness improvement. We provide readily-verifiable sufficient conditions under which convergence of the proposed algorithms to a global optimality of network utility can be guaranteed, and numerical experiments that illustrate the value of the NUM approach to the complexity-performance tradeoff in MAC design.
AB - This paper designs medium access control (MAC) protocols for wireless networks through the network utility maximization (NUM) framework. A network-wide utility maximization problem is formulated, using a collision/persistenceprobabilistic model and aligning selfish utility with total social welfare. By adjusting the parameters in the utility objective functions of the NUM problem, we can also control the tradeoff between efficiency and fairness of radio resource allocation. We develop two distributed algorithms to solve the utility-optimal random-access control problem, which lead to random access protocols that have slightly more message passing overhead than the current exponential-backoff protocols, but significant potential for efficiency and fairness improvement. We provide readily-verifiable sufficient conditions under which convergence of the proposed algorithms to a global optimality of network utility can be guaranteed, and numerical experiments that illustrate the value of the NUM approach to the complexity-performance tradeoff in MAC design.
KW - Mathematical programming/optimization
KW - Medium access control (MAC)
KW - Network control by pricing
KW - Network utility maximization
KW - Wireless network
UR - http://www.scopus.com/inward/record.url?scp=34547408194&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=34547408194&partnerID=8YFLogxK
U2 - 10.1109/TWC.2007.05991
DO - 10.1109/TWC.2007.05991
M3 - Article
AN - SCOPUS:34547408194
SN - 1536-1276
VL - 6
SP - 2741
EP - 2750
JO - IEEE Transactions on Wireless Communications
JF - IEEE Transactions on Wireless Communications
IS - 7
ER -