WSN Clustering Routing Algorithm based on Adaptive Grasshopper Optimization Algorithm

preprint OA: closed
Full text JSON View at publisher

Abstract

Abstract In order to balance the energy load of wireless sensor networks and prolong the network life cycle, a clustering routing algorithm based on an adaptive grasshopper optimization algorithm was proposed. Firstly, the adaptive grasshopper optimization algorithm is introduced to select the optimal cluster head node set. Secondly, a cluster head replacement mechanism is implemented to dynamically update cluster head nodes and balance energy consumption within the cluster. Finally, the optimal data transmission path is established based on energy, distance, and angle factors during the data transmission stage. The simulation results demonstrate that the proposed algorithm, IGOACR, effectively balances the network energy load and prolongs the network life cycle compared to low-energy adaptive clustering hierarchy (LEACH), LEACH-centralized (LEACH-C), stable energy-efficient clustering protocol (SEECP), and centralized routing algorithm based on gray wolf algorithm(GWO).
Full text 10,558 characters · extracted from preprint-html · click to expand
WSN Clustering Routing Algorithm based on Adaptive Grasshopper Optimization Algorithm | Research Square window.SnipcartSettings = { analytics: { enabled: false } }; (function() { var accessVector = localStorage.getItem('access_vector') || ''; window.dataLayer = window.dataLayer || []; if (accessVector) { window.dataLayer.push({ user: { profile: { profileInfo: { snid: accessVector } } } }); } })(); (function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start':new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0],j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src='https://www.googletagmanager.com/gtm.js?id='+i+dl;f.parentNode.insertBefore(j,f);})(window,document,'script','dataLayer','GTM-K279D39R'); Browse Preprints In Review Journals COVID-19 Preprints AJE Video Bytes Research Tools Research Promotion AJE Professional Editing AJE Rubriq About Preprint Platform In Review Editorial Policies Our Team Advisory Board Help Center Sign In Submit a Preprint Cite Share Download PDF Article WSN Clustering Routing Algorithm based on Adaptive Grasshopper Optimization Algorithm YU Xiuwu, YE Lai, XIAO Lin, Yong LIU This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-6725099/v1 This work is licensed under a CC BY 4.0 License Status: Posted Version 1 posted You are reading this latest preprint version Abstract In order to balance the energy load of wireless sensor networks and prolong the network life cycle, a clustering routing algorithm based on an adaptive grasshopper optimization algorithm was proposed. Firstly, the adaptive grasshopper optimization algorithm is introduced to select the optimal cluster head node set. Secondly, a cluster head replacement mechanism is implemented to dynamically update cluster head nodes and balance energy consumption within the cluster. Finally, the optimal data transmission path is established based on energy, distance, and angle factors during the data transmission stage. The simulation results demonstrate that the proposed algorithm, IGOACR, effectively balances the network energy load and prolongs the network life cycle compared to low-energy adaptive clustering hierarchy (LEACH), LEACH-centralized (LEACH-C), stable energy-efficient clustering protocol (SEECP), and centralized routing algorithm based on gray wolf algorithm(GWO). Physical sciences/Mathematics and computing/Computer science Physical sciences/Mathematics and computing/Information technology wireless sensor network grasshopper optimization algorithm clustering routing cluster head replacement Full Text Additional Declarations No competing interests reported. Supplementary Files S1Date.xlsx Cite Share Download PDF Status: Posted Version 1 posted You are reading this latest preprint version Research Square lets you share your work early, gain feedback from the community, and start making changes to your manuscript prior to peer review in a journal. As a division of Research Square Company, we’re committed to making research communication faster, fairer, and more useful. We do this by developing innovative software and high quality services for the global research community. Our growing team is made up of researchers and industry professionals working together to solve the most critical problems facing scientific publishing. Also discoverable on Platform About Our Team In Review Editorial Policies Advisory Board Help Center Resources Author Services Accessibility API Access RSS feed Manage Cookie Preferences © Research Square 2026 | ISSN 2693-5015 (online) Privacy Policy Terms of Service Do Not Sell My Personal Information {"props":{"pageProps":{"initialData":{"identity":"rs-6725099","acceptedTermsAndConditions":true,"allowDirectSubmit":true,"archivedVersions":[],"articleType":"Article","associatedPublications":[],"authors":[{"id":469852027,"identity":"9dfd0c0a-1c0d-4880-93f4-06fb785ce030","order_by":0,"name":"YU Xiuwu","email":"","orcid":"","institution":"University of South China","correspondingAuthor":false,"prefix":"","firstName":"YU","middleName":"","lastName":"Xiuwu","suffix":""},{"id":469852028,"identity":"0dcd5253-e0b9-4cf2-baf7-3aaa99b58adf","order_by":1,"name":"YE Lai","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAA90lEQVRIiWNgGAWjYDACdsb2338MbHj4mZkPPvhQISEnT1ALM3ODBE9Fmoxke1uy4YwzFsaGDQS1sAO1nDlkY9BzRk2at60ikeEAAR0GhxkbDCTbDvAYSOQwG/POk0hgbGB++OgGAS0Jhm13eMwlcg8+nLtNIo+dgc3YOIeAlgOJbc94LGfkJRu83SZRzNjAwyZNQEtjw8G2wzwGN3LMJHjnSCQ2HCCspZmx4QxQy5kzZpK8DURokTzM2MbMUJHGAwnkYxLGhs0E/MJ3vP0ZM4OBjT0kKmvq5OTZmx8+xqdF4QCGEDMe5SAg30BAwSgYBaNgFIwCBgDq8lBB1oQwUgAAAABJRU5ErkJggg==","orcid":"","institution":"University of South China","correspondingAuthor":true,"prefix":"","firstName":"YE","middleName":"","lastName":"Lai","suffix":""},{"id":469852029,"identity":"f11849a9-eac9-4fa7-b584-9ae446bbceb6","order_by":2,"name":"XIAO Lin","email":"","orcid":"","institution":"University of South China","correspondingAuthor":false,"prefix":"","firstName":"XIAO","middleName":"","lastName":"Lin","suffix":""},{"id":469852030,"identity":"9b1559d9-4c7a-42e3-a2b3-15c9157bc673","order_by":3,"name":"Yong LIU","email":"","orcid":"","institution":"University of South China","correspondingAuthor":false,"prefix":"","firstName":"Yong","middleName":"","lastName":"LIU","suffix":""}],"badges":[],"createdAt":"2025-05-22 12:43:21","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-6725099/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-6725099/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":96253317,"identity":"09c77789-b04c-44c8-8c8d-969db7f5b8df","added_by":"auto","created_at":"2025-11-19 07:42:18","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":755108,"visible":true,"origin":"","legend":"","description":"","filename":"Manuscript.pdf","url":"https://assets-eu.researchsquare.com/files/rs-6725099/v1_covered_c6e4fbc5-e402-4d17-8603-16adfb45089c.pdf"},{"id":84471594,"identity":"c7d826c1-7ceb-494b-a58a-40c36ec5999c","added_by":"auto","created_at":"2025-06-12 10:37:22","extension":"xlsx","order_by":0,"title":"","display":"","copyAsset":false,"role":"supplement","size":148123,"visible":true,"origin":"","legend":"","description":"","filename":"S1Date.xlsx","url":"https://assets-eu.researchsquare.com/files/rs-6725099/v1/7d0867b47295f24c2046532d.xlsx"}],"financialInterests":"No competing interests reported.","formattedTitle":"WSN Clustering Routing Algorithm based on Adaptive Grasshopper Optimization Algorithm","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":false,"hideJournal":true,"highlight":"","institution":"","isAcceptedByJournal":false,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":false,"isPdf":true,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true},"keywords":"wireless sensor network, grasshopper optimization algorithm, clustering routing, cluster head replacement","lastPublishedDoi":"10.21203/rs.3.rs-6725099/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-6725099/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"\u003cp\u003eIn order to balance the energy load of wireless sensor networks and prolong the network life cycle, a clustering routing algorithm based on an adaptive grasshopper optimization algorithm was proposed. Firstly, the adaptive grasshopper optimization algorithm is introduced to select the optimal cluster head node set. Secondly, a cluster head replacement mechanism is implemented to dynamically update cluster head nodes and balance energy consumption within the cluster. Finally, the optimal data transmission path is established based on energy, distance, and angle factors during the data transmission stage. The simulation results demonstrate that the proposed algorithm, IGOACR, effectively balances the network energy load and prolongs the network life cycle compared to low-energy adaptive clustering hierarchy (LEACH), LEACH-centralized (LEACH-C), stable energy-efficient clustering protocol (SEECP), and centralized routing algorithm based on gray wolf algorithm(GWO).\u003c/p\u003e","manuscriptTitle":"WSN Clustering Routing Algorithm based on Adaptive Grasshopper Optimization Algorithm","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2025-06-12 10:29:17","doi":"10.21203/rs.3.rs-6725099/v1","editorialEvents":[{"type":"communityComments","content":0}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true}}],"origin":"","ownerIdentity":"3981b478-f84e-4546-9f06-793acd27d0fb","owner":[],"postedDate":"June 12th, 2025","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"posted","subjectAreas":[{"id":49891764,"name":"Physical sciences/Mathematics and computing/Computer science"},{"id":49891765,"name":"Physical sciences/Mathematics and computing/Information technology"}],"tags":[],"updatedAt":"2025-11-19T01:38:41+00:00","versionOfRecord":[],"versionCreatedAt":"2025-06-12 10:29:17","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-6725099","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-6725099","identity":"rs-6725099","version":["v1"]},"buildId":"8U1c8b4HqxoKbykW_rLl7","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}

Text is read by the "Ask this paper" AI Q&A widget below. Extraction quality varies by source — PMC NXML preserves structure cleanly, OA-HTML may include some navigation residue, and OA-PDF can have broken hyphenation. The publisher copy (via DOI) is the canonical version.

My notes (saved in your browser only)

Ask this paper AI returns verbatim quotes from the full text · source: preprint-html

Answers must be backed by verbatim quotes from this paper's full text. Hallucinated quotes are dropped automatically; if no verbatim passage answers the question, we say so. How this works

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. This is a recent paper (2025) — citers typically take a year or two to land, and the OpenAlex reference graph may still be filling in.

Source provenance

europepmc
last seen: 2026-05-20T01:45:00.602351+00:00