Distributed Algorithms for QoS in Wireless Ad Hoc Networks Under the Primary Interference Model

Consider a wireless network consisting of a set of wireless nodes and a set of communication links, where each communication link corresponds to a pair of nodes that are within communication radius of each other. Under the primary interference model, two communication links cannot be active at the same time if they are incident to a common node. This model of interference arises in Bluetooth networks, where transmissions between a master node and slave nodes in a piconet are scheduled by time-division duplexing, and in CDMA systems when each node is equipped with a single transceiver. Each communication link has a certain minimum bandwidth quality-of-service requirement. The admission control problem is to determine whether the network has sufficient resources to satisfy the bandwidth requirements. In this work, distributed algorithms are proposed for this admission control problem, and performance guarantees of these distributed algorithms are given. If each node has knowledge of a certain global parameter, then a distributed algorithm for flow admission control is given which has the same performance as an optimal, centralized algorithm, i.e. the distributed algorithm gives a condition that is both necessary and sufficient for a set of flow rates to be feasible.