Skip to main content

Minimizing Average Interference through Topology Control

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 7111))

Abstract

Reducing interference is one of the main challenges in wireless communication. To minimize interference through topology control in wireless sensor networks is a well-known open algorithmic problem. In this paper, we answer the question of how to minimize the average interference when a node is receiving a message. We assume the receiver-centric interference model where the interference on a node is equal to the number of the other nodes whose transmission ranges cover the node. For one-dimensional (1D) networks, we propose a fast polynomial exact algorithm that can minimize the average interference. For two-dimensional (2D) networks, we give a proof that the maximum interference can be bounded while minimizing the average interference. The bound is only related to the distances between nodes but not the network size. Based on the bound, we propose the first exact algorithm to compute the minimum average interference in 2D networks. Optimal topologies with the minimum average interference can be constructed through traceback in both 1D and 2D networks.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   69.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Gupta, P., Kumar, P.R.: The Capacity of Wireless Networks. IEEE Transactions on Information Theory 46(2), 388–404 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  2. Moscibroda, T., Wattenhofer, R., Weber, Y.: Protocol Design Beyond Graph-Based Models. In: Proc. of the 5th Workshop on Hot Topics in Networks, HotNets (2006)

    Google Scholar 

  3. Benkert, M., Gudmundsson, J., Haverkort, H., Wolff, A.: Constructing minimum-interference networks. Computational Geometry 40(3), 179–194 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  4. Burkhart, M., von Rickenbach, P., Wattenhofer, R., Zollinger, A.: Does Topology Control Reduce Interference? In: Proc. of the 5th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc), pp. 9–19 (2004)

    Google Scholar 

  5. Johansson, T., Carr-Motyčková, L.: Reducing Interference in Ad Hoc Networks Through Topology Control. In: Proc. of the 2nd ACM SIGACT/SIGMOBILE International Workshop on Foundations of Mobile Computing (DIALM-POMC), pp. 17–23 (2005)

    Google Scholar 

  6. Moaveni-Nejad, K., Li, X.-Y.: Low-interference topology control for wireless ad hoc networks. International Journal of Ad Hoc & Sensor Wireless Networks 1, 41–64 (2005)

    Google Scholar 

  7. Nguyen, T., Lam, N., Huynh, D., Bolla, J.: Minimum Edge Interference in Wireless Sensor Networks. In: Pandurangan, G., Anil Kumar, V.S., Ming, G., Liu, Y., Li, Y. (eds.) WASA 2010. LNCS, vol. 6221, pp. 57–67. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  8. Wu, K.-D., Liao, W.: On Constructing Low Interference Topology in Multihop Wireless Networks. International Journal of Sensor Networks 2, 321–330 (2007)

    Article  Google Scholar 

  9. von Rickenbach, P., Schmid, S., Wattenhofer, R., Zollinger, A.: A robust interference model for wireless ad hoc networks. In: Proc. of the 5th International Workshop on Algorithms for Wireless, Mobile, Ad Hoc and Sensor Networks, WMAN (2005)

    Google Scholar 

  10. von Rickenbach, P., Wattenhofer, R., Zollinger, A.: Algorithmic Models of Interference in Wireless Ad Hoc and Sensor Networks. IEEE/ACM Transation on Networking (TON) 17(1), 172–185 (2009)

    Article  Google Scholar 

  11. Tan, H., Lou, T., Lau, F.C.M., Wang, Y., Chen, S.: Minimizing Interference for the Highway Model in Wireless Ad-hoc and Sensor Networks. In: Černá, I., Gyimóthy, T., Hromkovič, J., Jefferey, K., Králović, R., Vukolić, M., Wolf, S. (eds.) SOFSEM 2011. LNCS, vol. 6543, pp. 520–532. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  12. Buchin, K.: Minimizing the Maximum Interference is Hard. arXiv: 0802.2134v1 (2008)

    Google Scholar 

  13. Halldórsson, M.M., Tokuyama, T.: Minimizing Interference of a Wireless Ad-Hoc Network in a Plane. In: Nikoletseas, S.E., Rolim, J.D.P. (eds.) ALGOSENSORS 2006. LNCS, vol. 4240, pp. 71–82. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  14. Moscibroda, T., Wattenhofer, R.: Minimizing interference in ad hoc and sensor networks. In: Proc. of the 2nd ACM SIGACT/SIGMOBILE International Workshop on Foundations of Mobile Computing (DIALM-POMC), pp. 24–33 (2005)

    Google Scholar 

  15. Yuan, H., Atallah, M.J.: Data Structures for Range Minimum Queries in Multidimensional Arrays. In: Proc. of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Thomas Erlebach Sotiris Nikoletseas Pekka Orponen

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lou, T., Tan, H., Wang, Y., Lau, F.C.M. (2012). Minimizing Average Interference through Topology Control. In: Erlebach, T., Nikoletseas, S., Orponen, P. (eds) Algorithms for Sensor Systems. ALGOSENSORS 2011. Lecture Notes in Computer Science, vol 7111. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28209-6_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-28209-6_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-28208-9

  • Online ISBN: 978-3-642-28209-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics