Original paper
Energy-efficient k-coverage scheduling algorithm for sensor networks with adjustable sensing range
Published: Sep 1, 2013
Abstract
A dynamic energy efficient scheduling algorithm for k-coverage Wireless Sensor Networks with adjustable sensing range has been proposed in this study. These types of sensors require a minimal coverage range setting to reduce the utilization of energy. In our proposed algorithm, each sensor utilizes the minimum feasible sensing range without affecting the network coverage; on the other hand, the activated sensors are able to cover the same area...
Paper Details
Title
Energy-efficient k-coverage scheduling algorithm for sensor networks with adjustable sensing range
Published Date
Sep 1, 2013
Citation AnalysisPro
You’ll need to upgrade your plan to Pro
Looking to understand the true influence of a researcher’s work across journals & affiliations?
- Scinapse’s Top 10 Citation Journals & Affiliations graph reveals the quality and authenticity of citations received by a paper.
- Discover whether citations have been inflated due to self-citations, or if citations include institutional bias.
Notes
History