Base station placement on boundary of a convex polygon

Authors:
Sasanka Roy;Debabrata Bardhan;Sandip Das
Affiliations:
Tata Consultancy Services, Pune 411 013, India;LSI Logic India Pvt. Ltd., Kolkata 700 091, India;Indian Statistical Institute, Kolkata 700 108, India
Venue:
Journal of Parallel and Distributed Computing
Year:
2008

Citing 6
Cited 3

A Linear time algorithm for computing the Voronoi diagram of a convex polygon

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
A linear time algorithm for finding all farthest neighbors in a convex polygon

Information Processing Letters
The discrete 2-center problem

SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
More planar two-center algorithms

Computational Geometry: Theory and Applications
Computing the Constrained Euclidean Geodesic and Link Center of a Simple Polygon with Applications

CGI '96 Proceedings of the 1996 Conference on Computer Graphics International
Closest-point problems

SFCS '75 Proceedings of the 16th Annual Symposium on Foundations of Computer Science

Some variations on constrained minimum enclosing circle problem

Journal of Combinatorial Optimization
An Efficient Algorithm for Optimizing Base Station Site Selection to Cover a Convex Square Region in Cell Planning

Wireless Personal Communications: An International Journal
An approximation algorithm for k-center problem on a convex polygon

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

Let P be a polygonal region which is forbidden for placing 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 and assign a range such that every point in the region is covered by that base station and the range assigned to that base station for covering the region is minimum among all such possible choices 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 algorithm for that problem. In addition, we propose a linear time algorithm for placing a pair of base stations on a specified side of the boundary such that the range assigned to those base stations in order to cover the region is minimum among all such possible choices of a pair of base stations on that side.