An energy-efficient Long HopHigh Priority Algorithm for IoT resource management

G. Deepa, R. Padma Priya, S. Priyadharshini, V. Sabarinath
{"title":"An energy-efficient Long HopHigh Priority Algorithm for IoT resource management","authors":"G. Deepa, R. Padma Priya, S. Priyadharshini, V. Sabarinath","doi":"10.1109/ICAECT54875.2022.9807937","DOIUrl":null,"url":null,"abstract":"In this modern era, the Internet of Things (IoT) is one of the hottest technologies which is growing day by day. There are many types of research still underway. Many aspects are yet to be improved for real-time applications. The main area focused in this work is the networking part of the IoT. Therefore there are chances for lots of problems during communication. One main problem is congestion. It may even break the network. So scheduling is done to avoid such situations. The proposed work deals with message scheduling in an IoT environment where the whole environment is divided into several subgroups and each group is headed with a master node called broker node which is responsible for sending the messages. Behind this broker node, a scheduling algorithm runs that decides which message should be sent first and when it should be sent. Many algorithms are existing such as SPTF, LH, FCFS, etc. To enhance the performance of the network a new algorithm named the Long Hop High Priority (LHHP) algorithm is proposed. In this algorithm, emergency messages are given high priority and long distances are taken into consideration, which improves the response time and turn-around time of the messages in an energy-efficient way.","PeriodicalId":346658,"journal":{"name":"2022 Second International Conference on Advances in Electrical, Computing, Communication and Sustainable Technologies (ICAECT)","volume":"92 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 Second International Conference on Advances in Electrical, Computing, Communication and Sustainable Technologies (ICAECT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICAECT54875.2022.9807937","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

In this modern era, the Internet of Things (IoT) is one of the hottest technologies which is growing day by day. There are many types of research still underway. Many aspects are yet to be improved for real-time applications. The main area focused in this work is the networking part of the IoT. Therefore there are chances for lots of problems during communication. One main problem is congestion. It may even break the network. So scheduling is done to avoid such situations. The proposed work deals with message scheduling in an IoT environment where the whole environment is divided into several subgroups and each group is headed with a master node called broker node which is responsible for sending the messages. Behind this broker node, a scheduling algorithm runs that decides which message should be sent first and when it should be sent. Many algorithms are existing such as SPTF, LH, FCFS, etc. To enhance the performance of the network a new algorithm named the Long Hop High Priority (LHHP) algorithm is proposed. In this algorithm, emergency messages are given high priority and long distances are taken into consideration, which improves the response time and turn-around time of the messages in an energy-efficient way.
一种面向物联网资源管理的高优先级算法
在当今时代,物联网(IoT)是日益发展的最热门技术之一。有许多类型的研究仍在进行中。对于实时应用,许多方面还有待改进。这项工作关注的主要领域是物联网的网络部分。因此,在沟通过程中有很多问题的机会。一个主要问题是交通拥堵。它甚至可能破坏网络。所以调度是为了避免这种情况。提议的工作处理物联网环境中的消息调度,其中整个环境分为几个子组,每个子组都有一个称为代理节点的主节点,负责发送消息。在这个代理节点后面,运行一个调度算法,决定应该首先发送哪个消息以及何时发送消息。现有很多算法,如SPTF、LH、FCFS等。为了提高网络的性能,提出了一种新的长跳高优先级(hlhp)算法。该算法将紧急消息的优先级提高,并考虑了较长的传输距离,以节能的方式提高了消息的响应时间和周转时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信