Document Type

Article

Publication Date

5-2015

Publication Title

Algorithmica

Abstract

Given n sensors on an interval, each of which is equipped with an adjustable sensing radius and a unit battery charge that drains in inverse linear proportion to its radius, what schedule will maximize the lifetime of a network that covers the entire interval? Trivially, any reasonable algorithm is at least a 2-approximation for this Sensor Strip Cover problem, so we focus on developing an efficient algorithm that maximizes the expected network lifetime under a random uniform model of sensor distribution. We demonstrate one such algorithm that achieves an expected network lifetime within 12 % of the theoretical maximum. Most of the algorithms that we consider come from a particular family of RoundRobin coverage, in which sensors take turns covering predefined areas until their battery runs out.

Keywords

wireless sensor networks, adjustable range, restricted strip cover, lifetime, area coverage, barrier coverage

Volume

72

Issue

1

First Page

148

Last Page

166

DOI

doi.org/10.1007/s00453-013-9853-5

Rights

Licensed to Smith College and distributed CC-BY under the Smith College Faculty Open Access Policy.

Share

COinS