Minimizing Interference in Ad-Hoc Networks with Bounded Communication Radius

  • Matias Korman
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7074)

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Agarwal, P., Edelsbrunner, H., Schwarzkopf, O., Welzl, E.: Euclidean minimum spanning trees and bichromatic closest pairs. Discrete Comput. Geom. 6, 407–422 (1991)MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    Benkert, M., Gudmundsson, J., Haverkort, H., Wolff, A.: Constructing minimum-interference networks. Comput. Geom. Theory Appl. 40(3), 179–194 (2008)MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    Bilò, D., Proietti, G.: On the complexity of minimizing interference in ad-hoc and sensor networks. Theor. Comput. Sci. 402(1), 43–55 (2008)MathSciNetCrossRefMATHGoogle Scholar
  4. 4.
    Buchin, K.: Minimizing the maximum interference is hard. CoRR, abs/0802.2134 (2008)Google Scholar
  5. 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. 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
  7. 7.
    Halldórsson, M., Tokuyama, T.: Minimizing interference of a wireless ad-hoc network in a plane. Theor. Comput. Sci. 402(1), 29–42 (2008)MathSciNetCrossRefMATHGoogle Scholar
  8. 8.
    Korman, M.: Minimizing interference in ad-hoc networks with bounded communication radius. CoRR, abs/1102.2785 (2011)Google Scholar
  9. 9.
    Paterson, M., Yao, F.F.: On Nearest-Neighbor Graphs. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol. 623, pp. 416–426. Springer, Heidelberg (1992)CrossRefGoogle Scholar
  10. 10.
    Santi, P.: Topology control in wireless ad hoc and sensor networks. ACM Comput. Surv. 37(2), 164–194 (2005)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Vaidya, P.M.: An O(n logn) algorithm for the all-nearest-neighbors problem. Discrete Comput. Geom. 4, 101–115 (1989)MathSciNetCrossRefMATHGoogle Scholar
  12. 12.
    von Rickenbach, P., Wattenhofer, R., Zollinger, A.: Algorithmic models of interference in wireless ad hoc and sensor networks. IEEE/ACM Trans. Netw. 17(1), 172–185 (2009)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Matias Korman
    • 1
  1. 1.Université Libre de Bruxelles (ULB)BrusselsBelgium

Personalised recommendations