Routing in communications networks
A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
Power consumption in packet radio networks
Theoretical Computer Science
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
Constructing minimum-energy broadcast trees in wireless ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Energy, congestion and dilation in radio networks
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Symmetric Connectivity with Minimum Power Consumption in Radio Networks
TCS '02 Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science: Foundations of Information Technology in the Era of Networking and Mobile 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
Minimizing interference in ad hoc and sensor networks
DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
Energy-Efficient Wireless Network Design
Theory of Computing Systems
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 Interference Planar Geometric Topology in Wireless Sensor Networks
WASA '09 Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications
Minimum edge interference in wireless sensor networks
WASA'10 Proceedings of the 5th international conference on Wireless algorithms, systems, and applications
Maximum interference of random sensors on a line
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
Strong minimum energy minimum interference topology in wireless sensor networks
ICDCIT'12 Proceedings of the 8th international conference on Distributed Computing and Internet Technology
Minimizing interference in ad-hoc networks with bounded communication radius
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Strong minimum interference topology for wireless sensor networks
ADCONS'11 Proceedings of the 2011 international conference on Advanced Computing, Networking and Security
Minimizing interference in ad hoc networks with bounded communication radius
Information Processing Letters
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 | 5.23 |
One of the most critical factors for lifetime and operability of ad-hoc and sensor networks is the limited amount of available energy. To this respect, minimizing the interference in the network (i.e., the overlapping of signals at network nodes) has certainly a positive effect, because it induces a reduction of the number of conflicting transmissions, and then results in an overall saving of energy consumption. Along this direction, in this paper we study the computational hardness of several interference minimization problems which arise while supporting some classic network communication patterns such as broadcasting (one-to-all), gossiping (all-to-all), and symmetric gossiping (symmetric all-to-all). In particular, concerning the non-approximability results, we prove that for any of the above communication patterns, the prominent problem of minimizing the maximum interference experienced by any node in the network is hard to approximate within better than a logarithmic factor, unless NP admits slightly superpolynomial time algorithms. On a positive side, we show that any approximation algorithm for the problem of minimizing the total transmission power assigned to the nodes in order to guarantee any of the above communication patterns, can be transformed, by maintaining the same performance ratio, into an approximation algorithm for the problem of minimizing the total interference experienced by all the nodes in the network.