A mobile sink path planning for wireless sensor networks based on priority‐ordered dependent nonparametric trees

Summary The professional design of the routing protocols with mobile sink(s) in wireless sensor networks (WSNs) is important for many purposes such as maximizing energy efficiency, increasing network life, and evenly distributing load balance across the network. Moreover, mobile sinks ought to first...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International journal of communication systems 2020-08, Vol.33 (12), p.n/a
Hauptverfasser: Yalçın, Sercan, Erdem, Ebubekir
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page n/a
container_issue 12
container_start_page
container_title International journal of communication systems
container_volume 33
creator Yalçın, Sercan
Erdem, Ebubekir
description Summary The professional design of the routing protocols with mobile sink(s) in wireless sensor networks (WSNs) is important for many purposes such as maximizing energy efficiency, increasing network life, and evenly distributing load balance across the network. Moreover, mobile sinks ought to first collect data from nodes which have very important and dense data so that packet collision and loss can be prevented at an advanced level. For these purposes, the present paper proposes a new mobile path planning protocol by introducing priority‐ordered dependent nonparametric trees (PoDNTs) for WSNs. Unlike traditional clustered or swarm intelligence topology‐based routing methods, a topology which has hierarchical and dependent infinite tree structure provides a robust link connection between nodes, making it easier to reselect ancestor nodes (ANs). The proposed priority‐ordered infinite trees are sampled in the specific time frames by introducing new equations and hierarchically associated with their child nodes starting from the root node. Hence, the nodes with the highest priority and energy that belong to the constructed tree family are selected as ANs with an opportunistic approach. A mobile sink simply visits these ANs to acquire data from all nodes in the network and return to where it started. As a result, the route traveled is assigned as the mobile path for the current round. We have performed comprehensive performance analysis to illustrate the effectiveness of the present study using NS‐2 simulation environment. The present routing protocol has achieved better results than the other algorithms over various performance metrics. The present paper proposes a new mobile path planning protocol by introducing priority‐ordered dependent nonparametric trees (PoDNTs) for WSNs. This study significantly prolongs the lifetime and energy efficiency of WSNs and provides an efficient mobile routing plan. We observe the superior performance of the present model compared with the existing algorithms in simulation environment.
doi_str_mv 10.1002/dac.4449
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2421721487</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2421721487</sourcerecordid><originalsourceid>FETCH-LOGICAL-c2939-793cd34f7e7945ed3681ed4e1af297662d265ba12d3a070a8e3f025526aa1e3c3</originalsourceid><addsrcrecordid>eNp1kEtOwzAQhi0EEqUgcQRLbNik-JU4WVblKVViA2vLjSeQNrXDOFXVHUfgjJwEl7JlNQ99mtH_EXLJ2YQzJm6crSdKqeqIjDirqoxzyY_3vVZZLnN-Ss5iXDLGSlHkI4JTug6LtgMaW7-ivR3ead9Z71v_RpuAdNsidBAjjeBjmj0M24CrSBc2gqPB0x7bgO2w-_78CugA09ZBD96BH6gPvrdo1zBgW9MBAeI5OWlsF-Hir47J6_3dy-wxmz8_PM2m86wWlawyXcnaSdVo0JXKwcmi5OAUcNuISheFcCnAwnLhpGWa2RJkw0Sei8JaDrKWY3J1uNtj-NhAHMwybNCnl0YowbXgqtSJuj5QNYYYERqT8qwt7gxnZm_UJKNmbzSh2QHdJl-7fzlzO5398j85hHmf</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2421721487</pqid></control><display><type>article</type><title>A mobile sink path planning for wireless sensor networks based on priority‐ordered dependent nonparametric trees</title><source>Wiley Online Library Journals Frontfile Complete</source><creator>Yalçın, Sercan ; Erdem, Ebubekir</creator><creatorcontrib>Yalçın, Sercan ; Erdem, Ebubekir</creatorcontrib><description>Summary The professional design of the routing protocols with mobile sink(s) in wireless sensor networks (WSNs) is important for many purposes such as maximizing energy efficiency, increasing network life, and evenly distributing load balance across the network. Moreover, mobile sinks ought to first collect data from nodes which have very important and dense data so that packet collision and loss can be prevented at an advanced level. For these purposes, the present paper proposes a new mobile path planning protocol by introducing priority‐ordered dependent nonparametric trees (PoDNTs) for WSNs. Unlike traditional clustered or swarm intelligence topology‐based routing methods, a topology which has hierarchical and dependent infinite tree structure provides a robust link connection between nodes, making it easier to reselect ancestor nodes (ANs). The proposed priority‐ordered infinite trees are sampled in the specific time frames by introducing new equations and hierarchically associated with their child nodes starting from the root node. Hence, the nodes with the highest priority and energy that belong to the constructed tree family are selected as ANs with an opportunistic approach. A mobile sink simply visits these ANs to acquire data from all nodes in the network and return to where it started. As a result, the route traveled is assigned as the mobile path for the current round. We have performed comprehensive performance analysis to illustrate the effectiveness of the present study using NS‐2 simulation environment. The present routing protocol has achieved better results than the other algorithms over various performance metrics. The present paper proposes a new mobile path planning protocol by introducing priority‐ordered dependent nonparametric trees (PoDNTs) for WSNs. This study significantly prolongs the lifetime and energy efficiency of WSNs and provides an efficient mobile routing plan. We observe the superior performance of the present model compared with the existing algorithms in simulation environment.</description><identifier>ISSN: 1074-5351</identifier><identifier>EISSN: 1099-1131</identifier><identifier>DOI: 10.1002/dac.4449</identifier><language>eng</language><publisher>Chichester: Wiley Subscription Services, Inc</publisher><subject>Algorithms ; Collision avoidance ; Computer simulation ; Data collection ; dependent nonparametric trees ; energy consumption ; mobile sink ; Network topologies ; Nodes ; Nonparametric statistics ; Path planning ; Performance measurement ; Protocol (computers) ; Swarm intelligence ; Trees ; Wireless networks ; Wireless sensor networks</subject><ispartof>International journal of communication systems, 2020-08, Vol.33 (12), p.n/a</ispartof><rights>2020 John Wiley &amp; Sons, Ltd.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c2939-793cd34f7e7945ed3681ed4e1af297662d265ba12d3a070a8e3f025526aa1e3c3</citedby><cites>FETCH-LOGICAL-c2939-793cd34f7e7945ed3681ed4e1af297662d265ba12d3a070a8e3f025526aa1e3c3</cites><orcidid>0000-0001-7093-7016 ; 0000-0003-1420-2490</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://onlinelibrary.wiley.com/doi/pdf/10.1002%2Fdac.4449$$EPDF$$P50$$Gwiley$$H</linktopdf><linktohtml>$$Uhttps://onlinelibrary.wiley.com/doi/full/10.1002%2Fdac.4449$$EHTML$$P50$$Gwiley$$H</linktohtml><link.rule.ids>314,776,780,1411,27901,27902,45550,45551</link.rule.ids></links><search><creatorcontrib>Yalçın, Sercan</creatorcontrib><creatorcontrib>Erdem, Ebubekir</creatorcontrib><title>A mobile sink path planning for wireless sensor networks based on priority‐ordered dependent nonparametric trees</title><title>International journal of communication systems</title><description>Summary The professional design of the routing protocols with mobile sink(s) in wireless sensor networks (WSNs) is important for many purposes such as maximizing energy efficiency, increasing network life, and evenly distributing load balance across the network. Moreover, mobile sinks ought to first collect data from nodes which have very important and dense data so that packet collision and loss can be prevented at an advanced level. For these purposes, the present paper proposes a new mobile path planning protocol by introducing priority‐ordered dependent nonparametric trees (PoDNTs) for WSNs. Unlike traditional clustered or swarm intelligence topology‐based routing methods, a topology which has hierarchical and dependent infinite tree structure provides a robust link connection between nodes, making it easier to reselect ancestor nodes (ANs). The proposed priority‐ordered infinite trees are sampled in the specific time frames by introducing new equations and hierarchically associated with their child nodes starting from the root node. Hence, the nodes with the highest priority and energy that belong to the constructed tree family are selected as ANs with an opportunistic approach. A mobile sink simply visits these ANs to acquire data from all nodes in the network and return to where it started. As a result, the route traveled is assigned as the mobile path for the current round. We have performed comprehensive performance analysis to illustrate the effectiveness of the present study using NS‐2 simulation environment. The present routing protocol has achieved better results than the other algorithms over various performance metrics. The present paper proposes a new mobile path planning protocol by introducing priority‐ordered dependent nonparametric trees (PoDNTs) for WSNs. This study significantly prolongs the lifetime and energy efficiency of WSNs and provides an efficient mobile routing plan. We observe the superior performance of the present model compared with the existing algorithms in simulation environment.</description><subject>Algorithms</subject><subject>Collision avoidance</subject><subject>Computer simulation</subject><subject>Data collection</subject><subject>dependent nonparametric trees</subject><subject>energy consumption</subject><subject>mobile sink</subject><subject>Network topologies</subject><subject>Nodes</subject><subject>Nonparametric statistics</subject><subject>Path planning</subject><subject>Performance measurement</subject><subject>Protocol (computers)</subject><subject>Swarm intelligence</subject><subject>Trees</subject><subject>Wireless networks</subject><subject>Wireless sensor networks</subject><issn>1074-5351</issn><issn>1099-1131</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2020</creationdate><recordtype>article</recordtype><recordid>eNp1kEtOwzAQhi0EEqUgcQRLbNik-JU4WVblKVViA2vLjSeQNrXDOFXVHUfgjJwEl7JlNQ99mtH_EXLJ2YQzJm6crSdKqeqIjDirqoxzyY_3vVZZLnN-Ss5iXDLGSlHkI4JTug6LtgMaW7-ivR3ead9Z71v_RpuAdNsidBAjjeBjmj0M24CrSBc2gqPB0x7bgO2w-_78CugA09ZBD96BH6gPvrdo1zBgW9MBAeI5OWlsF-Hir47J6_3dy-wxmz8_PM2m86wWlawyXcnaSdVo0JXKwcmi5OAUcNuISheFcCnAwnLhpGWa2RJkw0Sei8JaDrKWY3J1uNtj-NhAHMwybNCnl0YowbXgqtSJuj5QNYYYERqT8qwt7gxnZm_UJKNmbzSh2QHdJl-7fzlzO5398j85hHmf</recordid><startdate>202008</startdate><enddate>202008</enddate><creator>Yalçın, Sercan</creator><creator>Erdem, Ebubekir</creator><general>Wiley Subscription Services, Inc</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><orcidid>https://orcid.org/0000-0001-7093-7016</orcidid><orcidid>https://orcid.org/0000-0003-1420-2490</orcidid></search><sort><creationdate>202008</creationdate><title>A mobile sink path planning for wireless sensor networks based on priority‐ordered dependent nonparametric trees</title><author>Yalçın, Sercan ; Erdem, Ebubekir</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c2939-793cd34f7e7945ed3681ed4e1af297662d265ba12d3a070a8e3f025526aa1e3c3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2020</creationdate><topic>Algorithms</topic><topic>Collision avoidance</topic><topic>Computer simulation</topic><topic>Data collection</topic><topic>dependent nonparametric trees</topic><topic>energy consumption</topic><topic>mobile sink</topic><topic>Network topologies</topic><topic>Nodes</topic><topic>Nonparametric statistics</topic><topic>Path planning</topic><topic>Performance measurement</topic><topic>Protocol (computers)</topic><topic>Swarm intelligence</topic><topic>Trees</topic><topic>Wireless networks</topic><topic>Wireless sensor networks</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Yalçın, Sercan</creatorcontrib><creatorcontrib>Erdem, Ebubekir</creatorcontrib><collection>CrossRef</collection><collection>Electronics &amp; Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><jtitle>International journal of communication systems</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Yalçın, Sercan</au><au>Erdem, Ebubekir</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A mobile sink path planning for wireless sensor networks based on priority‐ordered dependent nonparametric trees</atitle><jtitle>International journal of communication systems</jtitle><date>2020-08</date><risdate>2020</risdate><volume>33</volume><issue>12</issue><epage>n/a</epage><issn>1074-5351</issn><eissn>1099-1131</eissn><abstract>Summary The professional design of the routing protocols with mobile sink(s) in wireless sensor networks (WSNs) is important for many purposes such as maximizing energy efficiency, increasing network life, and evenly distributing load balance across the network. Moreover, mobile sinks ought to first collect data from nodes which have very important and dense data so that packet collision and loss can be prevented at an advanced level. For these purposes, the present paper proposes a new mobile path planning protocol by introducing priority‐ordered dependent nonparametric trees (PoDNTs) for WSNs. Unlike traditional clustered or swarm intelligence topology‐based routing methods, a topology which has hierarchical and dependent infinite tree structure provides a robust link connection between nodes, making it easier to reselect ancestor nodes (ANs). The proposed priority‐ordered infinite trees are sampled in the specific time frames by introducing new equations and hierarchically associated with their child nodes starting from the root node. Hence, the nodes with the highest priority and energy that belong to the constructed tree family are selected as ANs with an opportunistic approach. A mobile sink simply visits these ANs to acquire data from all nodes in the network and return to where it started. As a result, the route traveled is assigned as the mobile path for the current round. We have performed comprehensive performance analysis to illustrate the effectiveness of the present study using NS‐2 simulation environment. The present routing protocol has achieved better results than the other algorithms over various performance metrics. The present paper proposes a new mobile path planning protocol by introducing priority‐ordered dependent nonparametric trees (PoDNTs) for WSNs. This study significantly prolongs the lifetime and energy efficiency of WSNs and provides an efficient mobile routing plan. We observe the superior performance of the present model compared with the existing algorithms in simulation environment.</abstract><cop>Chichester</cop><pub>Wiley Subscription Services, Inc</pub><doi>10.1002/dac.4449</doi><tpages>19</tpages><orcidid>https://orcid.org/0000-0001-7093-7016</orcidid><orcidid>https://orcid.org/0000-0003-1420-2490</orcidid></addata></record>
fulltext fulltext
identifier ISSN: 1074-5351
ispartof International journal of communication systems, 2020-08, Vol.33 (12), p.n/a
issn 1074-5351
1099-1131
language eng
recordid cdi_proquest_journals_2421721487
source Wiley Online Library Journals Frontfile Complete
subjects Algorithms
Collision avoidance
Computer simulation
Data collection
dependent nonparametric trees
energy consumption
mobile sink
Network topologies
Nodes
Nonparametric statistics
Path planning
Performance measurement
Protocol (computers)
Swarm intelligence
Trees
Wireless networks
Wireless sensor networks
title A mobile sink path planning for wireless sensor networks based on priority‐ordered dependent nonparametric trees
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-04T19%3A29%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=A%20mobile%20sink%20path%20planning%20for%20wireless%20sensor%20networks%20based%20on%20priority%E2%80%90ordered%20dependent%20nonparametric%20trees&rft.jtitle=International%20journal%20of%20communication%20systems&rft.au=Yal%C3%A7%C4%B1n,%20Sercan&rft.date=2020-08&rft.volume=33&rft.issue=12&rft.epage=n/a&rft.issn=1074-5351&rft.eissn=1099-1131&rft_id=info:doi/10.1002/dac.4449&rft_dat=%3Cproquest_cross%3E2421721487%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=2421721487&rft_id=info:pmid/&rfr_iscdi=true