TY - GEN
T1 - Balancing supply and demand of bandwidth in wireless cellular networks
T2 - IEEE INFOCOM 2004 - Conference on Computer Communications - Twenty-Third Annual Joint Conference of the IEEE Computer and Communications Societies
AU - Chiang, Mung
AU - Bell, Jason
PY - 2004
Y1 - 2004
N2 - In wireless cellular networks and wireless local area networks nonlinear network utility maximization need to be conducted over both user rates and transmit powers. For each of the three cases considered in this paper, we present an algorithm that converges to the jointly optimal pair of rate vector and power vector. For the simple case when data rates are not limited by interferences, for example in single-cell downlink transmissions. Algorithm 1 we propose is an iterative bidding mechanism between the base station and mobile users, where knowledge about channel conditions and individual user utility functions is only needed locally at each user but not needed at the base station. In the case when data rates are limited by interferences, the utility maximization problem is complicated both by nonlinear coupling between powers and rates, and by interference among powers. Through centralized iterative steps. Algorithm 2 we propose converges to a joint and global optimum over the solution space of rates and powers. We then consider end-to-end transmissions in cellular networks, which traverse both wireless fading channels and many hops of wired links shared by other traffic. There is a tradeoff between attaining air-interface capacity in the wireless hop and controlling congestion in the wired backbone wide area network. We formulate this end-to-end resource allocation problem in such hybrid networks, and present a solution to obtain the Pareto optimal tradeoff between attaining wireless multi-access fading channel capacity and maximizing global network utility.
AB - In wireless cellular networks and wireless local area networks nonlinear network utility maximization need to be conducted over both user rates and transmit powers. For each of the three cases considered in this paper, we present an algorithm that converges to the jointly optimal pair of rate vector and power vector. For the simple case when data rates are not limited by interferences, for example in single-cell downlink transmissions. Algorithm 1 we propose is an iterative bidding mechanism between the base station and mobile users, where knowledge about channel conditions and individual user utility functions is only needed locally at each user but not needed at the base station. In the case when data rates are limited by interferences, the utility maximization problem is complicated both by nonlinear coupling between powers and rates, and by interference among powers. Through centralized iterative steps. Algorithm 2 we propose converges to a joint and global optimum over the solution space of rates and powers. We then consider end-to-end transmissions in cellular networks, which traverse both wireless fading channels and many hops of wired links shared by other traffic. There is a tradeoff between attaining air-interface capacity in the wireless hop and controlling congestion in the wired backbone wide area network. We formulate this end-to-end resource allocation problem in such hybrid networks, and present a solution to obtain the Pareto optimal tradeoff between attaining wireless multi-access fading channel capacity and maximizing global network utility.
KW - Convex optimization
KW - Lagrange duality
KW - Power control
KW - Rate allocation
KW - Transport Control Protocol
KW - Utility maximization
KW - Wireless cellular networks
KW - Wireless local area networks
UR - http://www.scopus.com/inward/record.url?scp=8344225225&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=8344225225&partnerID=8YFLogxK
U2 - 10.1109/INFCOM.2004.1354697
DO - 10.1109/INFCOM.2004.1354697
M3 - Conference contribution
AN - SCOPUS:8344225225
SN - 0780383559
T3 - Proceedings - IEEE INFOCOM
SP - 2800
EP - 2811
BT - IEEE INFOCOM 2004 - Conference on Computer Communications - Twenty-Third Annual Joint Conference of the IEEE Computer and Communications Societies
Y2 - 7 March 2004 through 11 March 2004
ER -