A Discrete Adaptive Lion Optimization Algorithm for QoS-Driven IoT Service Composition with Global Constraints

IF 4.1 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
Souhila Ait Hacène Ouhadda, Samia Chibani Sadouki, Achour Achroufene, Abdelkamel Tari
{"title":"A Discrete Adaptive Lion Optimization Algorithm for QoS-Driven IoT Service Composition with Global Constraints","authors":"Souhila Ait Hacène Ouhadda, Samia Chibani Sadouki, Achour Achroufene, Abdelkamel Tari","doi":"10.1007/s10922-024-09808-w","DOIUrl":null,"url":null,"abstract":"<p>In an Internet of Things (IoT) environment, multiple objects usually interact with one another to meet a complex user’s request. This involves the composition of several atomic IoT services. Given a large number of functionally equivalent services with different Quality of Service (QoS) values, the service composition problem remains one of the main challenges in IoT environments. This paper presents a Discrete Adaptive Lion Optimization Algorithm (DALOA) to select IoT services in a composition process while considering global user QoS constraints. DALOA is based on the Lion Optimization Algorithm (LOA) and developed by combining several LOA operators, such as roaming, mating, and migration. First, DALOA divides the initial population into two sub-populations: pride and nomad, and each sub-population has its search strategies. Second, the roaming nomad process follows a random searching mode (strong exploration) to avoid being trapped in local optima. Third, the roaming pride searching mode represents strong local research, ensuring more efficient exploitation. Four, mating (mating pride, mating nomad) allows for information sharing between members of the same population. Finally, the migration operator is used to ensure population diversity by allowing information sharing between the pride and the nomad. The simulation results show that DALOA obtains the best compositional optimality and finds the near-optimal composition of the IoT services in a reasonable execution time compared to other approaches. Indeed, the combination of the previous operators provides a good trade-off between exploration and exploitation.</p>","PeriodicalId":50119,"journal":{"name":"Journal of Network and Systems Management","volume":"10 1","pages":""},"PeriodicalIF":4.1000,"publicationDate":"2024-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Network and Systems Management","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s10922-024-09808-w","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

In an Internet of Things (IoT) environment, multiple objects usually interact with one another to meet a complex user’s request. This involves the composition of several atomic IoT services. Given a large number of functionally equivalent services with different Quality of Service (QoS) values, the service composition problem remains one of the main challenges in IoT environments. This paper presents a Discrete Adaptive Lion Optimization Algorithm (DALOA) to select IoT services in a composition process while considering global user QoS constraints. DALOA is based on the Lion Optimization Algorithm (LOA) and developed by combining several LOA operators, such as roaming, mating, and migration. First, DALOA divides the initial population into two sub-populations: pride and nomad, and each sub-population has its search strategies. Second, the roaming nomad process follows a random searching mode (strong exploration) to avoid being trapped in local optima. Third, the roaming pride searching mode represents strong local research, ensuring more efficient exploitation. Four, mating (mating pride, mating nomad) allows for information sharing between members of the same population. Finally, the migration operator is used to ensure population diversity by allowing information sharing between the pride and the nomad. The simulation results show that DALOA obtains the best compositional optimality and finds the near-optimal composition of the IoT services in a reasonable execution time compared to other approaches. Indeed, the combination of the previous operators provides a good trade-off between exploration and exploitation.

Abstract Image

用于具有全局约束条件的 QoS 驱动型物联网服务组合的离散自适应狮子优化算法
在物联网(IoT)环境中,多个对象通常会相互影响,以满足用户的复杂要求。这涉及到多个原子物联网服务的组合。鉴于存在大量功能等同、服务质量(QoS)值不同的服务,服务组合问题仍然是物联网环境中的主要挑战之一。本文提出了一种离散自适应狮子优化算法(DALOA),用于在组合过程中选择物联网服务,同时考虑全局用户 QoS 约束。DALOA 以狮子优化算法(LOA)为基础,结合了多个 LOA 算子(如漫游、交配和迁移)而开发。首先,DALOA 将初始种群分为两个子种群:狮群和游牧群,每个子种群都有自己的搜索策略。其次,游牧过程遵循随机搜索模式(强探索),以避免陷入局部最优。第三,"骄傲 "的漫游搜索模式代表了强大的局部研究,确保更有效的开发。第四,交配(交配骄傲、交配游牧)允许同一种群成员之间共享信息。最后,迁移算子允许骄傲和游牧之间共享信息,从而确保种群多样性。模拟结果表明,与其他方法相比,DALOA 能获得最佳的优化组合,并能在合理的执行时间内找到接近最优的物联网服务组合。事实上,结合之前的运算符可以在探索和利用之间取得良好的平衡。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
7.60
自引率
16.70%
发文量
65
审稿时长
>12 weeks
期刊介绍: Journal of Network and Systems Management, features peer-reviewed original research, as well as case studies in the fields of network and system management. The journal regularly disseminates significant new information on both the telecommunications and computing aspects of these fields, as well as their evolution and emerging integration. This outstanding quarterly covers architecture, analysis, design, software, standards, and migration issues related to the operation, management, and control of distributed systems and communication networks for voice, data, video, and networked computing.
×
引用
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学术官方微信