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 sufficient to cover a given collection of line segments, polygonal chains and polygons.

CitationBallinger, B. [et al.]. Coverage with k-transmitters in the presence of obstacles. A: Annual International Conference on Combinatorial Optimization and Applications. "4th Annual International Conference on Combinatorial Optimization and Applications". Hawaii: Springer Verlag, 2010, p. 1-15.

URIhttp://hdl.handle.net/2117/11067

DOI10.1007/978-3-642-17461-2

ISBN3-642-17457-4

Publisher versionhttp://www.springerlink.com/content/g7116wr21w383265/fulltext.pdf

Collections

View Usage Statistics

Show full item record

Files	Description	Size	Format	View
coverage with k-transmitters.pdf		521.6Kb	PDF	Restricted access

All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder. If you wish to make any use of the work not provided for in the law, please contact: sepi.bupc@upc.edu

UPCommons. Global access to UPC knowledge

Coverage with k-transmitters in the presence of obstacles

View/Open

Abstract

Collections

Browse