Date of Award
5-3-2007
Degree Type
Thesis
Degree Name
Master of Science (MS)
Department
Computer Science
First Advisor
Dr. Yingshu Li - Chair
Second Advisor
Dr. Sushil K. Prasad
Third Advisor
Dr. Anu G. Bourgeois
Abstract
Wireless sensor networks (WSNs) have recently achieved a great deal of attention due to its numerous attractive applications in many different fields. Sensors and WSNs possesses a number of special characteristics that make them very promising in many applications, but also put on them lots of constraints that make issues in sensor network particularly difficult. These issues may include topology control, routing, coverage, security, and data management. In this thesis, we focus our attention on the coverage problem. Firstly, we define the Sensor Energy-efficient Scheduling for k-coverage (SESK) problem. We then solve it by proposing a novel, completely localized and distributed scheduling approach, naming Distributed Energy-efficient Scheduling for k-coverage (DESK) such that the energy consumption among all the sensors is balanced, and the network lifetime is maximized while still satisfying the k-coverage requirement. Finally, in related work section we conduct an extensive survey of the existing work in literature that focuses on with the coverage problem.
DOI
https://doi.org/10.57709/1059385
Recommended Citation
Vu, Chinh Trung, "An Energy-Efficient Distributed Algorithm for k-Coverage Problem in Wireless Sensor Networks." Thesis, Georgia State University, 2007.
doi: https://doi.org/10.57709/1059385