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
Minimizing interference in ad hoc and sensor networks
DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
A unified energy-efficient topology for unicast and broadcast
Proceedings of the 11th annual international conference on Mobile computing and networking
Sensor networks continue to puzzle: selected open problems
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
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
Minimum edge interference in wireless sensor networks
WASA'10 Proceedings of the 5th international conference on Wireless algorithms, systems, and applications
Strong minimum energy minimum interference topology in wireless sensor networks
ICDCIT'12 Proceedings of the 8th international conference on Distributed Computing and Internet Technology
Bounding interference in wireless ad hoc networks with nodes in random position
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Hi-index | 0.00 |
Reducing interference is one of the main challenges in sensor networks and also in ad hoc networks. The amount of interference experienced by a node v corresponds to the number of nodes whose transmission range covers v. We study the problem of minimizing maximum interference for a given set of nodes in a sensor network. This requires finding a connected topology which minimizes the maximum interference for set of nodes. It is proved to be NP-hard by Buchin[5]. In this paper, we propose an algorithm named "Minimizing Interference in Sensor Network (MI-S)", to minimize the maximum interference for a set of nodes in polynomial time maintaining the connectivity of the graph. We also present a variation of this algorithm based on local search technique. We check the results by applying the standard approximation algorithms and study different cases in which they are applicable. Finally we analyze some typical instances as well as average case instances to verify the proposed algorithm.