A Novel HISMO Solution to Coverage Hole Mitigation in 6G-IoT

Abhishek Gupta, Somesh Kumar, Prof. Manisha Pattanaik
{"title":"A Novel HISMO Solution to Coverage Hole Mitigation in 6G-IoT","authors":"Abhishek Gupta, Somesh Kumar, Prof. Manisha Pattanaik","doi":"10.1109/IATMSI56455.2022.10119303","DOIUrl":null,"url":null,"abstract":"In 6G-IoT, coverage hole problem is a major issue which needs to be addressed. In this paper, a novel approach to heal the hole it is proposed. A hypergraph based improved slime mould optimization (HISMO) is presented for coverage hole healing in 6G network. The hypergraph model is used to construct a hypergraph H(V, E), where V is the set of vertices, i.e., the sensing nodes, and E is the set of hyperedges, i.e., the sensor coverage areas. In the HISMO, a novel heuristic approach is proposed to improve the slime mould optimization (HISMO) algorithm. HISMO is used to find a set of non-overlapping sensing nodes for coverage hole healing. Extensive simulations are carried out to compare the HISMO with other heuristic algorithms. The results show that the HISMO outperforms other algorithms in terms of the area of coverage hole healing and the number of coverage hole healing.","PeriodicalId":221211,"journal":{"name":"2022 IEEE Conference on Interdisciplinary Approaches in Technology and Management for Social Innovation (IATMSI)","volume":"290 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE Conference on Interdisciplinary Approaches in Technology and Management for Social Innovation (IATMSI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IATMSI56455.2022.10119303","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In 6G-IoT, coverage hole problem is a major issue which needs to be addressed. In this paper, a novel approach to heal the hole it is proposed. A hypergraph based improved slime mould optimization (HISMO) is presented for coverage hole healing in 6G network. The hypergraph model is used to construct a hypergraph H(V, E), where V is the set of vertices, i.e., the sensing nodes, and E is the set of hyperedges, i.e., the sensor coverage areas. In the HISMO, a novel heuristic approach is proposed to improve the slime mould optimization (HISMO) algorithm. HISMO is used to find a set of non-overlapping sensing nodes for coverage hole healing. Extensive simulations are carried out to compare the HISMO with other heuristic algorithms. The results show that the HISMO outperforms other algorithms in terms of the area of coverage hole healing and the number of coverage hole healing.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一种新的HISMO解决方案,以缓解6G-IoT中的覆盖漏洞
在6G-IoT中,覆盖漏洞问题是一个需要解决的主要问题。本文提出了一种新的修复孔洞的方法。提出了一种基于超图的改进黏菌优化(HISMO)方法,用于6G网络的覆盖空洞修复。使用超图模型构造一个超图H(V, E),其中V为顶点集合,即传感节点,E为超边集合,即传感器覆盖区域。在该算法中,提出了一种新的启发式方法来改进黏菌优化算法。利用HISMO寻找一组不重叠的感知节点进行覆盖孔修复。进行了大量的仿真,将HISMO与其他启发式算法进行了比较。结果表明,该算法在覆盖洞愈合面积和覆盖洞愈合数量方面优于其他算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Hardware and Software Development of a Small Scale Driverless Vehicle A Study on The Impact of Road Traffic Congestion at Vadapalani-Chennai Agrobot- An IoT-Based Automated Multi-Functional Robot Additional Reviewers Subcarrier Selection and User Matching Technique for Downlink NOMA System
×
引用
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