Advertisement

Station Layouts in the Presence of Location Constraints

Extended Abstract
  • Christos Kaklamanis
  • Lefteris M. Kirousis
  • Prosenjit Bose
  • Evangelos Kranakis
  • Danny Krizanc
  • David Peleg
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1741)

Abstract

In wireless communication, the signal of a typical broadcast station is transmited from a broadcast center p and reaches objects at a distance, say, R from it. In addition there is a radius r, r < R, such that the signal originating from the center of the station is so strong that human habitation within distance r from the center p should be avoided. Thus every station determines a region which is an “annulus of permissible habitation”. We consider the following station layout (SL) problem: Cover a given (say, rectangular) planar region which includes a collection of orthogonal buildings with a minimum number of stations so that every point in the region is within the reach of a station, while at the same time no building is within the dangerous range of a station. We give algorithms for computing such station layouts in both the one- and two-dimensional cases.

Keywords

Rectangular Region Location Constraint Human Habitation Simple Polygon Unit Disk Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    L. I. Aupperle, H. E. Conn, J. M. Kell, and J. O’Rourke, “Covering Orthogonal Polygons with Squares”, in proceedings of 26th Annual Allerton Conference on Coom. Contr, and Comp., Urbana, 28–30, Sep. 1988.Google Scholar
  2. 2.
    R. Bar-Yehuda, and E. Ben-Chanoch, “An O(N log_ N) Time Algorithm for Covering Simple Polygons with Squares”, in proceedings of the 2nd Canadian Conference on Computational Geometry, held in Ottawa, pp. 186–190, 1990.Google Scholar
  3. 3.
    B. N. Clark, C. J. Colbourn, and D. S. Johnson, “Unit Disk Graphs”, Discrete Mathematics 86(1990) 165–177.Google Scholar
  4. 4.
    T. H. Cormen, C. E. Leiserson, and R. L. Rivest, “An Introduction to Algorithms”, MIT Press, 1990.Google Scholar
  5. 5.
    N. A. DePano, Y. Ko, and J. O’Rourke, “Finding Largest Equilateral Triangles and Squares”, Proceedings of the Allerton Conference, pages 869–878, 1987.Google Scholar
  6. 6.
    F. Gavril, “Algorithms for Minimum Coloring, Minimum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph”, SIAM J. Comput., Vol. 1, No. 2, June 1972, pp. 180–187.zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    D. S. Hochbaum and W. Maass, “Approximation Schemes for Covering and Packing Problems in Image Processing and VLSI”, J. ACM 32:130–138, 1985.zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    H. B. Hunt, M. V. Marathe, V. Radhakrishnan, S. S. Ravi, D. J. Rosenkrantz, R. E. Stearns, “NC Approximation Schemes for NP-and PSPACE-Hard Problems for Geometric Graphs”, in Proceedings of 2nd ESA, pp. 468–477.Google Scholar
  9. 9.
    J. C, Lin, “Biological Aspects of Mobile Communication Data”, Wireless Networks, pages 439–453, Vol. 3 (1997) No, 6.CrossRefGoogle Scholar
  10. 10.
    D. Moitra, “Finding a Minimal Cover for Binary Images: An Optimal Parallel Algorithm”, Algorithmica (1991) 6: 624–657.Google Scholar
  11. 11.
    K. Pahlavan and A. Levesque, “Wireless Information Networks,” Wiley-Interscience, New York, 1995.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Christos Kaklamanis
    • 1
  • Lefteris M. Kirousis
    • 1
  • Prosenjit Bose
    • 2
  • Evangelos Kranakis
    • 2
    • 3
  • Danny Krizanc
    • 2
    • 3
  • David Peleg
    • 4
  1. 1.Department of Computer Engineering and InformaticsUniversity of PatrasRioGreece
  2. 2.Carleton University, School of Computer ScienceOttawaCanada
  3. 3.MITACS project CANCCOM (Complex Adaptive Networks for Computing and Communication)Canada
  4. 4.Department of Applied Mathematics and Computer ScienceWeitzman InstituteIsrael

Personalised recommendations