DTAR: A Dynamic Threshold Adaptive Ranking-Based Energy-Efficient Routing Algorithm for WSNs

IF 0.5 Q4 COMPUTER SCIENCE, THEORY & METHODS
R. Amutha, G. Sivasankari, K. Venugopal, Thompson Stephan
{"title":"DTAR: A Dynamic Threshold Adaptive Ranking-Based Energy-Efficient Routing Algorithm for WSNs","authors":"R. Amutha, G. Sivasankari, K. Venugopal, Thompson Stephan","doi":"10.1142/s0219265921490013","DOIUrl":null,"url":null,"abstract":"Owing to uncertainties associated with energy and maintenance of large Wireless Sensor Networks (WSN) during transmission, energy-efficient routing strategies are gaining popularity. A Dynamic Threshold Adaptive Routing Algorithm (DTAR) is proposed for determining the most appropriate node to become a Cluster Head (CH) using adaptive participation criteria. For determining the next Forwarder Node (FN), an adaptive ranking scheme depends on distance ([Formula: see text]) and Residual Energy ([Formula: see text]). However, additional parameters such as Delivery Ratio (DR), End-to-End delay ([Formula: see text] delay), and Message Success Rate (MSR) should be considered to achieve the most optimal approach to achieve energy efficiency. The proposed DTAR algorithm is validated on variable clustered networks in order to investigate the effect of opportunistic routing with increasing network size and energy resources. The proposed algorithm shows a substantial decrease in energy consumption during transmission. Energy Consumption (EC), Packet Delivery Ratio (PDR), End-to-End delay ([Formula: see text] delay), and Message Success Rate (MSR) are used to illustrate the effectiveness of the proposed algorithm for energy efficiency.","PeriodicalId":53990,"journal":{"name":"JOURNAL OF INTERCONNECTION NETWORKS","volume":"71 1","pages":""},"PeriodicalIF":0.5000,"publicationDate":"2022-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"JOURNAL OF INTERCONNECTION NETWORKS","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/s0219265921490013","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

Abstract

Owing to uncertainties associated with energy and maintenance of large Wireless Sensor Networks (WSN) during transmission, energy-efficient routing strategies are gaining popularity. A Dynamic Threshold Adaptive Routing Algorithm (DTAR) is proposed for determining the most appropriate node to become a Cluster Head (CH) using adaptive participation criteria. For determining the next Forwarder Node (FN), an adaptive ranking scheme depends on distance ([Formula: see text]) and Residual Energy ([Formula: see text]). However, additional parameters such as Delivery Ratio (DR), End-to-End delay ([Formula: see text] delay), and Message Success Rate (MSR) should be considered to achieve the most optimal approach to achieve energy efficiency. The proposed DTAR algorithm is validated on variable clustered networks in order to investigate the effect of opportunistic routing with increasing network size and energy resources. The proposed algorithm shows a substantial decrease in energy consumption during transmission. Energy Consumption (EC), Packet Delivery Ratio (PDR), End-to-End delay ([Formula: see text] delay), and Message Success Rate (MSR) are used to illustrate the effectiveness of the proposed algorithm for energy efficiency.
基于动态阈值自适应排序的无线传感器网络节能路由算法
由于大型无线传感器网络(WSN)在传输过程中与能量和维护相关的不确定性,节能路由策略越来越受欢迎。提出了一种动态阈值自适应路由算法(DTAR),利用自适应参与准则确定最合适的节点成为簇头(CH)。为了确定下一个转发器节点(FN),自适应排序方案取决于距离([公式:见文本])和剩余能量([公式:见文本])。但是,需要考虑其他参数,如传输比(DR)、端到端延迟([公式:见文本]延迟)和消息成功率(MSR),以实现最优的节能方法。在可变聚类网络中对该算法进行了验证,以研究机会路由随网络规模和能量的增加所产生的影响。该算法在传输过程中显著降低了能量消耗。用能耗(EC)、包投递率(PDR)、端到端延迟([公式:见文本]延迟)和消息成功率(MSR)来说明所提算法在能源效率方面的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
JOURNAL OF INTERCONNECTION NETWORKS
JOURNAL OF INTERCONNECTION NETWORKS COMPUTER SCIENCE, THEORY & METHODS-
自引率
14.30%
发文量
121
期刊介绍: The Journal of Interconnection Networks (JOIN) is an international scientific journal dedicated to advancing the state-of-the-art of interconnection networks. The journal addresses all aspects of interconnection networks including their theory, analysis, design, implementation and application, and corresponding issues of communication, computing and function arising from (or applied to) a variety of multifaceted networks. Interconnection problems occur at different levels in the hardware and software design of communicating entities in integrated circuits, multiprocessors, multicomputers, and communication networks as diverse as telephone systems, cable network systems, computer networks, mobile communication networks, satellite network systems, the Internet and biological systems.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信