Congestion-aware Data Acquisition with Q-learning for Wireless Sensor Networks

Praveen Kumar Donta, Tarachand Amgoth, Chandra Sekhara Rao Annavarapu
{"title":"Congestion-aware Data Acquisition with Q-learning for Wireless Sensor Networks","authors":"Praveen Kumar Donta, Tarachand Amgoth, Chandra Sekhara Rao Annavarapu","doi":"10.1109/IEMTRONICS51293.2020.9216379","DOIUrl":null,"url":null,"abstract":"In wireless sensor networks (WSNs), congestion is one of the challenging issues. It degrades the network’s performance in various operating variables such as throughput, latency, energy consumption, packet loss, lifetime of the network and etc. Congestion occurs in WSN when the rate of sensor data flow outreach the channel or buffer capacity. The congestion is controlled in two ways in WSN, such as controlling network traffic or efficiently managing the resources. This paper performs the resource control mechanism by providing the alternative path towards to base station using a Q-learning for congestion alleviation. This congestion-aware data acquisition (CADA) mechanism initially identifies the congestion node (CN) where the nodes buffer occupancy ratio is higher. Further, we recognize the proper next node to construct the dynamic alternative route to the base station. The CADA is evaluated in various network conditions by comparing it with recent congestion-aware algorithms. The simulation tests show that the CADA efficiently ameliorates the congestion and enhances the performance across multiple performance metrics.","PeriodicalId":269697,"journal":{"name":"2020 IEEE International IOT, Electronics and Mechatronics Conference (IEMTRONICS)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"18","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE International IOT, Electronics and Mechatronics Conference (IEMTRONICS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IEMTRONICS51293.2020.9216379","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 18

Abstract

In wireless sensor networks (WSNs), congestion is one of the challenging issues. It degrades the network’s performance in various operating variables such as throughput, latency, energy consumption, packet loss, lifetime of the network and etc. Congestion occurs in WSN when the rate of sensor data flow outreach the channel or buffer capacity. The congestion is controlled in two ways in WSN, such as controlling network traffic or efficiently managing the resources. This paper performs the resource control mechanism by providing the alternative path towards to base station using a Q-learning for congestion alleviation. This congestion-aware data acquisition (CADA) mechanism initially identifies the congestion node (CN) where the nodes buffer occupancy ratio is higher. Further, we recognize the proper next node to construct the dynamic alternative route to the base station. The CADA is evaluated in various network conditions by comparing it with recent congestion-aware algorithms. The simulation tests show that the CADA efficiently ameliorates the congestion and enhances the performance across multiple performance metrics.
基于q -学习的无线传感器网络拥塞感知数据采集
在无线传感器网络(WSNs)中,拥塞是一个具有挑战性的问题。它会降低网络在各种操作变量中的性能,如吞吐量、延迟、能耗、丢包、网络生命周期等。当传感器数据流的速率超过信道或缓冲区的容量时,就会发生拥塞。在无线传感器网络中,对拥塞的控制有两种方式,一是控制网络流量,二是有效地管理资源。本文通过提供通往基站的替代路径来执行资源控制机制,并使用q学习来缓解拥塞。这种拥塞感知数据采集(CADA)机制最初识别节点缓冲区占用率较高的拥塞节点(CN)。此外,我们识别合适的下一个节点来构建到基站的动态替代路由。通过将CADA与最近的拥塞感知算法进行比较,在各种网络条件下对其进行评估。仿真测试表明,CADA有效地改善了拥塞,提高了多个性能指标的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信