{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T22:32:22Z","timestamp":1767652342915,"version":"build-2065373602"},"reference-count":19,"publisher":"MDPI AG","issue":"13","license":[{"start":{"date-parts":[[2019,7,2]],"date-time":"2019-07-02T00:00:00Z","timestamp":1562025600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61762030"],"award-info":[{"award-number":["61762030"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Innovation-driven Development Special Fund of Guangxi","award":["AA1720417"],"award-info":[{"award-number":["AA1720417"]}]},{"DOI":"10.13039\/501100009329","name":"Scientific Research and Technology Development Program of Guangxi","doi-asserted-by":"publisher","award":["AB16380237"],"award-info":[{"award-number":["AB16380237"]}],"id":[{"id":"10.13039\/501100009329","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sensors"],"abstract":"<jats:p>The low energy adaptive clustering hierarchy (LEACH) is the classical hierarchical topology control algorithm and still widely used today in wireless sensor networks. There are some problems in LEACH such us an unreasonable selection and uneven distribution of cluster heads, not considering the residual energy of nodes, the cluster head is overloaded and there is a high energy consumption of data transmission. In this paper, a topology control algorithm with double cluster heads and multi-hop based on affinity propagation clustering (APDC-M) was proposed. In APDC-M, firstly, a cluster head election algorithm with double choices based on the affinity propagation clustering algorithm (AP) and reference node strategy (APDC) was proposed. APDC is responsible to elect the fusion cluster head for node clustering. Secondly, a forwarding cluster head is elected within each cluster. The forwarding cluster head is responsible for the data transmission in order to reduce the energy consumption of a single cluster head. Lastly, the forwarding cluster heads complete the data transmission from a cluster to the base station by the shortest path inter-cluster multi-hop mode. The comparison simulation results show that APDC-M can make the cluster head election more reasonable and the cluster head distribution more uniform, and effectively reduce the energy consumption of the cluster head nodes when transmitting data, thus prolonging the network life.<\/jats:p>","DOI":"10.3390\/s19132925","type":"journal-article","created":{"date-parts":[[2019,7,2]],"date-time":"2019-07-02T12:11:17Z","timestamp":1562069477000},"page":"2925","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["A Hierarchical Topology Control Algorithm for WSN, Considering Node Residual Energy and Lightening Cluster Head Burden Based on Affinity Propagation"],"prefix":"10.3390","volume":"19","author":[{"given":"Ling","family":"Song","sequence":"first","affiliation":[{"name":"School of Computer &amp; Electronic Information, Guangxi University, Nanning 530004, China"},{"name":"Guangxi Key Laboratory of Multimedia Communications and Network Technology, Nanning 530004, China"}]},{"given":"Qidong","family":"Song","sequence":"additional","affiliation":[{"name":"School of Computer &amp; Electronic Information, Guangxi University, Nanning 530004, China"},{"name":"Guangxi Key Laboratory of Multimedia Communications and Network Technology, Nanning 530004, China"}]},{"given":"Jin","family":"Ye","sequence":"additional","affiliation":[{"name":"School of Computer &amp; Electronic Information, Guangxi University, Nanning 530004, China"},{"name":"Guangxi Key Laboratory of Multimedia Communications and Network Technology, Nanning 530004, China"}]},{"given":"Yan","family":"Chen","sequence":"additional","affiliation":[{"name":"School of Computer &amp; Electronic Information, Guangxi University, Nanning 530004, China"},{"name":"Guangxi Key Laboratory of Multimedia Communications and Network Technology, Nanning 530004, China"}]}],"member":"1968","published-online":{"date-parts":[[2019,7,2]]},"reference":[{"key":"ref_1","unstructured":"Heinzelman, W.R., Chandrakasan, A., and Balakrishnan, H. (2000, January 4\u20137). Energy-Efficient Communication Protocol for Wireless Microsensor Networks. Proceedings of the 33rd Annual Hawaii International Conference on System Sciences. [S. l.]: IEEE Computer Society, Maui, Hawaii, USA."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Xu, Y., Heidemann, J., and Estrin, D. (2001, January 16\u201321). Geography-informed energy conservation for Ad Hoc routing. Proceedings of the International Conference on Mobile Computing and NETWORKING, Rome, Italy.","DOI":"10.1145\/381677.381685"},{"key":"ref_3","first-page":"115","article-title":"A kind of WSNs topology control algorithm based on TopDisc","volume":"33","author":"Wang","year":"2014","journal-title":"Transducer Microsyst. Technol."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1109\/TMC.2004.41","article-title":"HEED: A hybrid, energy-efficient, distributed clustering approach for ad hoc sensor networks","volume":"3","author":"Younis","year":"2004","journal-title":"IEEE Trans. Mob. Comput."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"660","DOI":"10.1109\/TWC.2002.804190","article-title":"An application-specific protocol architecture for wireless microsensor networks","volume":"1","author":"Heinzelman","year":"2002","journal-title":"IEEE Trans. Wirel. Commun."},{"key":"ref_6","first-page":"396","article-title":"An Energy Balanced Clustering Routing Protocol for WSN","volume":"26","author":"Li","year":"2013","journal-title":"Chin. J. Sens. Actuators"},{"key":"ref_7","first-page":"120","article-title":"LEACH algorithm for wireless sensor networks based on energy optimization","volume":"35","author":"Yan","year":"2016","journal-title":"Transducer Microsyst. Technol."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"1180","DOI":"10.1016\/j.procs.2014.05.551","article-title":"A New Approach for Clustering in Wireless Sensors Networks Based on LEACH","volume":"32","author":"Khediri","year":"2014","journal-title":"Procedia Comput. Sci."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s11276-015-0951-y","article-title":"LEACH-MAC: A new cluster head selection algorithm for Wireless Sensor Networks","volume":"22","author":"Batra","year":"2016","journal-title":"Wirel. Netw."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"1515","DOI":"10.1007\/s11276-014-0691-4","article-title":"IBLEACH: Intra-balanced LEACH protocol for wireless sensor networks","volume":"20","author":"Salim","year":"2014","journal-title":"Wirel. Networks"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"460","DOI":"10.1016\/j.procs.2015.12.046","article-title":"Improvements in LEACH based on K-means and Gauss algorithms","volume":"73","author":"Rabiaa","year":"2015","journal-title":"Procedia Comput. Sci."},{"key":"ref_12","unstructured":"Liu, S., Li, Z., and Wu, Y. (2016). Routing Algorithm for Wireless Sensor Network Based on Energy Consumption Gradient. Chin. J. Sens. Actuators, 1247\u20131252."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Gou, H., and Yoo, Y. (2010, January 12\u201314). An Energy Balancing LEACH Algorithm for Wireless Sensor Networks. Proceedings of the 2010 Seventh International Conference on Information Technology: New Generations, Las Vegas, Nevada, USA.","DOI":"10.1109\/ITNG.2010.12"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/LCOMM.2016.2517017","article-title":"Low-Energy Adaptive Clustering Hierarchy Using Affinity Propagation for Wireless Sensor Networks","volume":"20","author":"Sohn","year":"2016","journal-title":"IEEE Commun. Lett."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1016\/j.patrec.2016.11.017","article-title":"Adjustable preference affinity propagation clustering","volume":"85","author":"Li","year":"2017","journal-title":"Pattern Recognit. Lett."},{"key":"ref_16","first-page":"180","article-title":"Analysis and Improvement of SPFA Algorithm","volume":"41","author":"Xia","year":"2014","journal-title":"Comput. Sci."},{"key":"ref_17","first-page":"217","article-title":"Multi-adjacent-vertexes and Multi-shortest-paths Problem of Dijkstra Algorithm","volume":"41","author":"Wang","year":"2014","journal-title":"Comput. Sci."},{"key":"ref_18","first-page":"41","article-title":"Improved Algorithm about Muti-shortest Path Problem Based on Floyd Algorithm","volume":"5","author":"Z","year":"2017","journal-title":"Comput. Sci."},{"key":"ref_19","first-page":"58","article-title":"An improvement on fixed order Bellman-Ford algorithm","volume":"46","author":"Han","year":"2014","journal-title":"J. Harbin Inst. Technol."}],"container-title":["Sensors"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1424-8220\/19\/13\/2925\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T13:01:46Z","timestamp":1760187706000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1424-8220\/19\/13\/2925"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,2]]},"references-count":19,"journal-issue":{"issue":"13","published-online":{"date-parts":[[2019,7]]}},"alternative-id":["s19132925"],"URL":"https:\/\/doi.org\/10.3390\/s19132925","relation":{},"ISSN":["1424-8220"],"issn-type":[{"type":"electronic","value":"1424-8220"}],"subject":[],"published":{"date-parts":[[2019,7,2]]}}}