dc.contributor.authorWang, Bang
dc.contributor.authorLim, Hock Beng
dc.contributor.authorMa, Di
dc.date.accessioned2013-09-30T04:18:33Z
dc.date.available2013-09-30T04:18:33Z
dc.date.copyright2012en_US
dc.date.issued2012
dc.identifier.citationWang, B., Lim, H. B., & Ma, D. (2012). A coverage-aware clustering protocol for wireless sensor networks. Computer networks, 56(5), 1599-1611.
dc.identifier.urihttp://hdl.handle.net/10220/13724
dc.description.abstractIn 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.en_US
dc.language.isoenen_US
dc.relation.ispartofseriesComputer networksen_US
dc.subjectDRNTU::Engineering::Mechanical engineering
dc.titleA coverage-aware clustering protocol for wireless sensor networksen_US
dc.typeJournal Article
dc.contributor.schoolSchool of Mechanical and Aerospace Engineeringen_US
dc.identifier.doihttp://dx.doi.org/10.1016/j.comnet.2012.01.016


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record