Energy efficient clustering routing algorithm based on improved FCM

preprint OA: closed CC-BY-4.0
📄 Open PDF Full text JSON View at publisher

Abstract

Abstract Wireless sensor networks (WSNs) play a crucial role in the Internet of Things (IoT). The sensor nodes(SNs) in WSNs are powered by batteries, making energy efficiency and network lifetime key issues in WSNs research. Cluster-routing algorithms are a focal point for addressing energy efficiency challenges. Selecting cluster heads (CHs) based on clustering algorithms can reduce the energy consumption of SNs and enhance overall network stability and sustainability. This paper introduces a method for selecting the number of clusters (\({N_C}\)) and CHs based on fuzzy clustering. The fuzzy C-means (FCM) clustering algorithm requires pre-setting the number of clusters, with no inclusion of CHs information in the output after running the algorithm. The number of clusters and selection of CHs were determined using the elbow rule and scoring criteria for CHs selection. The performance of the network under different monitoring areas is simulated and analyzed in this paper. Experiments demonstrate that the proposed algorithm outperforms existing algorithms in terms of network energy consumption and lifetime.
Full text 11,575 characters · extracted from preprint-html · click to expand
Energy efficient clustering routing algorithm based on improved FCM | 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 Research Article Energy efficient clustering routing algorithm based on improved FCM Qian Sun, Xiangyue Meng, Zhiyao Zhao, Jiping Xu, Huiyan Zhang, and 3 more This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-4452725/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 Wireless sensor networks (WSNs) play a crucial role in the Internet of Things (IoT). The sensor nodes(SNs) in WSNs are powered by batteries, making energy efficiency and network lifetime key issues in WSNs research. Cluster-routing algorithms are a focal point for addressing energy efficiency challenges. Selecting cluster heads (CHs) based on clustering algorithms can reduce the energy consumption of SNs and enhance overall network stability and sustainability. This paper introduces a method for selecting the number of clusters ( \({N_C}\) ) and CHs based on fuzzy clustering. The fuzzy C-means (FCM) clustering algorithm requires pre-setting the number of clusters, with no inclusion of CHs information in the output after running the algorithm. The number of clusters and selection of CHs were determined using the elbow rule and scoring criteria for CHs selection. The performance of the network under different monitoring areas is simulated and analyzed in this paper. Experiments demonstrate that the proposed algorithm outperforms existing algorithms in terms of network energy consumption and lifetime. Wireless sensor networks Cluster head election FCM Clustering routing elbow method Full Text Additional Declarations No competing interests reported. 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-4452725","acceptedTermsAndConditions":true,"allowDirectSubmit":true,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":305186739,"identity":"8026f1e5-8c1c-45f5-8d5b-e7e5b3093950","order_by":0,"name":"Qian Sun","email":"","orcid":"","institution":"Beijing Technology and Business University","correspondingAuthor":false,"submittingAuthor":false,"prefix":"","firstName":"Qian","middleName":"","lastName":"Sun","suffix":""},{"id":305186740,"identity":"bac45c4f-1676-48d1-8b2f-9aae6c7e7e3e","order_by":1,"name":"Xiangyue Meng","email":"","orcid":"","institution":"Beijing Technology and Business University","correspondingAuthor":false,"submittingAuthor":false,"prefix":"","firstName":"Xiangyue","middleName":"","lastName":"Meng","suffix":""},{"id":305186741,"identity":"e600b95a-ab9a-4055-8aae-4fbe85e08de2","order_by":2,"name":"Zhiyao Zhao","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAAzElEQVRIiWNgGAWjYDACCTBpkwBhsBGvJS2Bh1Qth0nQIj+7+eHDn23n8+ylewwYPpQdZuCf3YBfC+OcY8YGkm23i3lkzhgwzjh3mEHizgH8WpglEswkDNtuJ/ZI5Bgw87YdZjCQSMCvhU0i/ZtEYts5iJa/xGjhkcgxkzjYdgCihZEYLRISOcWGDeeSi3nuHCs42HMunUfiBgEt8jPSNz78UWaXxz67eeODH2XWcvwzCGgBA0ZodBwAuZQI9SDwh0h1o2AUjIJRMDIBANkkP+ikPOhsAAAAAElFTkSuQmCC","orcid":"","institution":"Beijing Technology and Business University","correspondingAuthor":true,"submittingAuthor":false,"prefix":"","firstName":"Zhiyao","middleName":"","lastName":"Zhao","suffix":""},{"id":305186742,"identity":"4286e57e-ec71-4ca3-9a31-0ee70b56f47b","order_by":3,"name":"Jiping Xu","email":"","orcid":"","institution":"Beijing Technology and Business University","correspondingAuthor":false,"submittingAuthor":false,"prefix":"","firstName":"Jiping","middleName":"","lastName":"Xu","suffix":""},{"id":305186743,"identity":"b5ec6d00-7ca9-483a-8749-c869ea003b72","order_by":4,"name":"Huiyan Zhang","email":"","orcid":"","institution":"Beijing Technology and Business University","correspondingAuthor":false,"submittingAuthor":false,"prefix":"","firstName":"Huiyan","middleName":"","lastName":"Zhang","suffix":""},{"id":305186744,"identity":"12348113-1514-4769-a98c-bea8e0cdc9aa","order_by":5,"name":"Li Wang","email":"","orcid":"","institution":"Beijing Technology and Business University","correspondingAuthor":false,"submittingAuthor":false,"prefix":"","firstName":"Li","middleName":"","lastName":"Wang","suffix":""},{"id":305186745,"identity":"885dafe3-375f-4910-8a70-75258e7be9c4","order_by":6,"name":"Jiabin Yu","email":"","orcid":"","institution":"Beijing Technology and Business University","correspondingAuthor":false,"submittingAuthor":false,"prefix":"","firstName":"Jiabin","middleName":"","lastName":"Yu","suffix":""},{"id":305186746,"identity":"eae288f3-0ed4-4b86-af29-2f1d68561bfa","order_by":7,"name":"Guoxin Liu","email":"","orcid":"","institution":"Beijing Technology and Business University","correspondingAuthor":false,"submittingAuthor":false,"prefix":"","firstName":"Guoxin","middleName":"","lastName":"Liu","suffix":""}],"badges":[],"createdAt":"2024-05-21 06:54:40","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-4452725/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-4452725/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":66304697,"identity":"6b532ee7-7dfb-46e2-b561-cf4b259e075e","added_by":"auto","created_at":"2024-10-10 07:17:30","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":1267721,"visible":true,"origin":"","legend":"","description":"","filename":"EnergyefficientclusteringroutingalgorithmbasedonimprovedFCM.pdf","url":"https://assets-eu.researchsquare.com/files/rs-4452725/v1_covered_1cedd3bd-832f-420d-8f03-7621055effc2.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"Energy efficient clustering routing algorithm based on improved FCM","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 networks, Cluster head election, FCM, Clustering routing, elbow method","lastPublishedDoi":"10.21203/rs.3.rs-4452725/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-4452725/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"\u003cp\u003eWireless sensor networks (WSNs) play a crucial role in the Internet of Things (IoT). The sensor nodes(SNs) in WSNs are powered by batteries, making energy efficiency and network lifetime key issues in WSNs research. Cluster-routing algorithms are a focal point for addressing energy efficiency challenges. Selecting cluster heads (CHs) based on clustering algorithms can reduce the energy consumption of SNs and enhance overall network stability and sustainability. This paper introduces a method for selecting the number of clusters (\u003cspan class=\"InlineEquation\"\u003e\u003cspan class=\"mathinline\"\u003e\\({N_C}\\)\u003c/span\u003e\u003c/span\u003e) and CHs based on fuzzy clustering. The fuzzy C-means (FCM) clustering algorithm requires pre-setting the number of clusters, with no inclusion of CHs information in the output after running the algorithm. The number of clusters and selection of CHs were determined using the elbow rule and scoring criteria for CHs selection. The performance of the network under different monitoring areas is simulated and analyzed in this paper. Experiments demonstrate that the proposed algorithm outperforms existing algorithms in terms of network energy consumption and lifetime.\u003c/p\u003e","manuscriptTitle":"Energy efficient clustering routing algorithm based on improved FCM","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2024-06-03 02:38:42","doi":"10.21203/rs.3.rs-4452725/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":"0b2e7257-cff5-4a31-86c7-d955dda796f0","owner":[],"postedDate":"June 3rd, 2024","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"posted","subjectAreas":[],"tags":[],"updatedAt":"2024-10-10T07:09:19+00:00","versionOfRecord":[],"versionCreatedAt":"2024-06-03 02:38:42","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-4452725","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-4452725","identity":"rs-4452725","version":["v1"]},"buildId":"7rjqhiLT3MXkJMwkYKINL","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 (2024) — 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
unpaywall
last seen: 2026-05-27T02:00:06.600101+00:00
License: CC-BY-4.0