An O(n log n) algorithm for the all-nearest-neighbors problem
Discrete & Computational Geometry
Euclidean minimum spanning trees and bichromatic closest pairs
Discrete & Computational Geometry
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Topology control in wireless ad hoc and sensor networks
ACM Computing Surveys (CSUR)
Constructing minimum-interference networks
Computational Geometry: Theory and Applications
Fast algorithms for the all nearest neighbors problem
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
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
Algorithmic models of interference in wireless ad hoc and sensor networks
IEEE/ACM Transactions on Networking (TON)
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
Do directional antennas facilitate in reducing interferences?
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
| Hi-index | 0.00 |
We consider a topology control problem in which we are given a set of n sensors in ℝd and we would like to assign a communication radius to each of them. The radii assignment must generate a strongly connected network and have low receiver-based interference (defined as the largest in-degree of the network). We give an algorithm that generates a network with O(logΔ) interference, where Δ is the interference of a uniform-radius network. Since the radius of each sensor only depends on its neighbors, it can be computed in a distributed fashion. Moreover, this construction will never assign communication radius larger than Rmin to a sensor, where Rmin is the minimum value needed to obtain strong connectivity. We also show that Ω(logn) interference is needed for some instances, making our algorithms asymptotically optimal.