Routing with guaranteed delivery in ad hoc wireless networks
Wireless Networks
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
A cone-based distributed topology-control algorithm for wireless multi-hop networks
IEEE/ACM Transactions on Networking (TON)
Minimizing interference in ad hoc and sensor networks
DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
Topology control in wireless ad hoc and sensor networks
ACM Computing Surveys (CSUR)
Spatial Node Distribution of the Random Waypoint Mobility Model with Applications
IEEE Transactions on Mobile Computing
Local approximation schemes for topology control
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Geometric Spanner Networks
Constructing minimum-interference networks
Computational Geometry: Theory and Applications
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
Computing Lightweight Spanners Locally
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
IEEE Transactions on Parallel and Distributed Systems
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
Proceedings of the 28th ACM symposium on Principles of distributed computing
Sensor networks continue to puzzle: selected open problems
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Connectivity problem in wireless networks
DISC'10 Proceedings of the 24th international conference on Distributed computing
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
Low-interference networks in metric spaces of bounded doubling dimension
Information Processing Letters
Minimizing interference in ad-hoc networks with bounded communication radius
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
| Hi-index | 0.00 |
Given a set of positions for wireless nodes, the interference minimization problem is to assign a transmission radius (equivalently, a power level) to each node such that the resulting communication graph is connected, while minimizing the maximum interference. We consider the model introduced by von Rickenbach et al. (2005), in which each transmission range is represented by a ball and edges in the communication graph are symmetric. The problem is NP-complete in two dimensions (Buchin 2008) and no polynomial-time approximation algorithm is known. In this paper we show how to solve the problem efficiently in settings typical for wireless ad hoc networks. We show that if node positions are represented by a set P of n points selected uniformly and independently at random over a d-dimensional rectangular region, for any fixed d, then the topology given by the closure of the Euclidean minimum spanning tree of P has maximum interference O(logn) with high probability. We extend this bound to a general class of communication graphs over a broad set of probability distributions. We present a local algorithm that constructs a graph from this class; this is the first local algorithm to provide an upper bound on the expected maximum interference. Finally, we analyze an empirical evaluation of our algorithm by simulation.