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
On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
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
Minimizing interference of a wireless ad-hoc network in a plane
Theoretical Computer Science
Hi-index | 0.00 |
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 has certainly a positive effect, since of the reduced number of conflicting transmissions. However, quite surprisingly, only few theoretical results are known about the possibility to maintain the interference low while at the same time guaranteeing certain network connectivity properties. In this paper, we give a contribution in this direction, and we study several network interference measures with respect to the symmetric connectivity, the strong connectivity, and the broadcast connectivity predicate. In particular, we show that the probably most prominent interference problem, namely that 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, for any of the above connectivity predicates. On a positive side, we show that any approximation algorithm for the problem of minimizing the total range assigned to the nodes in order to guarantee any of the above connectivity predicates, can be transformed, by maintaining the approximation ratio, into an approximation algorithm for the problem of minimizing the total interference experienced by all the nodes in the network.