Skip to main content

Maximum Independent Set of Links with a Monotone and Sublinear Power Assignment

  • Conference paper
Wireless Algorithms, Systems, and Applications (WASA 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7992))

Abstract

This paper studies the problem of selecting a maximum independent set of links with a fixed monotone and sublinear power assignment under the physical interference model. The best-known approximation bound for this problem is a very large constant. In this paper, we present an approximation algorithm for this problem, which not only has a much smaller approximation bound but also produces an independent set of links with a stronger property, i.e., strong independence.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Andrews, M., Dinitz, M.: Maximizing Capacity in Arbitrary Wireless Networks in the SINR Model: Complexity and Game Theory. In: IEEE INFOCOM (2009)

    Google Scholar 

  2. Chafekar, D., Kumar, V., Marathe, M., Parthasarathy, S., Srinivasan, A.: Approximation algorithms for computing capacity of wireless networks with SINR constraints. In: IEEE INFOCOM, pp. 1166–1174 (2008)

    Google Scholar 

  3. Goussevskaia, O., Oswald, Y.A., Wattenhofer, R.: Complexity in geometric SINR. In: Proc. of the 8th ACM MOBIHOC, pp. 100–109 (September 2007)

    Google Scholar 

  4. Halldórsson, M.M., Mitra, P.: Wireless capacity with oblivious power in general metrics. In: SIAM SODA, pp. 1538–1548 (2011)

    Google Scholar 

  5. Kesselheim, T.: A Constant-Factor Approximation for Wireless Capacity Maximization with Power Control in the SINR Model. In: SIAM SODA, pp. 1549–1559 (2011)

    Google Scholar 

  6. Wan, P.-J., Jia, X., Yao, F.: Maximum Independent Set of Links under Physical Interference Model. In: Liu, B., Bestavros, A., Du, D.-Z., Wang, J. (eds.) WASA 2009. LNCS, vol. 5682, pp. 169–178. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  7. Wan, P.-J., Ma, C., Tang, S., Xu, B.: Maximizing Capacity with Power Control under Physical Interference Model in Simplex Mode. In: Cheng, Y., Do Eun, Y., Qin, Z., Song, M., Xing, K. (eds.) WASA 2011. LNCS, vol. 6843, pp. 84–95. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ma, C., Al-dhelaan, F., Wan, PJ. (2013). Maximum Independent Set of Links with a Monotone and Sublinear Power Assignment. In: Ren, K., Liu, X., Liang, W., Xu, M., Jia, X., Xing, K. (eds) Wireless Algorithms, Systems, and Applications. WASA 2013. Lecture Notes in Computer Science, vol 7992. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39701-1_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-39701-1_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-39700-4

  • Online ISBN: 978-3-642-39701-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics