Brief announcement: distributed algorithms for maximum link scheduling in the physical interference model

Authors:
Guanhong Pei;Anil Kumar S. Vullikanti
Affiliations:
Dept. of Electrical and Computer Engineering, and Virginia Bioinformatics Institute, Virginia Tech;Dept. of Computer Science, and Virginia Bioinformatics Institute, Virginia Tech
Venue:
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Year:
2012

Citing 3
Cited 1

Complexity in geometric SINR

Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Maximum Independent Set of Links under Physical Interference Model

WASA '09 Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications
Brief announcement: distributed algorithms for maximum link scheduling in the physical interference model

DISC'12 Proceedings of the 26th international conference on Distributed Computing

Brief announcement: distributed algorithms for maximum link scheduling in the physical interference model

DISC'12 Proceedings of the 26th international conference on Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We develop distributed algorithms for the maximum independent link set problem in wireless networks in a distributed computing model based on the physical interference model with SINR constraints -- this is more realistic and more challenging than the traditional graph-based models. Our results give the first distributed algorithm for this problem with polylogarithmic running time with a constant factor approximation guarantee, matching the sequential bound.