Coverage with k-Transmitters in the Presence of Obstacles
Author(s)Ballinger, Brad; Benbernou, Nadia M.; Bose, Prosenjit; Damian, Mirela; Demaine, Erik D.; Dujmovic, Vida; Flatland, Robin; Hurtado, Ferran; Iacono, John; Lubiw, Anna; Morin, Pat; Sacristan, Vera; Souvaine, Diane; Uehara, Ryuhei; ... Show more Show less
MetadataShow full item record
For a fixed integer k [greater than or equal to] 0, a k-transmitter is an omnidirectional wireless transmitter with an in nite 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.
DepartmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Science; Massachusetts Institute of Technology. Department of Mathematics
Proceedings of the 4th International Conference on Combinatorial optimization and applications - Volume Part II, COCOA'10
Association for Computing Machinery
Ballinger, Brad, et al. "Coverage with k-Transmitters in the Presence of Obstacles." COCOA'10, in Proceedings of the 4th International Conference on Combinatorial Optimization and Applications - Volume Part II, Kailua-Kona, Hawaii, USA, Dec. 18-20, 2010.
Author's final manuscript