基于深度策略动态规划的物联网无线传感器网络智能数据路由方案

IF 3 3区 计算机科学 Q2 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE
Archana Ojha;Sahil Manikchand Chaudhari;Prasenjit Chanak
{"title":"基于深度策略动态规划的物联网无线传感器网络智能数据路由方案","authors":"Archana Ojha;Sahil Manikchand Chaudhari;Prasenjit Chanak","doi":"10.1109/TSUSC.2024.3462512","DOIUrl":null,"url":null,"abstract":"Nowadays, the Internet of Things (IoT) plays a significant role in the development of various real-life applications such as smart cities, healthcare, precision agriculture, and industrial automation. Wireless Sensor Networks (WSNs) are a major ingredient of these IoT-based applications. In WSNs, sensor nodes that are close to the Base Station (BS) relay more data packets compared to other nodes, which creates high energy consumption at nodes close to the BS. As a result, an energy imbalance is created among the sensor nodes. Therefore, sensor nodes close to BS die early as compared to the faraway sensor nodes. These early dead nodes drastically increase data collection delay within the network. Furthermore, the early death of the sensor nodes partitions the network into different isolated sub-networks/segments. The formation of isolated segments causes premature death of the network. This paper proposes a Deep Policy Dynamic Programming (DPDP) based intelligent data routing scheme for IoT-enabled WSNs. The proposed scheme identifies an optimal number of Cluster Heads (CHs) and forms clusters to reduce the energy consumption of the deployed sensor nodes and prevent the early death of sensor nodes. Furthermore, the proposed scheme identifies an optimal number of Rendezvous Points (RPs) and designs an optimal path for Mobile Sink (MS) based data collection. Optimal RP selection and path design algorithms prevent the premature death of the network and significantly improve the overall performance of the network. Extensive simulations and test-bed experiments are conducted to test the performance of the proposed scheme. The simulation and test-bed results show that the proposed scheme outperforms as compared to the existing state-of-the-art approaches in terms of network lifetime, network stability, data loss due to buffer overflow, residual energy, and delay.","PeriodicalId":13268,"journal":{"name":"IEEE Transactions on Sustainable Computing","volume":"10 3","pages":"451-463"},"PeriodicalIF":3.0000,"publicationDate":"2024-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Deep Policy Dynamic Programming Based Intelligent Data Routing Scheme for IoT-Enabled Wireless Sensor Networks\",\"authors\":\"Archana Ojha;Sahil Manikchand Chaudhari;Prasenjit Chanak\",\"doi\":\"10.1109/TSUSC.2024.3462512\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Nowadays, the Internet of Things (IoT) plays a significant role in the development of various real-life applications such as smart cities, healthcare, precision agriculture, and industrial automation. Wireless Sensor Networks (WSNs) are a major ingredient of these IoT-based applications. In WSNs, sensor nodes that are close to the Base Station (BS) relay more data packets compared to other nodes, which creates high energy consumption at nodes close to the BS. As a result, an energy imbalance is created among the sensor nodes. Therefore, sensor nodes close to BS die early as compared to the faraway sensor nodes. These early dead nodes drastically increase data collection delay within the network. Furthermore, the early death of the sensor nodes partitions the network into different isolated sub-networks/segments. The formation of isolated segments causes premature death of the network. This paper proposes a Deep Policy Dynamic Programming (DPDP) based intelligent data routing scheme for IoT-enabled WSNs. The proposed scheme identifies an optimal number of Cluster Heads (CHs) and forms clusters to reduce the energy consumption of the deployed sensor nodes and prevent the early death of sensor nodes. Furthermore, the proposed scheme identifies an optimal number of Rendezvous Points (RPs) and designs an optimal path for Mobile Sink (MS) based data collection. Optimal RP selection and path design algorithms prevent the premature death of the network and significantly improve the overall performance of the network. Extensive simulations and test-bed experiments are conducted to test the performance of the proposed scheme. The simulation and test-bed results show that the proposed scheme outperforms as compared to the existing state-of-the-art approaches in terms of network lifetime, network stability, data loss due to buffer overflow, residual energy, and delay.\",\"PeriodicalId\":13268,\"journal\":{\"name\":\"IEEE Transactions on Sustainable Computing\",\"volume\":\"10 3\",\"pages\":\"451-463\"},\"PeriodicalIF\":3.0000,\"publicationDate\":\"2024-09-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Sustainable Computing\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10681524/\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Sustainable Computing","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10681524/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0

摘要

如今,物联网(IoT)在智能城市、医疗保健、精准农业和工业自动化等各种现实应用的发展中发挥着重要作用。无线传感器网络(wsn)是这些基于物联网的应用的主要组成部分。在wsn中,靠近基站的传感器节点比其他节点中继更多的数据包,这导致靠近基站的节点能耗高。因此,在传感器节点之间产生能量不平衡。因此,离BS较近的传感器节点死亡时间较远。这些早死节点极大地增加了网络中的数据收集延迟。此外,传感器节点的早期死亡将网络划分为不同的隔离子网络/段。孤立网段的形成导致网络过早死亡。提出了一种基于深度策略动态规划(DPDP)的物联网无线传感器网络智能数据路由方案。该方案确定最优簇头数量并形成簇,以减少部署的传感器节点的能量消耗,防止传感器节点过早死亡。此外,该方案确定了最优数量的交会点(RPs),并设计了基于移动汇(MS)的数据采集的最优路径。最优RP选择和路径设计算法防止了网络的过早死亡,显著提高了网络的整体性能。通过大量的仿真和试验台实验来验证所提方案的性能。仿真和测试结果表明,与现有的最先进的方法相比,所提出的方案在网络寿命、网络稳定性、缓冲区溢出导致的数据丢失、剩余能量和延迟方面都优于现有的方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Deep Policy Dynamic Programming Based Intelligent Data Routing Scheme for IoT-Enabled Wireless Sensor Networks
Nowadays, the Internet of Things (IoT) plays a significant role in the development of various real-life applications such as smart cities, healthcare, precision agriculture, and industrial automation. Wireless Sensor Networks (WSNs) are a major ingredient of these IoT-based applications. In WSNs, sensor nodes that are close to the Base Station (BS) relay more data packets compared to other nodes, which creates high energy consumption at nodes close to the BS. As a result, an energy imbalance is created among the sensor nodes. Therefore, sensor nodes close to BS die early as compared to the faraway sensor nodes. These early dead nodes drastically increase data collection delay within the network. Furthermore, the early death of the sensor nodes partitions the network into different isolated sub-networks/segments. The formation of isolated segments causes premature death of the network. This paper proposes a Deep Policy Dynamic Programming (DPDP) based intelligent data routing scheme for IoT-enabled WSNs. The proposed scheme identifies an optimal number of Cluster Heads (CHs) and forms clusters to reduce the energy consumption of the deployed sensor nodes and prevent the early death of sensor nodes. Furthermore, the proposed scheme identifies an optimal number of Rendezvous Points (RPs) and designs an optimal path for Mobile Sink (MS) based data collection. Optimal RP selection and path design algorithms prevent the premature death of the network and significantly improve the overall performance of the network. Extensive simulations and test-bed experiments are conducted to test the performance of the proposed scheme. The simulation and test-bed results show that the proposed scheme outperforms as compared to the existing state-of-the-art approaches in terms of network lifetime, network stability, data loss due to buffer overflow, residual energy, and delay.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IEEE Transactions on Sustainable Computing
IEEE Transactions on Sustainable Computing Mathematics-Control and Optimization
CiteScore
7.70
自引率
2.60%
发文量
54
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信