Skip to main content

Maximum Weighted Independent Set of Links under Physical Interference Model

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

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

Abstract

Interference-aware scheduling for wireless communications is crucial to improve the network throughput. In this paper, we study the problem of Maximum Weighted Independent Set of Links (MWISL) under the physical interference model in wireless networks. Given a set of communication links distributed in a two-dimensional Euclidean plane, assume each link is associated with a positive weight which represents the benefit of transmitting along the link, the objective is to seek an independent set of links subject to the physical interference constraints with maximum weighted sum. To the best of our knowledge, no algorithm for MWISL under physical interference model has been proposed. We focus on MWISL in the oblivious power assignment setting.

This work was supported in part by NSF of USA under grant CNS-0831831.

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. Brar, G., Blough, D., Santi, P.: Computationally efficient scheduling with the physical interference model for throughput improvement in wireless mesh networks. In: ACM MobiCom (2006)

    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. Cruz, R., Santhanam, A.: Optimal routing, link scheduling and power control in multihop wireless networks. In: IEEE INFOCOM, vol. 1 (2003)

    Google Scholar 

  4. ElBatt, T., Ephremides, A.: Joint scheduling and power control for wireless ad hoc networks. IEEE Transactions on Wireless Communications 1, 74–85 (2004)

    Article  Google Scholar 

  5. Sharma, G., Joo, C., Shroff, N.: Distributed scheduling schemes for throughput guarantees in wireless networks. In: Allerton 2006 (2006)

    Google Scholar 

  6. Goussevskaia, O., Oswald, Y., Wattenhofer, R.: Complexity in geometric SINR. In: Proceedings of ACM MobiHoc, pp. 100–109 (2007)

    Google Scholar 

  7. Goussevskaia, O., Wattenhofer, R., Halldórsson, M.M., Welzl, E.: Capacity of Arbitrary Wireless Networks. In: IEEE INFOCOM 2009 (2009)

    Google Scholar 

  8. Halldórsson, M.: Wireless scheduling with power control. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol. 5757, pp. 361–372. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  9. Halldorsson, M., Wattenhofer, R.: Wireless Communication is in APX. In: Automata, Languages and Programming, pp. 525–536

    Google Scholar 

  10. Joo, C., Shroff, N.: Performance of random access scheduling schemes in multi-hop wireless networks. In: IEEE INFOCOM (2007)

    Google Scholar 

  11. Lin, X., Rasool, S.: Constant-time distributed scheduling policies for ad hoc wireless networks. In: IEEE CDC (2006)

    Google Scholar 

  12. Moscibroda, T., Wattenhofer, R.: The Complexity of Connectivity in Wireless Networks. In: IEEE INFOCOM (2006)

    Google Scholar 

  13. Penttinen, A., Koutsopoulos, I., Tassiulas, L.: Low-complexity distributed fair scheduling for wireless multi-hop networks. In: WiOPT 2005: First Workshop on Resource Allocation in Wireless Networks, RAWNET (2005)

    Google Scholar 

  14. Sanghavi, S., Bui, L., Srikant, R.: Distributed link scheduling with constant overhead. In: ACM SIGMETRICS, pp. 313–324. ACM Press, New York (2007)

    Google Scholar 

  15. Wan, P., 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)

    Google Scholar 

  16. Xu, X., Tang, S.: A constant approximation algorithm for link scheduling in arbitrary networks under physical interference model. In: Proceedings of the 2nd ACM International Workshop on Foundations of Wireless Ad Hoc and Sensor Networking and Computing, pp. 13–20. ACM, New York (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Xu, X., Tang, S., Wan, PJ. (2010). Maximum Weighted Independent Set of Links under Physical Interference Model. In: Pandurangan, G., Anil Kumar, V.S., Ming, G., Liu, Y., Li, Y. (eds) Wireless Algorithms, Systems, and Applications. WASA 2010. Lecture Notes in Computer Science, vol 6221. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14654-1_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-14654-1_8

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics