Skip to main content

Interference Minimization in Asymmetric Sensor Networks

  • Conference paper
  • First Online:
Algorithms for Sensor Systems (ALGOSENSORS 2014)

Abstract

A fundamental problem in wireless sensor networks is to connect a given set of sensors while minimizing the receiver interference. This is modeled as follows: each sensor node corresponds to a point in \({\mathbb R}^d\) and each transmission range corresponds to a ball. The receiver interference of a sensor node is defined as the number of transmission ranges it lies in. Our goal is to choose transmission radii that minimize the maximum interference while maintaining a strongly connected asymmetric communication graph.

For the two-dimensional case, we show that it is NP-complete to decide whether one can achieve a receiver interference of at most \(5\). In the one-dimensional case, we prove that there are optimal solutions with nontrivial structural properties. These properties can be exploited to obtain an exact algorithm that runs in quasi-polynomial time. This generalizes a result by Tan et al. to the asymmetric case.

KB supported in part by the Netherlands Organisation for Scientific Research (NWO) under project no. 612.001.207. WM supported in part by DFG Grants MU 3501/1 and MU 3502/2.

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 34.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 44.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

References

  1. Bilò, D., Proietti, G.: On the complexity of minimizing interference in ad-hoc and sensor networks. Theor. Comput. Sci. 402(1), 43–55 (2008)

    Article  MATH  Google Scholar 

  2. Buchin, K.: Minimizing the maximum interference is hard (2008). arXiv:0802.2134

  3. Burkhart, M., von Rickenbach, P., Wattenhofer, R., Zollinger, A.: Does topology control reduce interference? In: Proceedings of the 5th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc), pp. 9–19 (2004)

    Google Scholar 

  4. Fussen, M., Wattenhofer, R., Zollinger, A.: On interference reduction in sensor networks. Technical report 453, ETH Zürich, Department of Computer Science (2004)

    Google Scholar 

  5. Halldórsson, M.M., Tokuyama, T.: Minimizing interference of a wireless ad-hoc network in a plane. Theor. Comput. Sci. 402(1), 29–42 (2008)

    Article  MATH  Google Scholar 

  6. Johansson, T., Carr-Motyčková, L.: Reducing interference in ad hoc networks through topology control. In: Proceedings of the 2005 Joint Workshop on Foundations of Mobile Computing (DIALM-POMC), pp. 17–23 (2005)

    Google Scholar 

  7. Korman, M.: Minimizing interference in ad hoc networks with bounded communication radius. Inf. Process. Lett. 112(19), 748–752 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  8. Meyer auf der Heide, F., Schindelhauer, C., Volbert, K., Grünewald, M.: Congestion, dilation, and energy in radio networks. Theory Comput. Syst. 37(3), 343–370 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  9. Moscibroda, T., Wattenhofer, R.: Minimizing interference in ad hoc and sensor networks. In: Proceedings of the 2005 Joint Workshop on Foundations of Mobile Computing (DIALM-POMC), pp. 24–33 (2005)

    Google Scholar 

  10. Papadimitriou, C.H., Vazirani, U.V.: On two geometric problems related to the traveling salesman problem. J. Algorithms 5(2), 231–246 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  11. von Rickenbach, P., Schmid, S., Wattenhofer, R., Zollinger, A.: A robust interference model for wireless ad-hoc networks. In: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS), p. 239 (2005)

    Google Scholar 

  12. von Rickenbach, P., Wattenhofer, R., Zollinger, A.: Algorithmic models of interference in wireless ad hoc and sensor networks. IEEE/ACM Trans. Netw. 17(1), 172–185 (2009)

    Article  Google Scholar 

  13. Tan, H., Lou, T., Wang, Y., Hua, Q.-S., Lau, F.: Exact algorithms to minimize interference in wireless sensor networks. Theor. Comput. Sci. 412(50), 6913–6925 (2011)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgments

We would like to thank Maike Buchin, Tobias Christ, Martin Jaggi, Matias Korman, Marek Sulovský, and Kevin Verbeek for fruitful discussions.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Wolfgang Mulzer .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Brise, Y., Buchin, K., Eversmann, D., Hoffmann, M., Mulzer, W. (2015). Interference Minimization in Asymmetric Sensor Networks. In: Gao, J., Efrat, A., Fekete, S., Zhang, Y. (eds) Algorithms for Sensor Systems. ALGOSENSORS 2014. Lecture Notes in Computer Science(), vol 8847. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-46018-4_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-46018-4_9

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-46017-7

  • Online ISBN: 978-3-662-46018-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics