Abstract

In wireless sensor networks, when each target is covered by multiple sensors, sensors can take turns to monitor the targets in order to extend the lifetime of the network. in this paper, we address how to improve network lifetime through optimal scheduling of sensor nodes. We present two algorithms to achieve the maximum lifetime while maintaining the required coverage: A linear programming-Based exponential-time exact solution, and an approximation algorithm. Numerical simulation results from the approximation algorithm are compared to the exact solution and show a high degree of accuracy and efficiency. © 2010 Springer Science Business Media, LLC.

Department(s)

Computer Science

Comments

National Science Foundation, Grant CNS-0841388

Keywords and Phrases

Approximation algorithm; Coverage; Lifetime; Linear programming; Sensor network

International Standard Serial Number (ISSN)

1573-2916; 0925-5001

Document Type

Article - Journal

Document Version

Citation

File Type

text

Language(s)

English

Rights

© 2024 Springer, All rights reserved.

Publication Date

01 Nov 2011

Share

 
COinS