A coverage-aware clustering protocol for wireless sensor networks
In energy-limited wireless sensor networks, network clustering and sensor scheduling are two efficient techniques for minimizing node energy consumption and maximizing network coverage lifetime. When integrating the two techniques, the challenges include how to decide the most energy-efficient clust...
Saved in:
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
2013
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/99718 http://hdl.handle.net/10220/13724 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Nanyang Technological University |
| Language: | English |
| Summary: | In energy-limited wireless sensor networks, network clustering and sensor scheduling are two efficient techniques for minimizing node energy consumption and maximizing network coverage lifetime. When integrating the two techniques, the challenges include how to decide the most energy-efficient cluster size and how to select cluster heads and active nodes. In this paper, we provide a computation method for the optimal cluster size to minimize the average energy consumption rate per unit area. In the proposed coverage-aware clustering protocol, we define a cost metric that favors those nodes being more energy-redundantly covered as better candidates for cluster heads and select active nodes in a way that tries to emulate the most efficient tessellation for area coverage. Our simulation results validate our computation and show the significant improvement of the network coverage lifetime. |
|---|