WSN Routing Protocol Using a Multiobjective Greedy Approach

Due to the widespread use of communication networks and the ease of transmitting and gathering information through these networks, wireless sensor networks (WSN) have become increasingly popular. Usability in any environment without the need for environmental monitoring and engineering of these netw...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Wireless communications and mobile computing 2021, Vol.2021 (1)
Hauptverfasser: Nabavi, Seyed Reza, Eraghi, Nafiseh Osati, Torkestani, Javad Akbari
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue 1
container_start_page
container_title Wireless communications and mobile computing
container_volume 2021
creator Nabavi, Seyed Reza
Eraghi, Nafiseh Osati
Torkestani, Javad Akbari
description Due to the widespread use of communication networks and the ease of transmitting and gathering information through these networks, wireless sensor networks (WSN) have become increasingly popular. Usability in any environment without the need for environmental monitoring and engineering of these networks has led to their increasing usage in various fields. Routing information from the sensor node to sink, so that node energy is consumed uniformly and network life is not reduced, is one of the most important challenges in wireless sensor networks. Most wireless networks have no infrastructure, and embedded sensor nodes have limited power. Thus, the early termination of the wireless node’s energy based on the transmission of messages over the network can disrupt the entire network process. In this paper, the object is designed to find the optimal path in WSN based on the multiobjective greedy approach to the near optimal path. The proposed model is presented in this method to transfer sensed data of the sensor network to the base station for the desired applications. In this method, the sensor nodes are identified as adjacent nodes based on their distance. The energy of all nodes initially is approximately equal, which decreases with the transfer of information between the nodes. In this way, when a node senses a message, it checks several factors for transmitting information to its adjacent nodes and selects the node with the largest amount of factors as the next hop. The simulation results show that the energy consumption in the network grids is almost symmetrically presented, and the network lifetime is reduced with a gentle slope that provides optimum energy consumption in the networks. Also, the packet transmission delay in the network reaches 450 milliseconds for the transmission of information between 15 nodes and 650 connections. Besides, network throughput increases by approximately 97%. It also shows better performance compared to other previous methods in terms of evaluation criteria.
doi_str_mv 10.1155/2021/6664669
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2518013852</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2518013852</sourcerecordid><originalsourceid>FETCH-LOGICAL-c337t-88cf6e1a5ac42a04f2099342d71e11a6014fc1f2b30dfdeb1e5db36c349c724c3</originalsourceid><addsrcrecordid>eNp90E1Lw0AQBuBFFKzVmz8g4FFjd_YrCZ5KqVWoH6jF47LZ7NqEmq27idJ_b0KKR08zAw_zwovQOeBrAM4nBBOYCCGYENkBGgGnOE5Fkhz-7SI7RichVBhj2uERunl_fYxeXNuU9Uf07F3jtNtEq9CfKnpoN03p8sropvw20cIbU-yi6XbrndLrU3Rk1SaYs_0co9Xt_G12Fy-fFvez6TLWlCZNnKbaCgOKK82IwswSnGWUkSIBA6AEBmY1WJJTXNjC5GB4kVOhKct0QpimY3Qx_O1iv1oTGlm51tddpCQcUgw05aRTV4PS3oXgjZVbX34qv5OAZV-P7OuR-3o6fjnwdVkX6qf8X_8CUBtjFg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2518013852</pqid></control><display><type>article</type><title>WSN Routing Protocol Using a Multiobjective Greedy Approach</title><source>Wiley Online Library Open Access</source><source>EZB-FREE-00999 freely available EZB journals</source><source>Alma/SFX Local Collection</source><creator>Nabavi, Seyed Reza ; Eraghi, Nafiseh Osati ; Torkestani, Javad Akbari</creator><contributor>Shankar, K. ; K Shankar</contributor><creatorcontrib>Nabavi, Seyed Reza ; Eraghi, Nafiseh Osati ; Torkestani, Javad Akbari ; Shankar, K. ; K Shankar</creatorcontrib><description>Due to the widespread use of communication networks and the ease of transmitting and gathering information through these networks, wireless sensor networks (WSN) have become increasingly popular. Usability in any environment without the need for environmental monitoring and engineering of these networks has led to their increasing usage in various fields. Routing information from the sensor node to sink, so that node energy is consumed uniformly and network life is not reduced, is one of the most important challenges in wireless sensor networks. Most wireless networks have no infrastructure, and embedded sensor nodes have limited power. Thus, the early termination of the wireless node’s energy based on the transmission of messages over the network can disrupt the entire network process. In this paper, the object is designed to find the optimal path in WSN based on the multiobjective greedy approach to the near optimal path. The proposed model is presented in this method to transfer sensed data of the sensor network to the base station for the desired applications. In this method, the sensor nodes are identified as adjacent nodes based on their distance. The energy of all nodes initially is approximately equal, which decreases with the transfer of information between the nodes. In this way, when a node senses a message, it checks several factors for transmitting information to its adjacent nodes and selects the node with the largest amount of factors as the next hop. The simulation results show that the energy consumption in the network grids is almost symmetrically presented, and the network lifetime is reduced with a gentle slope that provides optimum energy consumption in the networks. Also, the packet transmission delay in the network reaches 450 milliseconds for the transmission of information between 15 nodes and 650 connections. Besides, network throughput increases by approximately 97%. It also shows better performance compared to other previous methods in terms of evaluation criteria.</description><identifier>ISSN: 1530-8669</identifier><identifier>EISSN: 1530-8677</identifier><identifier>DOI: 10.1155/2021/6664669</identifier><language>eng</language><publisher>Oxford: Hindawi</publisher><subject>Clustering ; Communication ; Communication networks ; Data transmission ; Embedded sensors ; Energy consumption ; Environmental monitoring ; Genetic algorithms ; Multiple objective analysis ; Nodes ; Optimization ; Packet transmission ; Radio equipment ; Routing (telecommunications) ; Sensors ; Wireless networks ; Wireless sensor networks</subject><ispartof>Wireless communications and mobile computing, 2021, Vol.2021 (1)</ispartof><rights>Copyright © 2021 Seyed Reza Nabavi et al.</rights><rights>Copyright © 2021 Seyed Reza Nabavi et al. This work is licensed under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c337t-88cf6e1a5ac42a04f2099342d71e11a6014fc1f2b30dfdeb1e5db36c349c724c3</citedby><cites>FETCH-LOGICAL-c337t-88cf6e1a5ac42a04f2099342d71e11a6014fc1f2b30dfdeb1e5db36c349c724c3</cites><orcidid>0000-0002-6830-7290 ; 0000-0002-3824-7813 ; 0000-0003-2821-0715</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,4024,27923,27924,27925</link.rule.ids></links><search><contributor>Shankar, K.</contributor><contributor>K Shankar</contributor><creatorcontrib>Nabavi, Seyed Reza</creatorcontrib><creatorcontrib>Eraghi, Nafiseh Osati</creatorcontrib><creatorcontrib>Torkestani, Javad Akbari</creatorcontrib><title>WSN Routing Protocol Using a Multiobjective Greedy Approach</title><title>Wireless communications and mobile computing</title><description>Due to the widespread use of communication networks and the ease of transmitting and gathering information through these networks, wireless sensor networks (WSN) have become increasingly popular. Usability in any environment without the need for environmental monitoring and engineering of these networks has led to their increasing usage in various fields. Routing information from the sensor node to sink, so that node energy is consumed uniformly and network life is not reduced, is one of the most important challenges in wireless sensor networks. Most wireless networks have no infrastructure, and embedded sensor nodes have limited power. Thus, the early termination of the wireless node’s energy based on the transmission of messages over the network can disrupt the entire network process. In this paper, the object is designed to find the optimal path in WSN based on the multiobjective greedy approach to the near optimal path. The proposed model is presented in this method to transfer sensed data of the sensor network to the base station for the desired applications. In this method, the sensor nodes are identified as adjacent nodes based on their distance. The energy of all nodes initially is approximately equal, which decreases with the transfer of information between the nodes. In this way, when a node senses a message, it checks several factors for transmitting information to its adjacent nodes and selects the node with the largest amount of factors as the next hop. The simulation results show that the energy consumption in the network grids is almost symmetrically presented, and the network lifetime is reduced with a gentle slope that provides optimum energy consumption in the networks. Also, the packet transmission delay in the network reaches 450 milliseconds for the transmission of information between 15 nodes and 650 connections. Besides, network throughput increases by approximately 97%. It also shows better performance compared to other previous methods in terms of evaluation criteria.</description><subject>Clustering</subject><subject>Communication</subject><subject>Communication networks</subject><subject>Data transmission</subject><subject>Embedded sensors</subject><subject>Energy consumption</subject><subject>Environmental monitoring</subject><subject>Genetic algorithms</subject><subject>Multiple objective analysis</subject><subject>Nodes</subject><subject>Optimization</subject><subject>Packet transmission</subject><subject>Radio equipment</subject><subject>Routing (telecommunications)</subject><subject>Sensors</subject><subject>Wireless networks</subject><subject>Wireless sensor networks</subject><issn>1530-8669</issn><issn>1530-8677</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2021</creationdate><recordtype>article</recordtype><sourceid>RHX</sourceid><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><recordid>eNp90E1Lw0AQBuBFFKzVmz8g4FFjd_YrCZ5KqVWoH6jF47LZ7NqEmq27idJ_b0KKR08zAw_zwovQOeBrAM4nBBOYCCGYENkBGgGnOE5Fkhz-7SI7RichVBhj2uERunl_fYxeXNuU9Uf07F3jtNtEq9CfKnpoN03p8sropvw20cIbU-yi6XbrndLrU3Rk1SaYs_0co9Xt_G12Fy-fFvez6TLWlCZNnKbaCgOKK82IwswSnGWUkSIBA6AEBmY1WJJTXNjC5GB4kVOhKct0QpimY3Qx_O1iv1oTGlm51tddpCQcUgw05aRTV4PS3oXgjZVbX34qv5OAZV-P7OuR-3o6fjnwdVkX6qf8X_8CUBtjFg</recordid><startdate>2021</startdate><enddate>2021</enddate><creator>Nabavi, Seyed Reza</creator><creator>Eraghi, Nafiseh Osati</creator><creator>Torkestani, Javad Akbari</creator><general>Hindawi</general><general>Hindawi Limited</general><scope>RHU</scope><scope>RHW</scope><scope>RHX</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>7XB</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0N</scope><scope>P5Z</scope><scope>P62</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>Q9U</scope><orcidid>https://orcid.org/0000-0002-6830-7290</orcidid><orcidid>https://orcid.org/0000-0002-3824-7813</orcidid><orcidid>https://orcid.org/0000-0003-2821-0715</orcidid></search><sort><creationdate>2021</creationdate><title>WSN Routing Protocol Using a Multiobjective Greedy Approach</title><author>Nabavi, Seyed Reza ; Eraghi, Nafiseh Osati ; Torkestani, Javad Akbari</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c337t-88cf6e1a5ac42a04f2099342d71e11a6014fc1f2b30dfdeb1e5db36c349c724c3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2021</creationdate><topic>Clustering</topic><topic>Communication</topic><topic>Communication networks</topic><topic>Data transmission</topic><topic>Embedded sensors</topic><topic>Energy consumption</topic><topic>Environmental monitoring</topic><topic>Genetic algorithms</topic><topic>Multiple objective analysis</topic><topic>Nodes</topic><topic>Optimization</topic><topic>Packet transmission</topic><topic>Radio equipment</topic><topic>Routing (telecommunications)</topic><topic>Sensors</topic><topic>Wireless networks</topic><topic>Wireless sensor networks</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Nabavi, Seyed Reza</creatorcontrib><creatorcontrib>Eraghi, Nafiseh Osati</creatorcontrib><creatorcontrib>Torkestani, Javad Akbari</creatorcontrib><collection>Hindawi Publishing Complete</collection><collection>Hindawi Publishing Subscription Journals</collection><collection>Hindawi Publishing Open Access Journals</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics &amp; Communications Abstracts</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</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>Computing Database</collection><collection>Advanced Technologies &amp; Aerospace Database</collection><collection>ProQuest Advanced Technologies &amp; Aerospace Collection</collection><collection>Access via ProQuest (Open Access)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>ProQuest Central Basic</collection><jtitle>Wireless communications and mobile computing</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Nabavi, Seyed Reza</au><au>Eraghi, Nafiseh Osati</au><au>Torkestani, Javad Akbari</au><au>Shankar, K.</au><au>K Shankar</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>WSN Routing Protocol Using a Multiobjective Greedy Approach</atitle><jtitle>Wireless communications and mobile computing</jtitle><date>2021</date><risdate>2021</risdate><volume>2021</volume><issue>1</issue><issn>1530-8669</issn><eissn>1530-8677</eissn><abstract>Due to the widespread use of communication networks and the ease of transmitting and gathering information through these networks, wireless sensor networks (WSN) have become increasingly popular. Usability in any environment without the need for environmental monitoring and engineering of these networks has led to their increasing usage in various fields. Routing information from the sensor node to sink, so that node energy is consumed uniformly and network life is not reduced, is one of the most important challenges in wireless sensor networks. Most wireless networks have no infrastructure, and embedded sensor nodes have limited power. Thus, the early termination of the wireless node’s energy based on the transmission of messages over the network can disrupt the entire network process. In this paper, the object is designed to find the optimal path in WSN based on the multiobjective greedy approach to the near optimal path. The proposed model is presented in this method to transfer sensed data of the sensor network to the base station for the desired applications. In this method, the sensor nodes are identified as adjacent nodes based on their distance. The energy of all nodes initially is approximately equal, which decreases with the transfer of information between the nodes. In this way, when a node senses a message, it checks several factors for transmitting information to its adjacent nodes and selects the node with the largest amount of factors as the next hop. The simulation results show that the energy consumption in the network grids is almost symmetrically presented, and the network lifetime is reduced with a gentle slope that provides optimum energy consumption in the networks. Also, the packet transmission delay in the network reaches 450 milliseconds for the transmission of information between 15 nodes and 650 connections. Besides, network throughput increases by approximately 97%. It also shows better performance compared to other previous methods in terms of evaluation criteria.</abstract><cop>Oxford</cop><pub>Hindawi</pub><doi>10.1155/2021/6664669</doi><orcidid>https://orcid.org/0000-0002-6830-7290</orcidid><orcidid>https://orcid.org/0000-0002-3824-7813</orcidid><orcidid>https://orcid.org/0000-0003-2821-0715</orcidid><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 1530-8669
ispartof Wireless communications and mobile computing, 2021, Vol.2021 (1)
issn 1530-8669
1530-8677
language eng
recordid cdi_proquest_journals_2518013852
source Wiley Online Library Open Access; EZB-FREE-00999 freely available EZB journals; Alma/SFX Local Collection
subjects Clustering
Communication
Communication networks
Data transmission
Embedded sensors
Energy consumption
Environmental monitoring
Genetic algorithms
Multiple objective analysis
Nodes
Optimization
Packet transmission
Radio equipment
Routing (telecommunications)
Sensors
Wireless networks
Wireless sensor networks
title WSN Routing Protocol Using a Multiobjective Greedy Approach
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-02T09%3A10%3A08IST&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=WSN%20Routing%20Protocol%20Using%20a%20Multiobjective%20Greedy%20Approach&rft.jtitle=Wireless%20communications%20and%20mobile%20computing&rft.au=Nabavi,%20Seyed%20Reza&rft.date=2021&rft.volume=2021&rft.issue=1&rft.issn=1530-8669&rft.eissn=1530-8677&rft_id=info:doi/10.1155/2021/6664669&rft_dat=%3Cproquest_cross%3E2518013852%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=2518013852&rft_id=info:pmid/&rfr_iscdi=true