Document Type
Conference Proceeding
Publication Date
2-27-2012
Publication Title
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Publication Title
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume
7111 LNCS
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 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.
First Page
28
Last Page
41
Recommended Citation
Bar-Noy, Amotz and Baumer, Ben, "Maximizing Network Lifetime on the Line with Adjustable Sensing Ranges" (2012). Statistical and Data Sciences: Faculty Publications, Smith College, Northampton, MA.
https://scholarworks.smith.edu/sds_facpubs/39
Digital Object Identifier (DOI)
10.1007/978-3-642-28209-6_4
Included in
Data Science Commons, Other Computer Sciences Commons, Statistics and Probability Commons
Comments
Peer reviewed accepted manuscript.