Brief Announcement: Distributed Algorithms for Maximum Link Scheduling in the Physical Interference Model
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.
KeywordsWireless Network Virginia Tech Interference Model IEEE INFOCOM Link Diversity
- 1.Goussevskaia, O., Oswald, Y.A., Wattenhofer, R.: Complexity in geometric sinr. In: ACM MobiHoc (2007)Google Scholar
- 2.Goussevskaia, O., Halldórsson, M., Wattenhofer, R., Welzl, E.: Capacity of arbitrary wireless networks. In: IEEE INFOCOM (2009)Google Scholar
- 4.Ásgeirsson, E., Mitra, P.: On a game theoretic approach to capacity maximization in wireless networks. In: IEEE INFOCOM (2011)Google Scholar
- 5.Pei, G., Kumar, V.S.A.: Distributed algorithms for maximum link scheduling under the physical interference model (2012), http://arxiv.org/abs/1208.0811