论文信息 - Coverage with k-Transmitters in the Presence of Obstacles

Coverage with k-Transmitters in the Presence of Obstacles

For a fixed integer k ≥ 0, a k-transmitter is an omnidirectional wireless transmitter with an infinite broadcast range that is able to penetrate up to k. "walls", represented as line segments in the plane. We develop lower and upper bounds for the number of k-transmitters that are necessary and sufficient to cover a given collection of line segments, polygonal chains and polygons.

[1] Stephen G. Hartke,et al. Further Results on Bar k-Visibility Graphs , 2007, SIAM J. Discret. Math..

[2] J. O'Rourke. Art gallery theorems and algorithms , 1987 .

[3] D. T. Lee,et al. Computational complexity of art gallery problems , 1986, IEEE Trans. Inf. Theory.

[4] Ellen Gethner,et al. Bar k-Visibility Graphs: Bounds on the Number of Edges, Chromatic Number, and Thickness , 2005, GD.

[5] Franz Aurenhammer,et al. Two-convex polygons , 2009 .

[6] David Eppstein,et al. Guard placement for efficient point-in-polygon proofs , 2007, SCG '07.

[7] János Pach,et al. Intersecting convex sets by rays , 2008, SCG '08.

[8] Jorge Urrutia,et al. Art Gallery and Illumination Problems , 2000, Handbook of Computational Geometry.

[9] Joseph O'Rourke,et al. A New Lower Bound on Guard Placement for Wireless Localization , 2007, ArXiv.

[10] V. Chvátal. A combinatorial theorem in plane geometry , 1975 .

[11] Stefan Felsner,et al. Parameters of Bar k-Visibility Graphs , 2008, J. Graph Algorithms Appl..

[12] Oleg V. Borodin. A new proof of the 6 color theorem , 1995, J. Graph Theory.

[13] Michael Hoffmann,et al. Improved Bounds for Wireless Localization , 2008, SWAT.

[14] Jorge Urrutia,et al. Guarding rectangular art galleries , 1994, Discret. Appl. Math..