A greedy algorithm for connection admission control in wireless random access networks

Bo Gu, Cheng Zhang, Kyoko Yamori, Yoshiaki Tanaka

研究成果: Conference contribution

1 引用 (Scopus)

抜粋

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.

元の言語English
ホスト出版物のタイトル2013 19th Asia-Pacific Conference on Communications, APCC 2013
出版者IEEE Computer Society
ページ456-457
ページ数2
ISBN(印刷物)9781467360500
DOI
出版物ステータスPublished - 2013 1 1
イベント2013 19th Asia-Pacific Conference on Communications, APCC 2013 - Denpasar, Indonesia
継続期間: 2013 8 292013 8 31

出版物シリーズ

名前2013 19th Asia-Pacific Conference on Communications, APCC 2013

Conference

Conference2013 19th Asia-Pacific Conference on Communications, APCC 2013
Indonesia
Denpasar
期間13/8/2913/8/31

    フィンガープリント

ASJC Scopus subject areas

  • Computer Networks and Communications

これを引用

Gu, B., Zhang, C., Yamori, K., & Tanaka, Y. (2013). A greedy algorithm for connection admission control in wireless random access networks. : 2013 19th Asia-Pacific Conference on Communications, APCC 2013 (pp. 456-457). [6765989] (2013 19th Asia-Pacific Conference on Communications, APCC 2013). IEEE Computer Society. https://doi.org/10.1109/APCC.2013.6765989