Minimizing Interference in Ad-Hoc Networks with Bounded Communication Radius
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.
Unable to display preview. Download preview PDF.
- 4.Buchin, K.: Minimizing the maximum interference is hard. CoRR, abs/0802.2134 (2008)Google Scholar
- 5.Clarkson, K.L.: Fast algorithms for the all nearest neighbors problem. In: Proceedings of the 24th Annual Symposium on Foundations of Computer Science, pp. 226–232. IEEE Computer Society, Washington, DC (1983)Google Scholar
- 6.Fussen, M., Wattenhofer, R., Zollinger, A.: Interference arises at the receiver. In: In Proceedings of Int. Conference on Wireless Networks, Communications, and Mobile Computing, WIRELESSCOM (2005)Google Scholar
- 8.Korman, M.: Minimizing interference in ad-hoc networks with bounded communication radius. CoRR, abs/1102.2785 (2011)Google Scholar