A General Approximation Technique for Constrained Forest Problems
SIAM Journal on Computing
A nearly best-possible approximation algorithm for node-weighted Steiner trees
Journal of Algorithms
A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
On the hardness of approximating minimization problems
Journal of the ACM (JACM)
Routing with guaranteed delivery in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
Analysis of a cone-based distributed topology control algorithm for wireless multi-hop networks
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
On local algorithms for topology control and routing in ad hoc networks
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
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
Topology control meets SINR: the scheduling complexity of arbitrary topologies
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Distributed construction of bounded-degree low-interference spanners of low weight
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Minimizing interference of a wireless ad-hoc network in a plane
Theoretical Computer Science
On the complexity of minimizing interference in ad-hoc and sensor networks
Theoretical Computer Science
Ad hoc networks beyond unit disk graphs
Wireless Networks
Algorithmic models of interference in wireless ad hoc and sensor networks
IEEE/ACM Transactions on Networking (TON)
Heuristics for Minimizing Interference in Sensor Networks
ICDCN '09 Proceedings of the 10th International Conference on Distributed Computing and Networking
Topology control and geographic routing in realistic wireless networks
ADHOC-NOW'07 Proceedings of the 6th international conference on Ad-hoc, mobile and wireless networks
Sensor networks continue to puzzle: selected open problems
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Algorithms for sensor and ad hoc networks: advanced lectures
Algorithms for sensor and ad hoc networks: advanced lectures
IEA/AIE'10 Proceedings of the 23rd international conference on Industrial engineering and other applications of applied intelligent systems - Volume Part III
Minimizing interference for the highway model in wireless ad-hoc and sensor networks
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
A topology control algorithm for interference and energy efficiency in wireless sensor networks
ADHOC-NOW'11 Proceedings of the 10th international conference on Ad-hoc, mobile, and wireless networks
Exact algorithms to minimize interference in wireless sensor networks
Theoretical Computer Science
On the complexity of minimizing interference in ad-hoc and sensor networks
ALGOSENSORS'06 Proceedings of the Second international conference on Algorithmic Aspects of Wireless Sensor Networks
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
Energy-Efficient broadcast scheduling for speed-controlled transmission channels
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Maximum interference of random sensors on a line
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
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
Strong minimum energy minimum interference topology in wireless sensor networks
ICDCIT'12 Proceedings of the 8th international conference on Distributed Computing and Internet Technology
Strong minimum interference topology for wireless sensor networks
ADCONS'11 Proceedings of the 2011 international conference on Advanced Computing, Networking and Security
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
Minimum interference strong bidirectional topology for wireless sensor networks
International Journal of Ad Hoc and Ubiquitous Computing
Hi-index | 0.00 |
Reducing interference is one of the main challenges in wireless communication, and particularly in ad hoc networks. The amount of interference experienced by a node v corresponds to the number of other nodes whose transmission range covers v. At the cost of communication links being dropped, interference can be reduced by decreasing the node's transmission power. In this paper, we study the problem of minimizing the average interference while still maintaining desired network properties, such as connectivity, point-to-point connections, or multicast trees. In particular, we present a greedy algorithm that computes an O(log n) approximation to the interference problem with connectivity requirement, where n is the number of nodes in the network. We then show the algorithm to be asymptotically optimal by proving a corresponding Ω(log n) lower bound that holds even in a more restricted interference model. Finally, we show how the algorithm can be generalized towards solving the interference problem for network properties that can be formulated as a 0-1 proper function.