TY - GEN
T1 - A greedy algorithm for connection admission control in wireless random access networks
AU - Gu, Bo
AU - Zhang, Cheng
AU - Yamori, Kyoko
AU - Tanaka, Yoshiaki
PY - 2013/1/1
Y1 - 2013/1/1
N2 - In this paper, we consider a price-based connection admission control (CAC) for wireless random access networks. In particular, a network operator determines sequential prices to dynamically maintain the traffic admitted into the network below the channel capacity. The CAC tries to ensure quality of service (QoS) guarantees to users and hence maximize the overall revenue. We find that the revenue maximization problem over all sequential prices is NP-hard. Therefore, a greedy algorithm is employed for obtaining a simple, easy-to-implement solution.
AB - In this paper, we consider a price-based connection admission control (CAC) for wireless random access networks. In particular, a network operator determines sequential prices to dynamically maintain the traffic admitted into the network below the channel capacity. The CAC tries to ensure quality of service (QoS) guarantees to users and hence maximize the overall revenue. We find that the revenue maximization problem over all sequential prices is NP-hard. Therefore, a greedy algorithm is employed for obtaining a simple, easy-to-implement solution.
UR - http://www.scopus.com/inward/record.url?scp=84902302899&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84902302899&partnerID=8YFLogxK
U2 - 10.1109/APCC.2013.6765989
DO - 10.1109/APCC.2013.6765989
M3 - Conference contribution
AN - SCOPUS:84902302899
SN - 9781467360500
T3 - 2013 19th Asia-Pacific Conference on Communications, APCC 2013
SP - 456
EP - 457
BT - 2013 19th Asia-Pacific Conference on Communications, APCC 2013
PB - IEEE Computer Society
T2 - 2013 19th Asia-Pacific Conference on Communications, APCC 2013
Y2 - 29 August 2013 through 31 August 2013
ER -