Efficient Algorithms for Maximum Link Scheduling in Distributed Computing Models With SINR Constraints

In this paper, the authors develop a set of fast distributed algorithms in the SINR model, providing constant approximation for the maximum link scheduling problem under uniform power assignment. They find that different aspects of available technology, such as full/half duplex communication, and non-adaptive/adaptive power control, have a significant impact on the performance of the algorithm; these issues have not been explored in the context of distributed algorithms in the SINR model before. The algorithms are randomized and crucially use physical carrier sensing in distributed communication steps.

Provided by: Virginia Systems Topic: Mobility Date Added: Nov 2012 Format: PDF

Find By Topic