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

Bo Gu, Cheng Zhang, Kyoko Yamori, Yoshiaki Tanaka

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    1 Citation (Scopus)

    Abstract

    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.

    Original languageEnglish
    Title of host publication2013 19th Asia-Pacific Conference on Communications, APCC 2013
    PublisherIEEE Computer Society
    Pages456-457
    Number of pages2
    ISBN (Print)9781467360500
    DOIs
    Publication statusPublished - 2013
    Event2013 19th Asia-Pacific Conference on Communications, APCC 2013 - Denpasar
    Duration: 2013 Aug 292013 Aug 31

    Other

    Other2013 19th Asia-Pacific Conference on Communications, APCC 2013
    CityDenpasar
    Period13/8/2913/8/31

      Fingerprint

    ASJC Scopus subject areas

    • Computer Networks and Communications

    Cite this

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