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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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.
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.
B. N. Clark, C. J. Colbourn, and D. S. Johnson, “Unit Disk Graphs”, Discrete Mathematics 86(1990) 165–177.
T. H. Cormen, C. E. Leiserson, and R. L. Rivest, “An Introduction to Algorithms”, MIT Press, 1990.
N. A. DePano, Y. Ko, and J. O’Rourke, “Finding Largest Equilateral Triangles and Squares”, Proceedings of the Allerton Conference, pages 869–878, 1987.
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.
D. S. Hochbaum and W. Maass, “Approximation Schemes for Covering and Packing Problems in Image Processing and VLSI”, J. ACM 32:130–138, 1985.
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.
J. C, Lin, “Biological Aspects of Mobile Communication Data”, Wireless Networks, pages 439–453, Vol. 3 (1997) No, 6.
D. Moitra, “Finding a Minimal Cover for Binary Images: An Optimal Parallel Algorithm”, Algorithmica (1991) 6: 624–657.
K. Pahlavan and A. Levesque, “Wireless Information Networks,” Wiley-Interscience, New York, 1995.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kaklamanis, C., Kirousis, L.M., Bose, P., Kranakis, E., Krizanc, D., Peleg, D. (1999). Station Layouts in the Presence of Location Constraints. In: Algorithms and Computation. ISAAC 1999. Lecture Notes in Computer Science, vol 1741. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46632-0_28
Download citation
DOI: https://doi.org/10.1007/3-540-46632-0_28
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66916-6
Online ISBN: 978-3-540-46632-1
eBook Packages: Springer Book Archive