Coverage with k-Transmitters in the Presence of Obstacles
Name
Demaine_Coverage with.pdf
Size
484.38 KB
Format
Adobe PDF
Checksum (MD5)
3bf4b9c54a876f9834319facc04516c2
Author(s)
Ballinger, Brad
Benbernou, Nadia M.
Bose, Prosenjit
Damian, Mirela
Demaine, Erik D.
Dujmovic, Vida
Flatland, Robin
Hurtado, Ferran
Iacono, John
Lubiw, Anna
Date Issued
December 2010
Journal
Proceedings of the 4th International Conference on Combinatorial optimization and applications - Volume Part II, COCOA'10
Publisher
Association for Computing Machinery
Citation
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.
Version
Author's final manuscript
Abstract
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.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology. Department of Mathematics
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike 3.0
Persistent DSpace Link
DOI of Published Version
http://portal.acm.org/citation.cfm?id=1940425
