Abstract
The approach of using topology control to reduce interference in wireless sensor networks has attracted attention of many researchers. There are several definitions of interference in the literature. In a wireless sensor network, the interference at a node may be caused by an edge that is transmitting data, or it occurs because the node itself is within the transmission range of another. The interference load of an edge is the number of nodes that are in the disks defined by the end nodes of this edge with a radius which is either the Euclidean distance or the power level of the end nodes. In this paper we show that the problem of assigning power level to a set of nodes in the plane to yield a connected geometric graph whose edges have bounded interference is NP-complete under both edge interference definitions. We also study the performance of a number of heuristics through simulation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Benkert, M., Gudmundsson, J., Haverkort, H., Wolff, A.: Introduction to Algorithms. In: Wiedermann, J., Tel, G., Pokorný, J., Bieliková, M., Štuller, J. (eds.) SOFSEM 2006. LNCS, vol. 3831, pp. 166–176. Springer, Heidelberg (2006)
Bilò, D., Proietti, G.: On the Complexity of Minimizing Interference in Ad-Hoc and Sensor Networks. Theorectical Computer Science 402, 43–55 (2008)
Buchin, K.: Minimizing the Maximum Interference is Hard (2008), http://arxiv.org/abs/0802.2134
Burkhart, M., von Rickenbach, P., Wattenhofer, R., Zollinger, A.: Does Topology Control Reduce Interference? In: MOBIHOC 2004, pp. 9–19 (2004)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Constructing Interference-Minimal Networks. Section 23.2: The Algorithms of Kruskal and Prim, pp. 567–574. McGraw-Hill, New York (2001) ISBN 0-262-03293-7
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)
Johansson, T., Carr-Motyckovaá, L.: Reducing Interference in Ad Hoc Networks Through Topology Control. In: DIALM-POMC 2005, pp. 17–23 (2005)
Lichtenstein, D.: Planar Formulae And Their Uses. SIAM J. of Compt. 11(23) (1982)
Moaveni-Nejad, K., Li, X.-Y.: Low-Interference Topology Control for Wireless Ad Hoc Networks. Ad Hoc and Wireless Sensor Networks 1, 41–64 (2005)
Nguyen, T.N., Huynh, D.T.: Minimum Interference Planar Geometric Topology in Wireless Sensor Networks. In: Liu, B., Bestavros, A., Du, D.-Z., Wang, J. (eds.) WASA 2009. LNCS, vol. 5682, pp. 149–158. Springer, Heidelberg (2009)
Rickenbach, P.V., Schmid, S., Wattenhofer, R., Zollinger, A.: A Roburst Interference Model for Wireless Ad-Hoc Networks. In: Proc. 19th IEEE Int. Par. and Dist. (2005)
Sharma, A., Thakral, N., Udgata, S., Pujari, A.: Heuristics for Minimizing Interference in Sensor Networks. In: Garg, V., Wattenhofer, R., Kothapalli, K. (eds.) ICDCN 2009. LNCS, vol. 5408, pp. 49–54. Springer, Heidelberg (2009)
Valiant, L.: Universality Considerations in VLSI Circuits. IEEE Trans. on Compupters C-30, 135–140 (1981)
Wu, K.-D., Liao, W.: On Constructing Low Interference Topology in Multihop Wireless Networks. Int. J. of Sensor Networks 2, 321–330 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nguyen, T.N., Lam, N.X., Huynh, D.T., Bolla, J. (2010). Minimum Edge Interference in Wireless Sensor Networks. 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_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-14654-1_7
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)