Please use this identifier to cite or link to this item: http://localhost/handle/Hannan/621157
Full metadata record
DC FieldValueLanguage
dc.contributor.authorDongyao Jiaen_US
dc.contributor.authorHuaihua Zhuen_US
dc.contributor.authorShengxiong Zouen_US
dc.contributor.authorPo Huen_US
dc.date.accessioned2020-05-20T09:23:19Z-
dc.date.available2020-05-20T09:23:19Z-
dc.date.issued2016en_US
dc.identifier.issn1530-437Xen_US
dc.identifier.issn1558-1748en_US
dc.identifier.other10.1109/JSEN.2015.2512322en_US
dc.identifier.urihttp://localhost/handle/Hannan/169566en_US
dc.identifier.urihttp://localhost/handle/Hannan/621157-
dc.description.abstractIn view of the wireless sensor network clustering algorithm at home and abroad, the dynamic cluster head selection methods for a wireless sensor network are put forward in order to solve the problem of the unreasonable cluster head selection that may lead to the overlapping coverage and unbalanced energy consumption in the cluster communication. Experimental results show that this method balances the network node energy in two phases compared with the existed algorithms. The network lifetime is increased by 50%, higher than that of low energy adaptive clustering hierarchy (LEACH), and increased by 30%, higher than that of distribute energy-efficient clustering algorithm (DEEC); also the survival time of the network is longer than that of energy-balanced deterministic clustering algorithm and adaptive energy optimized clustering algorithm, achieving the effectiveness of the network energy consumption, and it has the longest network lifetime.en_US
dc.publisherIEEEen_US
dc.relation.haspart7365420.pdfen_US
dc.subjectredundancy node|the average remaining|dynamic|energyen_US
dc.titleDynamic Cluster Head Selection Method for Wireless Sensor Networken_US
dc.typeArticleen_US
dc.journal.volume16en_US
dc.journal.issue8en_US
dc.journal.titleIEEE Sensors Journalen_US
Appears in Collections:2016

Files in This Item:
File Description SizeFormat 
7365420.pdf3.33 MBAdobe PDFThumbnail
Preview File
Full metadata record
DC FieldValueLanguage
dc.contributor.authorDongyao Jiaen_US
dc.contributor.authorHuaihua Zhuen_US
dc.contributor.authorShengxiong Zouen_US
dc.contributor.authorPo Huen_US
dc.date.accessioned2020-05-20T09:23:19Z-
dc.date.available2020-05-20T09:23:19Z-
dc.date.issued2016en_US
dc.identifier.issn1530-437Xen_US
dc.identifier.issn1558-1748en_US
dc.identifier.other10.1109/JSEN.2015.2512322en_US
dc.identifier.urihttp://localhost/handle/Hannan/169566en_US
dc.identifier.urihttp://localhost/handle/Hannan/621157-
dc.description.abstractIn view of the wireless sensor network clustering algorithm at home and abroad, the dynamic cluster head selection methods for a wireless sensor network are put forward in order to solve the problem of the unreasonable cluster head selection that may lead to the overlapping coverage and unbalanced energy consumption in the cluster communication. Experimental results show that this method balances the network node energy in two phases compared with the existed algorithms. The network lifetime is increased by 50%, higher than that of low energy adaptive clustering hierarchy (LEACH), and increased by 30%, higher than that of distribute energy-efficient clustering algorithm (DEEC); also the survival time of the network is longer than that of energy-balanced deterministic clustering algorithm and adaptive energy optimized clustering algorithm, achieving the effectiveness of the network energy consumption, and it has the longest network lifetime.en_US
dc.publisherIEEEen_US
dc.relation.haspart7365420.pdfen_US
dc.subjectredundancy node|the average remaining|dynamic|energyen_US
dc.titleDynamic Cluster Head Selection Method for Wireless Sensor Networken_US
dc.typeArticleen_US
dc.journal.volume16en_US
dc.journal.issue8en_US
dc.journal.titleIEEE Sensors Journalen_US
Appears in Collections:2016

Files in This Item:
File Description SizeFormat 
7365420.pdf3.33 MBAdobe PDFThumbnail
Preview File
Full metadata record
DC FieldValueLanguage
dc.contributor.authorDongyao Jiaen_US
dc.contributor.authorHuaihua Zhuen_US
dc.contributor.authorShengxiong Zouen_US
dc.contributor.authorPo Huen_US
dc.date.accessioned2020-05-20T09:23:19Z-
dc.date.available2020-05-20T09:23:19Z-
dc.date.issued2016en_US
dc.identifier.issn1530-437Xen_US
dc.identifier.issn1558-1748en_US
dc.identifier.other10.1109/JSEN.2015.2512322en_US
dc.identifier.urihttp://localhost/handle/Hannan/169566en_US
dc.identifier.urihttp://localhost/handle/Hannan/621157-
dc.description.abstractIn view of the wireless sensor network clustering algorithm at home and abroad, the dynamic cluster head selection methods for a wireless sensor network are put forward in order to solve the problem of the unreasonable cluster head selection that may lead to the overlapping coverage and unbalanced energy consumption in the cluster communication. Experimental results show that this method balances the network node energy in two phases compared with the existed algorithms. The network lifetime is increased by 50%, higher than that of low energy adaptive clustering hierarchy (LEACH), and increased by 30%, higher than that of distribute energy-efficient clustering algorithm (DEEC); also the survival time of the network is longer than that of energy-balanced deterministic clustering algorithm and adaptive energy optimized clustering algorithm, achieving the effectiveness of the network energy consumption, and it has the longest network lifetime.en_US
dc.publisherIEEEen_US
dc.relation.haspart7365420.pdfen_US
dc.subjectredundancy node|the average remaining|dynamic|energyen_US
dc.titleDynamic Cluster Head Selection Method for Wireless Sensor Networken_US
dc.typeArticleen_US
dc.journal.volume16en_US
dc.journal.issue8en_US
dc.journal.titleIEEE Sensors Journalen_US
Appears in Collections:2016

Files in This Item:
File Description SizeFormat 
7365420.pdf3.33 MBAdobe PDFThumbnail
Preview File