Coverage with k-Transmitters in the Presence of Obstacles

• Main Authors: Ballinger, Brad (Author), Benbernou, Nadia M. (Contributor), Bose, Prosenjit (Author), Damian, Mirela (Author), Demaine, Erik D. (Contributor), Dujmovic, Vida (Author), Flatland, Robin (Author), Hurtado, Ferran (Author), Iacono, John (Author), Lubiw, Anna (Author), Morin, Pat (Author), Sacristan, Vera (Author), Souvaine, Diane (Author), Uehara, Ryuhei (Author)
• Other Authors: Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor), Massachusetts Institute of Technology. Department of Mathematics (Contributor)
• Format: Article
• Language: English
• Published: Association for Computing Machinery, 2011-05-10T17:39:35Z.
• Subjects: Article
• Online Access: Get fulltext

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.
National Science Foundation (U.S.) (NSF grant CCF-0728909)