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

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.