Approximating relay placement in sensor networks

Workshop poster

Author:	Jukka Suomela
Title:	Approximating relay placement in sensor networks
Workshop:	3rd ACM International Workshop on Performance Evaluation of Wireless Ad Hoc, Sensor, and Ubiquitous Networks (PE-WASUN), Torremolinos, Spain, October 2006
Proceedings:	Lichun Bao and Isabelle Guerin Lassous (Eds.): PE-WASUN 2006. Proceedings of the Third ACM International Workshop on Performance Evaluation of Wireless Ad Hoc, Sensor and Ubiquitous Networks. October 6, 2006. Torremolinos, Malaga, Spain
	ACM Press, New York, NY, USA, 2006 ISBN: 1-59593-487-1 pages 145–148 doi:10.1145/1163610.1163635
Links:	publisher’s version · free access · author’s version © ACM 2006 — This is the author’s version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in Proc. 3rd ACM International Workshop on Performance Evaluation of Wireless Ad Hoc, Sensor, and Ubiquitous Networks. http://doi.acm.org/10.1145/1163610.1163635
	poster, 6 October 2006
	workshop · conference · proceedings · DBLP · Google
Abstract:	The problem of placing relay nodes in a wireless sensor network is studied in the context of balanced data gathering. Previous work is extended by showing that even the simplest classes of the relay placement problem are hard to approximate. This work also presents a heuristic method for both lower-bounding and upper-bounding the maximum performance of a sensor network over all possible relay locations.

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author’s copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.