TY - GEN

T1 - Minimizing interference in ad-hoc networks with bounded communication radius

AU - Korman, Cozzetti Matias

PY - 2011/12/26

Y1 - 2011/12/26

N2 - 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 R min to a sensor, where R min 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.

AB - 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 R min to a sensor, where R min 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.

UR - http://www.scopus.com/inward/record.url?scp=84055193970&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84055193970&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-25591-5_10

DO - 10.1007/978-3-642-25591-5_10

M3 - Conference contribution

AN - SCOPUS:84055193970

SN - 9783642255908

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 80

EP - 89

BT - Algorithms and Computation - 22nd International Symposium, ISAAC 2011, Proceedings

T2 - 22nd International Symposium on Algorithms and Computation, ISAAC 2011

Y2 - 5 December 2011 through 8 December 2011

ER -