Advertisement

Minimizing Interference of a Wireless Ad-Hoc Network in a Plane

  • Magnús M. Halldórsson
  • Takeshi Tokuyama
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4240)

Abstract

We consider the problem of topology control of a wireless ad-hoc network on a given set of points in the plane, where we aim to minimize the maximum interference by assigning a suitable transmission radius to each point. By using computational geometric ideas and ε-net theory, we attain an \(O(\sqrt{\Delta})\) bound for the maximum interference where Δ is the interference of a uniform-radius ad-hoc network. This generalizes a result given in [8] for the special case of highway model (i.e., one-dimensional problem) to the two-dimensional case. We also give a method based on quad-tree decomposition and bucketing that has another provable interference bound in terms of the ratio of the minimum distance to the radius of a uniform-radius ad-hoc network.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Agarwal, P.K.: Range Searching. In: Goodman, J.E., O’Rourke, J. (eds.) Handbook of Discrete and Computational Geometry, vol. 31, pp. 575–598. CRC Press, Boca Raton (1997)Google Scholar
  2. 2.
    Burkhart, M., von Rickenbach, P., Wattenhofer, R., Zollinger, A.: Does Topology Control Reduce Interference? In: Proc. MobiHoc 2004, pp. 9–19 (2004)Google Scholar
  3. 3.
    Haussler, D., Welzl, E.: ε-Nets and Simplex Range Queries. Discrete & Compu. Geom. 2, 237–256 (1987)MathSciNetGoogle Scholar
  4. 4.
    Matoušek, J.: Geometric Discrepancy. An Illustrated Guide. Springer, Heidelberg (1999)zbMATHGoogle Scholar
  5. 5.
    Matoušek, J., Seidel, R., Welzl, E.: How to Net a Lot with Little: Small ε-Nets for Disks and Halfspaces. In: Proc. 6th Symp. on Computational Geometry, pp. 16–22 (1990)Google Scholar
  6. 6.
    Moscibroda, T., Wattenhofer, R.: Minimizing Interference in Ad Hoc and Sensor Networks. In: Proc. DIALM-POMC Joint Workshop 2005, pp. 24–33 (2005)Google Scholar
  7. 7.
    Preparata, F.P., Shamos, M.I.: Computational Geometry, an Introduction, Texts and Monographs in Computer Science, 2nd edn. Springer, Heidelberg (1988)Google Scholar
  8. 8.
    von Rickenbach, P., Schmid, S., Wattenhofer, R., Zollinger, A.: A Robust Interference Model for Wireless Ad-Hoc Networks. In: Proc. IPDPS 2005 (2005)Google Scholar
  9. 9.
    Yao, A.C.-C.: On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems. SIAM J. Comput. 11, 721–736 (1982)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Magnús M. Halldórsson
    • 1
  • Takeshi Tokuyama
    • 2
  1. 1.Dept. of Computer Science, Faculty of EngineeringUniversity of IcelandReykjavikIceland
  2. 2.Graduate School of Information SciencesTohoku UniversitySendaiJapan

Personalised recommendations