Minimizing interference in ad-hoc networks with bounded communication radius

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

2011-02-14

arxiv.org/abs/1102.2785v4

Computer Science

Computational Geometry

Scientific paper

We consider a topology control problem in which we are given a set of $n$ sensors in the plane 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 (i.e., we minimize the largest in-degree of the network). We give an algorithm that generates a network with $O(\log \Delta)$ interference, where $\Delta$ is the interference of a uniform-radius ad-hoc network. We then adapt the construction to the case in which no sensor can have a communication radius larger than $R_{\min}$, the minimum value needed to obtain connectivity. We also show that $\log \Delta$ interference is needed for some instances, making our algorithms asymptotically optimal.

Affiliated with

Also associated with

No associations

Rating

Minimizing interference in ad-hoc networks with bounded communication radius does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Minimizing interference in ad-hoc networks with bounded communication radius, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Minimizing interference in ad-hoc networks with bounded communication radius will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-216225