Efficient algorithm for placing a given number of base stations to cover a convex region

DOI10.1016/J.JPDC.2006.05.004MaRDI QIDQ861306zbMATH OpenOpenAlexFDO

Authors Gautam K. Das, Sandip Das, Subhas C. Nandy, Bhabani P. Sinha

Publication date 9 January 2007

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jpdc.2006.05.004

zbMATH Keywords

Voronoi diagrambase-station placementcovering region

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• Distributed Computing – IWDC 2005
• VARIATIONS OF BASE-STATION PLACEMENT PROBLEM ON THE BOUNDARY OF A CONVEX REGION
• Base station placement on boundary of a convex polygon
• An algorithm for maximising covered area
• scientific article; zbMATH DE number 2089212

Cited in

(12)

• VARIATIONS OF BASE-STATION PLACEMENT PROBLEM ON THE BOUNDARY OF A CONVEX REGION
• An algorithm for maximising covered area
• Base station placement on boundary of a convex polygon
• Optimal circle covering problems and their applications
• Iterated dynamic thresholding search for packing equal circles into a circular container
• Worst-case optimal covering of rectangles by disks
• On multiple coverings of fixed size containers with non-Euclidean metric by circles of two types
• Optimal 2-coverage of a polygonal region in a sensor network
• Distributed Computing – IWDC 2005
• A shape optimization approach to the problem of covering a two-dimensional region with minimum-radius identical balls
• Worst-case optimal covering of triangles by disks
• The connected disk covering problem

This page was built for publication: Efficient algorithm for placing a given number of base stations to cover a convex region

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q861306)