TY - GEN
T1 - Performance of distributed utility-based power control for wireless ad hoc networks
AU - Huang, Jianwei
AU - Berry, Randall A
AU - Honig, Michael L
PY - 2005/12/1
Y1 - 2005/12/1
N2 - We study the performance of a distributed and asynchronous power control scheme for a spread spectrum wireless ad hoc network. The users exchange prices that reflect their loss in utility due to interference. The prices are then used to determine optimal (utility maximizing) power levels for each user. We present simulation results illustrating the convergence of the algorithm, and the effect of limited information. With logarithmic utilities, the pricing algorithm exhibits rapid convergence to the unique optimal power allocation. We then study the effect of limiting the amount of information users can exchange. Results are presented, which show performance (average utility per user) assuming each transmitter can decode interference prices only from receivers within a specified radius. The performance is shown to degrade gracefully as the radius decreases. We also compare the performance of the pricing algorithm with a Request to Send/Clear to Send (RTS/CTS) protocol. Numerical results show that in a dense network the pricing algorithm can offer large improvements in total efficiency (i.e., when utility corresponds to information rate). The effect of coarse rate control on performance is also examined.
AB - We study the performance of a distributed and asynchronous power control scheme for a spread spectrum wireless ad hoc network. The users exchange prices that reflect their loss in utility due to interference. The prices are then used to determine optimal (utility maximizing) power levels for each user. We present simulation results illustrating the convergence of the algorithm, and the effect of limited information. With logarithmic utilities, the pricing algorithm exhibits rapid convergence to the unique optimal power allocation. We then study the effect of limiting the amount of information users can exchange. Results are presented, which show performance (average utility per user) assuming each transmitter can decode interference prices only from receivers within a specified radius. The performance is shown to degrade gracefully as the radius decreases. We also compare the performance of the pricing algorithm with a Request to Send/Clear to Send (RTS/CTS) protocol. Numerical results show that in a dense network the pricing algorithm can offer large improvements in total efficiency (i.e., when utility corresponds to information rate). The effect of coarse rate control on performance is also examined.
UR - http://www.scopus.com/inward/record.url?scp=33847342128&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33847342128&partnerID=8YFLogxK
U2 - 10.1109/MILCOM.2005.1606040
DO - 10.1109/MILCOM.2005.1606040
M3 - Conference contribution
AN - SCOPUS:33847342128
SN - 0780393937
SN - 9780780393936
T3 - Proceedings - IEEE Military Communications Conference MILCOM
BT - MILCOM 2005
T2 - MILCOM 2005: Military Communications Conference 2005
Y2 - 17 October 2005 through 20 October 2005
ER -