Design and Performance of Distributed Mechanisms for Flow Admission in Wireless Adhoc Networks

Given a wireless network where some pairs of communication links interfere with each other, the authors study sufficient conditions for determining whether a given set of minimum bandwidth Quality-of-Service (QoS) requirements can be satisfied. They are especially interested in algorithms which have low communication overhead and low processing complexity. The interference in the network is modeled using a conflict graph whose vertices correspond to the communication links in the network. Two links are adjacent in this graph if and only if they interfere with each other due to being in the same vicinity and hence cannot be simultaneously active.

Provided by: University of Wisconsin Topic: Mobility Date Added: Nov 2011 Format: PDF

Download Now

Find By Topic