Full metadata record
DC FieldValueLanguage
dc.contributor.authorLai, Wei Kuangen_US
dc.contributor.authorFan, Chung-Shuoen_US
dc.contributor.authorShieh, Chin-Shiuhen_US
dc.date.accessioned2014-12-08T15:35:50Z-
dc.date.available2014-12-08T15:35:50Z-
dc.date.issued2014-04-29en_US
dc.identifier.issn1976-7277en_US
dc.identifier.urihttp://dx.doi.org/10.3837/tiis.2014.04.005en_US
dc.identifier.urihttp://hdl.handle.net/11536/24219-
dc.description.abstractIn wireless sensor networks (WSNs), hierarchical clustering is an efficient approach for lower energy consumption and extended network lifetime. In cluster-based multi-hop communications, a cluster head (CH) closer to the sink is loaded heavier than those CHs farther away from the sink. In order to balance the energy consumption among CHs, we development a novel cluster-based routing protocol for corona-structured wireless sensor networks. Based on the relaying traffic of each CH conveys, adequate radius for each corona can be determined through nearly balanced energy depletion analysis, which leads to balanced energy consumption among CHs. Simulation results demonstrate that our clustering approach effectively improves the network lifetime, residual energy and reduces the number of CH rotations in comparison with the MLCRA protocols.en_US
dc.language.isoen_USen_US
dc.subjectWireless sensor networksen_US
dc.subjectclusteringen_US
dc.subjectsensorsen_US
dc.subjectload balancingen_US
dc.subjectcluster headen_US
dc.titleEfficient Cluster Radius and Transmission Ranges in Corona-based Wireless Sensor Networksen_US
dc.typeArticleen_US
dc.identifier.doi10.3837/tiis.2014.04.005en_US
dc.identifier.journalKSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMSen_US
dc.citation.volume8en_US
dc.citation.issue4en_US
dc.citation.spage1237en_US
dc.citation.epage1255en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000335386400005-
dc.citation.woscount1-
Appears in Collections:Articles


Files in This Item:

  1. 000335386400005.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.