Coverage with k-Transmitters in the Presence of Obstacles

Coverage with k-Transmitters in the Presence of Obstacles

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-tran...

Full description

Bibliographic Details
Main Authors: 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
Other Authors: Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Format: Article
Language:en_US
Published: Association for Computing Machinery 2011
Online Access:http://hdl.handle.net/1721.1/62801
https://orcid.org/0000-0003-3803-5703
Description
Summary: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.

Similar Items