Abstract
Let P be a polygonal region which is forbidden in order to place a base station in the context of mobile communication. Our objective is to place one base station at any point on the boundary of P or two base stations at some specified edge and assign a range such that every point in the region is covered by those base stations and the maximum range assigned to these base stations is minimum among all such possible choice of base stations. Here we consider the forbidden region P as convex and base station can be placed on the boundary of the region. We present optimum linear time algorithms for these problems.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Roy, S., Bardhan, D., Das, S. (2005). Efficient Algorithm for Placing Base Stations by Avoiding Forbidden Zone. In: Chakraborty, G. (eds) Distributed Computing and Internet Technology. ICDCIT 2005. Lecture Notes in Computer Science, vol 3816. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11604655_14
Download citation
DOI: https://doi.org/10.1007/11604655_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30999-4
Online ISBN: 978-3-540-32429-4
eBook Packages: Computer ScienceComputer Science (R0)