An approach to voice admission control in multihop wireless networks

Admission-control schemes for voice traffic in circuit-switched multihop radio networks are studied. The problem formulation is based on the methodology of multiple-service, multiple-resource (MSMR) modeling, and only those admission-control policies that yield a coordinate convex state space are considered. This restriction, in conjunction with reasonable modeling assumptions, results in a product-form stationary distribution for the system state. A recursive procedure to accelerate the evaluation of a large number of different admission-control policies and a descent-search method to minimize the number of policies that must be evaluated in searching for the optimal one are developed. Numerical examples indicate that performance can be improved by administering admission control, but the improvement is typically small unless different revenues or costs are associated with the various call types