TY - GEN
T1 - An efficient heuristic approach to the infeasible downlink power control problem
AU - Takahashi, Noriyuki
AU - Yukawa, Masahiro
AU - Yamada, Isao
PY - 2006/12/1
Y1 - 2006/12/1
N2 - This paper proposes a novel heuristic approach to the infeasible power control problem [i.e., no power allocation can provide users with specified quality of service (QoS)] in wireless communication systems. In such infeasible cases, it has been in great demand to increase the number of accepted users (i.e., users provided with the specified QoS) by certain distributed algorithms, which require no communication among base stations (BSs). The number of accepted users is often suppressed by a small number of users in severe environments, hence removing such users obviously helps many other users be accepted. The proposed algorithm, which is fully distributed, detects and removes such users based on simple criteria including: (a) the QoS is below the necessary level, and (b) the BS is already transmitting with the maximum possible power to the user. Simulation results demonstrate that the proposed algorithm significantly increases the number of accepted users with low computational complexity.
AB - This paper proposes a novel heuristic approach to the infeasible power control problem [i.e., no power allocation can provide users with specified quality of service (QoS)] in wireless communication systems. In such infeasible cases, it has been in great demand to increase the number of accepted users (i.e., users provided with the specified QoS) by certain distributed algorithms, which require no communication among base stations (BSs). The number of accepted users is often suppressed by a small number of users in severe environments, hence removing such users obviously helps many other users be accepted. The proposed algorithm, which is fully distributed, detects and removes such users based on simple criteria including: (a) the QoS is below the necessary level, and (b) the BS is already transmitting with the maximum possible power to the user. Simulation results demonstrate that the proposed algorithm significantly increases the number of accepted users with low computational complexity.
UR - http://www.scopus.com/inward/record.url?scp=33947655269&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33947655269&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:33947655269
SN - 142440469X
SN - 9781424404698
T3 - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
SP - IV765-IV768
BT - 2006 IEEE International Conference on Acoustics, Speech, and Signal Processing - Proceedings
T2 - 2006 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 2006
Y2 - 14 May 2006 through 19 May 2006
ER -