{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T14:01:04Z","timestamp":1773064864071,"version":"3.50.1"},"reference-count":33,"publisher":"Wiley","license":[{"start":{"date-parts":[[2022,2,23]],"date-time":"2022-02-23T00:00:00Z","timestamp":1645574400000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Sensors"],"published-print":{"date-parts":[[2022,2,23]]},"abstract":"<jats:p>In order to balance the overall energy consumption and improve the energy efficiency of wireless sensor network (WSN), a distributed energy-balanced unequal clustering routing protocol based on the improved sine cosine algorithm (DUCISCA) is proposed. Firstly, DUCISCA adopts a time-based cluster head competition algorithm. In this algorithm, the broadcast time depends on the residual energy of the candidate cluster head, the distance to the base station, and the number of neighbour nodes. Secondly, a competition radius considering the distance from node to base station and the residual energy of node is proposed. It can balance energy consumption of nodes in different locations to avoid the \u201chot spot\u201d problem. At the same time, it adopts a time-based broadcast mechanism. The waiting time depends on the residual energy of CCHs, the distance to the BS, and the number of neighbour nodes, which can effectively reduce the overhead of nodes. Thirdly, the energy of cluster head, the number of neighbour nodes, and the distance from the ordinary node to the cluster heads need to be taken into account to get a better clustering result. Finally, in order to speed up convergence and improve the ability to jump out of local optimum, the improved sine-cosine algorithm (ISCA) based on Latin hypercube sampling and adaptive mutation is proposed. The improvement strategies adopted by ISCA are expressed as follows: Firstly, the diversity of the population is enhanced through LHS population initialization. Secondly, the adaptive weight strategy is introduced to accelerate the convergence speed of the algorithm. Finally, the population is disturbed by Gaussian mutation or Levy flight to jump out of the local optimum. The standard deviation of cluster heads\u2019 residual energy in intercluster communication is taken as the objective function to search the energy-balanced intercluster data forwarding path based on ISCA. Compared with EEUC, DEBUC, I-EEUC, and M-DEBUC, the simulation results prove that DUCISCA can effectively balance the overall network energy consumption and prolong the network lifetime.<\/jats:p>","DOI":"10.1155\/2022\/7382098","type":"journal-article","created":{"date-parts":[[2022,2,23]],"date-time":"2022-02-23T21:50:10Z","timestamp":1645653010000},"page":"1-13","source":"Crossref","is-referenced-by-count":6,"title":["A Distributed Unequal Clustering Routing Protocol Based on the Improved Sine Cosine Algorithm for WSN"],"prefix":"10.1155","volume":"2022","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4254-819X","authenticated-orcid":true,"given":"Fang","family":"Zhu","sequence":"first","affiliation":[{"name":"School of Computer and Communication Engineering, Northeastern University at Qinhuangdao, Qinhuangdao 066004, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1423-6917","authenticated-orcid":true,"given":"Wenhao","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Computer and Communication Engineering, Northeastern University at Qinhuangdao, Qinhuangdao 066004, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","reference":[{"issue":"1","key":"1","first-page":"18","article-title":"Prospective applications of wireless sensor node and wireless sensor network","volume":"4","author":"B. Prabhu","year":"2017","journal-title":"International Journal of Advanced Computing and Electronics Technology"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1007\/s12652-020-02088-7"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2876552"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/ICRTCCM.2017.87"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/HICSS.2000.926982"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2004.41"},{"issue":"3","key":"7","article-title":"CVLEACH: coverage based energy efficient LEACH algorithm","volume":"1","author":"A. Thakkar","year":"2012","journal-title":"International Journal of Computer Science and Network"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1155\/2017\/6457942"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/JSEN.2014.2312549"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2015.03.018"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1007\/s11276-021-02812-x"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1016\/j.suscom.2018.08.007"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.3390\/s19204579"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1016\/j.micpro.2020.103291"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1016\/j.jksuci.2017.03.006"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2005.365"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/MAHSS.2005.1542849"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1109\/ICITBS.2019.00046"},{"key":"19","doi-asserted-by":"publisher","DOI":"10.3724\/SP.J.1001.2012.04061"},{"key":"20","volume-title":"Research on Non-uniform Clustering Routing Protocol of Mine Wireless Sensor Network","author":"Y. Shui","year":"2020"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.11772\/j.issn.1001-9081.2017.12.3374"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2021.103140"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.3745\/JIPS.03.0142"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2015.12.022"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1109\/ICEDME50972.2020.00028"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1109\/ICNN.1995.488968"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1155\/2020\/5980504"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1088\/1742-6596\/1865\/4\/042006"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-018-3102-4"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1016\/j.advengsoft.2016.01.008"},{"key":"31","doi-asserted-by":"publisher","DOI":"10.1080\/21642583.2019.1708830"},{"issue":"9","key":"32","first-page":"2152","article-title":"Global search-oriented adaptive leader salp swarm algorithm","volume":"36","author":"J. S. Liu","year":"2021","journal-title":"Control and Decision"},{"issue":"3","key":"33","first-page":"463","article-title":"Research on the routing algorithm optimizing lifetime of wireless ad hoc networks","volume":"30","author":"L. Banteng","year":"2017","journal-title":"Chinese Journal of Sensors and Actuators"}],"container-title":["Journal of Sensors"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/js\/2022\/7382098.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/js\/2022\/7382098.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/js\/2022\/7382098.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,23]],"date-time":"2022-02-23T21:50:22Z","timestamp":1645653022000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/js\/2022\/7382098\/"}},"subtitle":[],"editor":[{"given":"Jes\u00fas","family":"Lozano","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2022,2,23]]},"references-count":33,"alternative-id":["7382098","7382098"],"URL":"https:\/\/doi.org\/10.1155\/2022\/7382098","relation":{},"ISSN":["1687-7268","1687-725X"],"issn-type":[{"value":"1687-7268","type":"electronic"},{"value":"1687-725X","type":"print"}],"subject":[],"published":{"date-parts":[[2022,2,23]]}}}