Coverage with k-Transmitters in the Presence of Obstacles

Author(s)
Ballinger, Brad; Benbernou, Nadia M.; Bose, Prosenjit; Damian, Mirela; Demaine, Erik D.; ... Show more
Thumbnail
DownloadDemaine_Coverage with.pdf (484.3Kb)
OPEN_ACCESS_POLICY
Terms of use
Creative Commons Attribution-Noncommercial-Share Alike 3.0 http://creativecommons.org/licenses/by-nc-sa/3.0/
Metadata
Show full item record
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.
Date issued
2010-12
URI
http://hdl.handle.net/1721.1/62801
Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science; Massachusetts Institute of Technology. Department of Mathematics
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
ISBN
978-3-642-17460-5
3-642-17460-4
Collections