Research Article
Minimum Total Node Interference in Wireless Sensor Networks
@INPROCEEDINGS{10.1007/978-3-642-17994-5_35, author={Nhat Lam and Trac Nguyen and D. Huynh}, title={Minimum Total Node Interference in Wireless Sensor Networks}, proceedings={Ad Hoc Networks. Second International Conference, ADHOCNETS 2010, Victoria, BC, Canada, August 18-20, 2010, Revised Selected Papers}, proceedings_a={ADHOCNETS}, year={2012}, month={5}, keywords={wireless sensor networks interference NP-completeness geometric graphs}, doi={10.1007/978-3-642-17994-5_35} }- Nhat Lam
Trac Nguyen
D. Huynh
Year: 2012
Minimum Total Node Interference in Wireless Sensor Networks
ADHOCNETS
Springer
DOI: 10.1007/978-3-642-17994-5_35
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 [16], or it occurs because the node itself is within the transmission range of another [2], [4], [7]. The interference load of a node is either the number of nodes in the broadcasting disk defined by this node or the number of nodes whose disks cover it [2], [4], [7]. 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 total node interference is bounded is NP-complete under both definitions. We also introduce some heuristics as well as a simplified version of an () approximation algorithm in [10] and study their performance through simulation.
