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
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)
| Hi-index | 0.89 |
We consider a topology control problem in which we are given a set of sensors in R^d and we would like to assign a communication radius to each of them so that they generate a connected network and have low receiver-based interference (defined as the largest in-degree of the network). We show that any radii assignment that generates a connected network can be modified so that interference is (asymptotically) unaffected and no sensor is assigned communication radius larger than R"m"i"n, where R"m"i"n is the smallest possible radius needed to obtain strong connectivity. Combining this result with the previous network construction methods (see Halldorsson and Tokuyama (2008) [7] and von Rickenbach et al. (2009) [11]), we obtain a way to construct a connected network of low interference and bounded radii. Since the radius of a sensor is only affected by neighboring sensors, this construction can be done in a distributed fashion.