Coordinating Concurrent Transmissions: A Constant-Factor Approximation of Maximum-Weight Independent Set in Local Conflict Graphs
We study the algorithmic problem of coordinating transmissions in a wireless network where radio interference constrains concurrent transmissions on wireless links. We focus on pairwise conflicts between the links; these can be described as a conflict graph. Associated with the conflict graph are two fundamental network coordination tasks: (a) finding a nonconflicting set of links with the maximum total weight, and (b) finding a link schedule with the minimum total length. Our work shows that two assumptions on the geometric structure of conflict graphs suffice to achieve polynomial-time constant-factor approximations: (i) bounded density of devices, and (ii) bounded range of interference. We also show that these assumptions are not sufficient to obtain a polynomial-time approximation scheme for either coordination task.
KeywordsGeometric graphs maximum-weight independent set radio interference
Unable to display preview. Download preview PDF.
- 3.Young, N.E.: Sequential and parallel algorithms for mixed packing and covering. In: Proc. 42nd Annual Symposium on Foundations of Computer Science FOCS, Las Vegas, NV, USA, October 2001, pp. 538–546. IEEE Computer Society Press, Los Alamitos (2001)Google Scholar
- 5.Khot, S.: Improved inapproximability results for MaxClique, chromatic number and approximate graph coloring. In: Proc. 42nd Annual Symposium on Foundations of Computer Science FOCS, Las Vegas, NV, USA, October 2001, pp. 600–609. IEEE Computer Society Press, Los Alamitos (2001)Google Scholar
- 7.Goldsmith, A.: Wireless Communications. Cambridge University Press, Cambridge, UK (2005)Google Scholar
- 8.Krishnamachari, B.: Networking Wireless Sensors. Cambridge University Press, Cambridge, UK (2005)Google Scholar
- 10.Doyle, P.G., Snell, J.L.: Random Walks and Electric Networks. The Mathematical Association of America, Washington, DC, USA (1984)Google Scholar