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. © 2010 Springer-Verlag.
CITATION STYLE
Ballinger, B., Benbernou, N., Bose, P., Damian, M., Demaine, E. D., Dujmović, V., … Uehara, R. (2010). Coverage with k-transmitters in the presence of obstacles. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6509 LNCS, pp. 1–15). https://doi.org/10.1007/978-3-642-17461-2_1
Mendeley helps you to discover research relevant for your work.