Minimum cascade repair method for mobile network nodes failure under time–frequency feature fusion

{"title":"Minimum cascade repair method for mobile network nodes failure under time–frequency feature fusion","authors":"","doi":"10.1007/s11036-024-02312-0","DOIUrl":null,"url":null,"abstract":"<h3>Abstract</h3> <p>Aiming at the connectivity failure caused by the failure of mobile network nodes in complex application scenarios, a minimum cascade repair method for the failure of mobile network nodes under time–frequency feature fusion is proposed. The short-time energy and zero-crossing rate of time-domain features of mobile network nodes were extracted.The frequency domain features of network nodes are extracted by fully connected long and short time memory network. In the form of weighting and series, the time domain and frequency domain features are fused to obtain the time–frequency fusion features. The failure node is detected by using the adaptive mechanism of node clustering feature combined with time–frequency fusion feature. Judging whether the failed node is a cut point according to the rule; If the failed node is a cut point, the network needs to be repaired. Considering the impact of faulty nodes on network communication and connectivity in the real world, an innovative minimum cascade repair algorithm is introduced to establish communication links to repair the network topology without moving nodes, achieving optimization of repair rules. Calculate the energy consumption of the repair moving distance of the failed node, based on the optimized repair rules. If the energy consumption is less than or equal to the energy consumption of the communication radius of the neighboring node, the mobile network can be repaired statically by directly establishing a communication link between the neighboring nodes. Otherwise, the best candidate node is selected and its location to be moved is calculated to complete the mobile network mobile repair. Experimental results show that this method can effectively repair the network after node failure. This method reduces the energy loss of the repair node and improves the status indicator value of the mobile network.</p>","PeriodicalId":501103,"journal":{"name":"Mobile Networks and Applications","volume":"20 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Mobile Networks and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/s11036-024-02312-0","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Aiming at the connectivity failure caused by the failure of mobile network nodes in complex application scenarios, a minimum cascade repair method for the failure of mobile network nodes under time–frequency feature fusion is proposed. The short-time energy and zero-crossing rate of time-domain features of mobile network nodes were extracted.The frequency domain features of network nodes are extracted by fully connected long and short time memory network. In the form of weighting and series, the time domain and frequency domain features are fused to obtain the time–frequency fusion features. The failure node is detected by using the adaptive mechanism of node clustering feature combined with time–frequency fusion feature. Judging whether the failed node is a cut point according to the rule; If the failed node is a cut point, the network needs to be repaired. Considering the impact of faulty nodes on network communication and connectivity in the real world, an innovative minimum cascade repair algorithm is introduced to establish communication links to repair the network topology without moving nodes, achieving optimization of repair rules. Calculate the energy consumption of the repair moving distance of the failed node, based on the optimized repair rules. If the energy consumption is less than or equal to the energy consumption of the communication radius of the neighboring node, the mobile network can be repaired statically by directly establishing a communication link between the neighboring nodes. Otherwise, the best candidate node is selected and its location to be moved is calculated to complete the mobile network mobile repair. Experimental results show that this method can effectively repair the network after node failure. This method reduces the energy loss of the repair node and improves the status indicator value of the mobile network.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
时频特征融合下移动网络节点故障的最小级联修复方法
摘要 针对复杂应用场景下移动网络节点故障导致的连接失效问题,提出了一种时频特征融合下的移动网络节点故障最小级联修复方法。提取移动网络节点时域特征的短时能量和零交叉率,通过全连接的长短时记忆网络提取网络节点的频域特征。通过加权和序列的形式,将时域和频域特征进行融合,得到时频融合特征。利用节点聚类特征与时频融合特征相结合的自适应机制来检测故障节点。根据规则判断故障节点是否为切点;如果故障节点为切点,则需要修复网络。考虑到现实世界中故障节点对网络通信和连通性的影响,引入创新的最小级联修复算法,在不移动节点的情况下建立通信链路修复网络拓扑,实现修复规则的优化。根据优化后的修复规则,计算故障节点修复移动距离的能耗。如果能耗小于或等于相邻节点通信半径的能耗,则可通过直接建立相邻节点间的通信链路,静态修复移动网络。否则,将选择最佳候选节点,并计算其需要移动的位置,完成移动网络的移动修复。实验结果表明,该方法能在节点故障后有效修复网络。该方法减少了修复节点的能量损耗,提高了移动网络的状态指示值。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Multi-Objective Recommendation for Massive Remote Teaching Resources An Intelligent Proofreading for Remote Skiing Actions Based on Variable Shape Basis Formalization and Analysis of Aeolus-based File System from Process Algebra Perspective TMPSformer: An Efficient Hybrid Transformer-MLP Network for Polyp Segmentation Privacy and Security Issues in Mobile Medical Information Systems MMIS
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1