Energy-Saving Algorithm and Simulation of Wireless Sensor Networks Based on Clustering Routing Protocol
An efficient and energy-saving algorithm, K-means and FAH (KAF), has been proposed to solve the problems of node energy constraints, short network cycle and low throughput in current wireless sensor networks. Network clustering is obtained by optimizing K-means clustering. Based on FAHP (Fuzzy Analy...
Gespeichert in:
| Veröffentlicht in: | IEEE access 2019, Vol.7, p.172505-172514 |
|---|---|
| 1. Verfasser: | |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 172514 |
|---|---|
| container_issue | |
| container_start_page | 172505 |
| container_title | IEEE access |
| container_volume | 7 |
| creator | He, Wei |
| description | An efficient and energy-saving algorithm, K-means and FAH (KAF), has been proposed to solve the problems of node energy constraints, short network cycle and low throughput in current wireless sensor networks. Network clustering is obtained by optimizing K-means clustering. Based on FAHP (Fuzzy Analytic Hierarchy Process) method, the cluster head selection is optimized considering the factors of node energy, distance from base station and energy efficiency of nodes. Based on the factors of transmission distance, energy and hop number, multi-hop routing is constructed to effectively reduce the energy consumption of nodes in data transmission. The simulation results show that compared with other protocols, KAF algorithm has obvious advantages in reducing node energy consumption, prolonging network life cycle and increasing network throughput. And under different routing protocol, the performances of the algorithm are verified. By adjusting the size of the candidate node set selection area, the reliability of data transmission of the long-distance node is increased, and the energy consumption load of the near-distance node is reduced. At the same time, the use of opportunistic transmission strategies increases the reliability of data transmission. The simulation results show that the proposed protocol can effectively reduce the energy consumption of nodes and prolong the network life cycle. |
| doi_str_mv | 10.1109/ACCESS.2019.2956068 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2455632634</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>8913514</ieee_id><doaj_id>oai_doaj_org_article_f2cb23daa3a649dc87abffc4f20b0e1c</doaj_id><sourcerecordid>2455632634</sourcerecordid><originalsourceid>FETCH-LOGICAL-c408t-b54d1dd8aeb42187a12e0b48f8189e143adebc4567bb0487cdfbf018d81f44e93</originalsourceid><addsrcrecordid>eNpNUUtv1DAQjioqUbX9Bb1Y4pzFr2Sd4xItUKmiqAFxtPwYp16ycbEdUP89XlJVzGVGo-8xo6-qbgjeEIK797u-3w_DhmLSbWjXtLgVZ9UFJW1Xs4a1b_6b31bXKR1wKVFWzfaiGvczxPG5HtRvP49oN40h-vx4RGq2aPDHZVLZhxkFh374CBOkhAaYU4joC-Q_If5M6INKYFEB9dOSMsST0ENY8ql_jSEHE6ar6typKcH1S7-svn_cf-s_13f3n2773V1tOBa51g23xFqhQHNKxFYRClhz4QQRHRDOlAVteNNutcZcbI112mEirCCOc-jYZXW76tqgDvIp-qOKzzIoL_8tQhylitmbCaSjRlNmlWKq5Z01xU07Z7ijWGMgpmi9W7WeYvi1QMryEJY4l_Ml5U3TMtoyXlBsRZkYUorgXl0JlqeA5BqQPAUkXwIqrJuV5QHglSE6wpry5V80Io5Q</addsrcrecordid><sourcetype>Open Website</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2455632634</pqid></control><display><type>article</type><title>Energy-Saving Algorithm and Simulation of Wireless Sensor Networks Based on Clustering Routing Protocol</title><source>IEEE Open Access Journals</source><source>DOAJ Directory of Open Access Journals</source><source>Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals</source><creator>He, Wei</creator><creatorcontrib>He, Wei</creatorcontrib><description>An efficient and energy-saving algorithm, K-means and FAH (KAF), has been proposed to solve the problems of node energy constraints, short network cycle and low throughput in current wireless sensor networks. Network clustering is obtained by optimizing K-means clustering. Based on FAHP (Fuzzy Analytic Hierarchy Process) method, the cluster head selection is optimized considering the factors of node energy, distance from base station and energy efficiency of nodes. Based on the factors of transmission distance, energy and hop number, multi-hop routing is constructed to effectively reduce the energy consumption of nodes in data transmission. The simulation results show that compared with other protocols, KAF algorithm has obvious advantages in reducing node energy consumption, prolonging network life cycle and increasing network throughput. And under different routing protocol, the performances of the algorithm are verified. By adjusting the size of the candidate node set selection area, the reliability of data transmission of the long-distance node is increased, and the energy consumption load of the near-distance node is reduced. At the same time, the use of opportunistic transmission strategies increases the reliability of data transmission. The simulation results show that the proposed protocol can effectively reduce the energy consumption of nodes and prolong the network life cycle.</description><identifier>ISSN: 2169-3536</identifier><identifier>EISSN: 2169-3536</identifier><identifier>DOI: 10.1109/ACCESS.2019.2956068</identifier><identifier>CODEN: IAECCG</identifier><language>eng</language><publisher>Piscataway: IEEE</publisher><subject>Algorithms ; Analytic hierarchy process ; Base stations ; Cluster analysis ; Clustering ; Clustering algorithms ; Data communication ; Data transmission ; Energy consumption ; energy-saving ; K-means clustering ; multi-hop routing ; Nodes ; Protocol (computers) ; Reliability ; Routing ; Routing protocols ; Simulation ; Vector quantization ; Wireless networks ; Wireless sensor networks</subject><ispartof>IEEE access, 2019, Vol.7, p.172505-172514</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2019</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c408t-b54d1dd8aeb42187a12e0b48f8189e143adebc4567bb0487cdfbf018d81f44e93</citedby><cites>FETCH-LOGICAL-c408t-b54d1dd8aeb42187a12e0b48f8189e143adebc4567bb0487cdfbf018d81f44e93</cites><orcidid>0000-0002-0362-7111</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/8913514$$EHTML$$P50$$Gieee$$Hfree_for_read</linktohtml><link.rule.ids>314,776,780,860,2096,4010,27610,27900,27901,27902,54908</link.rule.ids></links><search><creatorcontrib>He, Wei</creatorcontrib><title>Energy-Saving Algorithm and Simulation of Wireless Sensor Networks Based on Clustering Routing Protocol</title><title>IEEE access</title><addtitle>Access</addtitle><description>An efficient and energy-saving algorithm, K-means and FAH (KAF), has been proposed to solve the problems of node energy constraints, short network cycle and low throughput in current wireless sensor networks. Network clustering is obtained by optimizing K-means clustering. Based on FAHP (Fuzzy Analytic Hierarchy Process) method, the cluster head selection is optimized considering the factors of node energy, distance from base station and energy efficiency of nodes. Based on the factors of transmission distance, energy and hop number, multi-hop routing is constructed to effectively reduce the energy consumption of nodes in data transmission. The simulation results show that compared with other protocols, KAF algorithm has obvious advantages in reducing node energy consumption, prolonging network life cycle and increasing network throughput. And under different routing protocol, the performances of the algorithm are verified. By adjusting the size of the candidate node set selection area, the reliability of data transmission of the long-distance node is increased, and the energy consumption load of the near-distance node is reduced. At the same time, the use of opportunistic transmission strategies increases the reliability of data transmission. The simulation results show that the proposed protocol can effectively reduce the energy consumption of nodes and prolong the network life cycle.</description><subject>Algorithms</subject><subject>Analytic hierarchy process</subject><subject>Base stations</subject><subject>Cluster analysis</subject><subject>Clustering</subject><subject>Clustering algorithms</subject><subject>Data communication</subject><subject>Data transmission</subject><subject>Energy consumption</subject><subject>energy-saving</subject><subject>K-means clustering</subject><subject>multi-hop routing</subject><subject>Nodes</subject><subject>Protocol (computers)</subject><subject>Reliability</subject><subject>Routing</subject><subject>Routing protocols</subject><subject>Simulation</subject><subject>Vector quantization</subject><subject>Wireless networks</subject><subject>Wireless sensor networks</subject><issn>2169-3536</issn><issn>2169-3536</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2019</creationdate><recordtype>article</recordtype><sourceid>ESBDL</sourceid><sourceid>RIE</sourceid><sourceid>DOA</sourceid><recordid>eNpNUUtv1DAQjioqUbX9Bb1Y4pzFr2Sd4xItUKmiqAFxtPwYp16ycbEdUP89XlJVzGVGo-8xo6-qbgjeEIK797u-3w_DhmLSbWjXtLgVZ9UFJW1Xs4a1b_6b31bXKR1wKVFWzfaiGvczxPG5HtRvP49oN40h-vx4RGq2aPDHZVLZhxkFh374CBOkhAaYU4joC-Q_If5M6INKYFEB9dOSMsST0ENY8ql_jSEHE6ar6typKcH1S7-svn_cf-s_13f3n2773V1tOBa51g23xFqhQHNKxFYRClhz4QQRHRDOlAVteNNutcZcbI112mEirCCOc-jYZXW76tqgDvIp-qOKzzIoL_8tQhylitmbCaSjRlNmlWKq5Z01xU07Z7ijWGMgpmi9W7WeYvi1QMryEJY4l_Ml5U3TMtoyXlBsRZkYUorgXl0JlqeA5BqQPAUkXwIqrJuV5QHglSE6wpry5V80Io5Q</recordid><startdate>2019</startdate><enddate>2019</enddate><creator>He, Wei</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>ESBDL</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>7SR</scope><scope>8BQ</scope><scope>8FD</scope><scope>JG9</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>DOA</scope><orcidid>https://orcid.org/0000-0002-0362-7111</orcidid></search><sort><creationdate>2019</creationdate><title>Energy-Saving Algorithm and Simulation of Wireless Sensor Networks Based on Clustering Routing Protocol</title><author>He, Wei</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c408t-b54d1dd8aeb42187a12e0b48f8189e143adebc4567bb0487cdfbf018d81f44e93</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2019</creationdate><topic>Algorithms</topic><topic>Analytic hierarchy process</topic><topic>Base stations</topic><topic>Cluster analysis</topic><topic>Clustering</topic><topic>Clustering algorithms</topic><topic>Data communication</topic><topic>Data transmission</topic><topic>Energy consumption</topic><topic>energy-saving</topic><topic>K-means clustering</topic><topic>multi-hop routing</topic><topic>Nodes</topic><topic>Protocol (computers)</topic><topic>Reliability</topic><topic>Routing</topic><topic>Routing protocols</topic><topic>Simulation</topic><topic>Vector quantization</topic><topic>Wireless networks</topic><topic>Wireless sensor networks</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>He, Wei</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE Open Access Journals</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Engineered Materials Abstracts</collection><collection>METADEX</collection><collection>Technology Research Database</collection><collection>Materials Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>DOAJ Directory of Open Access Journals</collection><jtitle>IEEE access</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>He, Wei</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Energy-Saving Algorithm and Simulation of Wireless Sensor Networks Based on Clustering Routing Protocol</atitle><jtitle>IEEE access</jtitle><stitle>Access</stitle><date>2019</date><risdate>2019</risdate><volume>7</volume><spage>172505</spage><epage>172514</epage><pages>172505-172514</pages><issn>2169-3536</issn><eissn>2169-3536</eissn><coden>IAECCG</coden><abstract>An efficient and energy-saving algorithm, K-means and FAH (KAF), has been proposed to solve the problems of node energy constraints, short network cycle and low throughput in current wireless sensor networks. Network clustering is obtained by optimizing K-means clustering. Based on FAHP (Fuzzy Analytic Hierarchy Process) method, the cluster head selection is optimized considering the factors of node energy, distance from base station and energy efficiency of nodes. Based on the factors of transmission distance, energy and hop number, multi-hop routing is constructed to effectively reduce the energy consumption of nodes in data transmission. The simulation results show that compared with other protocols, KAF algorithm has obvious advantages in reducing node energy consumption, prolonging network life cycle and increasing network throughput. And under different routing protocol, the performances of the algorithm are verified. By adjusting the size of the candidate node set selection area, the reliability of data transmission of the long-distance node is increased, and the energy consumption load of the near-distance node is reduced. At the same time, the use of opportunistic transmission strategies increases the reliability of data transmission. The simulation results show that the proposed protocol can effectively reduce the energy consumption of nodes and prolong the network life cycle.</abstract><cop>Piscataway</cop><pub>IEEE</pub><doi>10.1109/ACCESS.2019.2956068</doi><tpages>10</tpages><orcidid>https://orcid.org/0000-0002-0362-7111</orcidid><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 2169-3536 |
| ispartof | IEEE access, 2019, Vol.7, p.172505-172514 |
| issn | 2169-3536 2169-3536 |
| language | eng |
| recordid | cdi_proquest_journals_2455632634 |
| source | IEEE Open Access Journals; DOAJ Directory of Open Access Journals; Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals |
| subjects | Algorithms Analytic hierarchy process Base stations Cluster analysis Clustering Clustering algorithms Data communication Data transmission Energy consumption energy-saving K-means clustering multi-hop routing Nodes Protocol (computers) Reliability Routing Routing protocols Simulation Vector quantization Wireless networks Wireless sensor networks |
| title | Energy-Saving Algorithm and Simulation of Wireless Sensor Networks Based on Clustering Routing Protocol |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-11T01%3A58%3A18IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Energy-Saving%20Algorithm%20and%20Simulation%20of%20Wireless%20Sensor%20Networks%20Based%20on%20Clustering%20Routing%20Protocol&rft.jtitle=IEEE%20access&rft.au=He,%20Wei&rft.date=2019&rft.volume=7&rft.spage=172505&rft.epage=172514&rft.pages=172505-172514&rft.issn=2169-3536&rft.eissn=2169-3536&rft.coden=IAECCG&rft_id=info:doi/10.1109/ACCESS.2019.2956068&rft_dat=%3Cproquest_cross%3E2455632634%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2455632634&rft_id=info:pmid/&rft_ieee_id=8913514&rft_doaj_id=oai_doaj_org_article_f2cb23daa3a649dc87abffc4f20b0e1c&rfr_iscdi=true |