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 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. © 2012 Springer-Verlag.
CITATION STYLE
Bar-Noy, A., & Baumer, B. (2012). Maximizing network lifetime on the line with adjustable sensing ranges. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7111 LNCS, pp. 28–41). https://doi.org/10.1007/978-3-642-28209-6_4
Mendeley helps you to discover research relevant for your work.