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.
Recommended Citation
M. X. Cheng and X. Gong, "Maximum Lifetime Coverage Preserving Scheduling Algorithms in Sensor Networks," Journal of Global Optimization, vol. 51, no. 3, pp. 447 - 462, Springer, Nov 2011.
The definitive version is available at https://doi.org/10.1007/s10898-010-9636-3
Department(s)
Computer Science
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
Comments
National Science Foundation, Grant CNS-0841388