Coverage with k-transmitters in the presence of obstacles

For a fixed integer k ≥0, a k -transmitter is an omnidirectional wireless transmitter with an infinite 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 suff...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Journal of combinatorial optimization 2013-02, Vol.25 (2), p.208-233
Hauptverfasser:	Ballinger, Brad, Benbernou, Nadia, Bose, Prosenjit, Damian, Mirela, Demaine, Erik D., Dujmović, Vida, Flatland, Robin, Hurtado, Ferran, Iacono, John, Lubiw, Anna, Morin, Pat, Sacristán, Vera, Souvaine, Diane, Uehara, Ryuhei
Format:	Artikel
Sprache:	eng
Schlagworte:	Combinatorics Convex and Discrete Geometry Mathematical Modeling and Industrial Mathematics Mathematics Mathematics and Statistics Operations Research/Decision Theory Optimization Theory of Computation
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	For a fixed integer k ≥0, a k -transmitter is an omnidirectional wireless transmitter with an infinite 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.
ISSN:	1382-6905 1573-2886
DOI:	10.1007/s10878-012-9475-x