Low-interference networks in metric spaces of bounded doubling dimension

Authors:
Anil Maheshwari;Michiel Smid;Norbert Zeh
Affiliations:
School of Computer Science, Carleton University, Ottawa, Canada;School of Computer Science, Carleton University, Ottawa, Canada;Faculty of Computer Science, Dalhousie University, Halifax, Canada
Venue:
Information Processing Letters
Year:
2011

Citing 6
Cited 1

A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields

Journal of the ACM (JACM)
An optimal algorithm for approximate nearest neighbor searching fixed dimensions

Journal of the ACM (JACM)
Fast Construction of Nets in Low-Dimensional Metrics and Their Applications

SIAM Journal on Computing
Sparse geometric graphs with small dilation

Computational Geometry: Theory and Applications
Minimizing interference of a wireless ad-hoc network in a plane

Theoretical Computer Science
The Weak Gap Property in Metric Spaces of Bounded Doubling Dimension

Efficient Algorithms

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

Quantified Score

Hi-index	0.89

Visualization

Abstract

Let S be a set of n points in a metric space, let R={R"p:p@?S} be a set of positive real numbers, and let G"R be the undirected graph with vertex set S in which {p,q} is an edge if and only if |pq|==1 is a constant, there always exists a set R such that G"R is connected and each point has interference o(n^2).