Moving-update Kalman Algorithm in Low-cost Node-Red IoT Network for Estimating Flood Water Level

Quang Dung Nguyen, Hoang Trung Le, Hoang Thien Le, Viet Hung Tran
{"title":"Moving-update Kalman Algorithm in Low-cost Node-Red IoT Network for Estimating Flood Water Level","authors":"Quang Dung Nguyen, Hoang Trung Le, Hoang Thien Le, Viet Hung Tran","doi":"10.55579/jaec.202263.367","DOIUrl":null,"url":null,"abstract":"Flooding is one of the most common natural disasters in Vietnam. Although a hydrological monitoring system has been developed in Vietnam, the adoption of a Flood Warning and Monitoring System (FWMS) is still limited. A practical issue is that the river water levels is rarely flat, but undulating with flood water ripples, which makes the measurement inaccurate. In this paper, we will design a recursive Kalman estimation for fluctuating flood water level in the Node-Red IoT network. Indeed, the low complexity of the popular Kalman filter algorithm is very suitable for a low-cost IoT system like Node-Red. In our experiments, the accuracy of our Kalman algorithm is far superior to the standard Moving Average (MA) algorithm. To our knowledge, this is the first time that the Kalman filter has been used in a practical Node-Red IoT experiment. We will show that our novel Moving-update Kalman algorithm, which combines MA and Kalman methods, can track data recursively without prior knowledge of noise’s variance. Our novel algorithm is of linear complexity and, hence, fast enough for low cost IoT and FWMS systems in developing countries like Vietnam. We also included the industrial Message Queuing Telemetry Transport (MQTT) protocol in IoT network in our Node-Red system, which means our designed Node-Red proposal is capable of transferring data to any FWMS network via internet. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium provided the original work is properly cited.","PeriodicalId":250655,"journal":{"name":"J. Adv. Eng. Comput.","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"J. Adv. Eng. Comput.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.55579/jaec.202263.367","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Flooding is one of the most common natural disasters in Vietnam. Although a hydrological monitoring system has been developed in Vietnam, the adoption of a Flood Warning and Monitoring System (FWMS) is still limited. A practical issue is that the river water levels is rarely flat, but undulating with flood water ripples, which makes the measurement inaccurate. In this paper, we will design a recursive Kalman estimation for fluctuating flood water level in the Node-Red IoT network. Indeed, the low complexity of the popular Kalman filter algorithm is very suitable for a low-cost IoT system like Node-Red. In our experiments, the accuracy of our Kalman algorithm is far superior to the standard Moving Average (MA) algorithm. To our knowledge, this is the first time that the Kalman filter has been used in a practical Node-Red IoT experiment. We will show that our novel Moving-update Kalman algorithm, which combines MA and Kalman methods, can track data recursively without prior knowledge of noise’s variance. Our novel algorithm is of linear complexity and, hence, fast enough for low cost IoT and FWMS systems in developing countries like Vietnam. We also included the industrial Message Queuing Telemetry Transport (MQTT) protocol in IoT network in our Node-Red system, which means our designed Node-Red proposal is capable of transferring data to any FWMS network via internet. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium provided the original work is properly cited.
低成本节点红物联网水位估计的移动更新卡尔曼算法
洪水是越南最常见的自然灾害之一。虽然越南已经发展了水文监测系统,但采用洪水预警和监测系统(FWMS)仍然有限。一个实际的问题是,河流的水位很少是平坦的,而是随着洪水的涟漪起伏,这使得测量不准确。在本文中,我们将设计一个递归卡尔曼估计,用于在Node-Red物联网网络中波动的洪水水位。事实上,流行的卡尔曼滤波算法的低复杂度非常适合像Node-Red这样的低成本物联网系统。在我们的实验中,我们的卡尔曼算法的精度远远优于标准的移动平均(MA)算法。据我们所知,这是卡尔曼滤波器第一次在实际的Node-Red物联网实验中使用。我们将展示我们的新颖的移动更新卡尔曼算法,它结合了MA和卡尔曼方法,可以递归地跟踪数据,而不需要事先知道噪声的方差。我们的新算法具有线性复杂性,因此对于越南等发展中国家的低成本物联网和FWMS系统来说,速度足够快。我们还在Node-Red系统中加入了物联网网络中的工业消息队列遥测传输(MQTT)协议,这意味着我们设计的Node-Red提案能够通过互联网将数据传输到任何FWMS网络。这是一篇在知识共享署名许可(http://creativecommons.org/licenses/by/4.0/)条款下发布的开放获取文章,该许可允许在任何媒介上不受限制地使用、分发和复制,只要原始作品被适当引用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信