Abstract
Given n sensors on a line, each of which is equipped with a unit battery charge and an adjustable sensing radius, what schedule will maximize the lifetime of a network that covers the entire line? Trivially, any reasonable algorithm is at least a \(\frac{1}{2}\)-approximation, but we prove tighter bounds for several natural algorithms. We focus on developing a linear time algorithm that maximizes the expected lifetime under a random uniform model of sensor distribution. We demonstrate one such algorithm that achieves an average-case approximation ratio of almost 0.9. Most of the algorithms that we consider come from a family based on RoundRobin coverage, in which sensors take turns covering predefined areas until their battery runs out.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aloupis, G., Cardinal, J., Collette, S., Langerman, S., Orden, D., Ramos, P.: Decomposition of Multiple Coverings into More Parts. Discrete & Computational Geometry 44(3), 706–723 (2010)
Bar-Noy, A., Brown, T., Johnson, M.P., Liu, O.: Cheap or Flexible Sensor Coverage. In: Krishnamachari, B., Suri, S., Heinzelman, W., Mitra, U. (eds.) DCOSS 2009. LNCS, vol. 5516, pp. 245–258. Springer, Heidelberg (2009)
Berman, P., Calinescu, G., Shah, C., Zelikovsky, A.: Efficient Energy Management in Sensor Networks. Ad Hoc and Sensor Networks 2, 71–90 (2005)
Buchsbaum, A.L., Efrat, A., Jain, S., Venkatasubramanian, S., Yi, K.: Restricted Strip Covering and the Sensor Cover Problem. In: Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1056–1065 (2007)
Cardei, M., Wu, J., Lu, M.: Improving Network Lifetime Using Sensors with Adjustable Sensing Ranges. Int. J. Sensor Networks 1(1), 41–49 (2006)
Dhawan, A., Vu, C.T., Zelikovsky, A., Li, Y., Prasad, S.K.: Maximum Lifetime of Sensor Networks with Adjustable Sensing Range. In: Proceedings of the International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD), pp. 285–289 (2006)
Gibson, M., Varadarajan, K.: Decomposing Coverings and the Planar Sensor Cover Problem. In: 50th Annual IEEE Symposium on Foundations of Computer Science, pp. 159–168 (2009)
Lev-Tov, N., Peleg, D.: Polynomial Time Approximation Schemes for Base Station Coverage with Minimum Total Radii. Computer Networks 47(4), 489–501 (2005)
Mitzenmacher, M., Upfal, E.: Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, New York (2005)
Pach, J.: Covering the Plane with Convex Polygons. Discrete & Computational Geometry 1(1), 73–81 (1986)
Pach, J., Tóth, G.: Decomposition of Multiple Coverings into Many Parts. Computational Geometry 42(2), 127–133 (2009)
Wu, J., Yang, S.: CoverageIissue in Sensor Networks with Adjustable Ranges. In: Proceedings of the 2004 Intl. Conference on Parallel Processing Workshops, pp. 61–68 (2004)
Weisstein, E.W.: “q-Series.” From MathWorld–A Wolfram Web Resource, http://mathworld.wolfram.com/q-Series.html
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bar-Noy, A., Baumer, B. (2012). Maximizing Network Lifetime on the Line with Adjustable Sensing Ranges. In: Erlebach, T., Nikoletseas, S., Orponen, P. (eds) Algorithms for Sensor Systems. ALGOSENSORS 2011. Lecture Notes in Computer Science, vol 7111. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28209-6_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-28209-6_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-28208-9
Online ISBN: 978-3-642-28209-6
eBook Packages: Computer ScienceComputer Science (R0)