Does topology control reduce interference?
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
A Robust Interference Model for Wireless Ad-Hoc Networks
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13
Reducing interference in ad hoc networks through topology control
DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
On constructing low interference topology in multihop wireless sensor networks
International Journal of Sensor Networks
On the complexity of minimizing interference in ad-hoc and sensor networks
Theoretical Computer Science
Heuristics for Minimizing Interference in Sensor Networks
ICDCN '09 Proceedings of the 10th International Conference on Distributed Computing and Networking
Minimum Interference Planar Geometric Topology in Wireless Sensor Networks
WASA '09 Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications
Constructing interference-minimal networks
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Minimizing interference of a wireless ad-hoc network in a plane
ALGOSENSORS'06 Proceedings of the Second international conference on Algorithmic Aspects of Wireless Sensor Networks
Exact algorithms to minimize interference in wireless sensor networks
Theoretical Computer Science
Minimizing average interference through topology control
ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
| Hi-index | 0.01 |
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.