基于蚁群优化的物联网任务分配

Abderrahim Zannou, Abdelhak Boulaaam, E. Nfaoui
{"title":"基于蚁群优化的物联网任务分配","authors":"Abderrahim Zannou, Abdelhak Boulaaam, E. Nfaoui","doi":"10.1109/ISACS48493.2019.9068889","DOIUrl":null,"url":null,"abstract":"Internet of Things (IoT) is a paradigm provides a possibility to connect several heterogeneous Things/Devices into internet. The heterogeneity of those devices is a big challenge in terms of traffic heterogeneity and services requirements. Furthermore, for the network stability, several considerations must be taken into account in order to execute any task by any IoT node. More precisely, the nodes random tasks distribution leads to fail some nodes and also to reduce the network lifetime. A task can be composed at least of one subtask, which holds a collection of capabilities that must be verified to obtain a relevant service. In this contribution, an algorithm based on the Ant Colony Optimization (ACO) to address the IoT task allocation issues. We assume that each subtask has only one capability, and the goal is to distribute the task capabilities to the most competent nodes for reducing resource consumption of the network. The simulation result shows that our proposed algorithm is more efficient also adaptable in terms of the desired capabilities and the shortest path length.","PeriodicalId":312521,"journal":{"name":"2019 International Conference on Intelligent Systems and Advanced Computing Sciences (ISACS)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"A Task Allocation In IoT Using Ant Colony Optimization\",\"authors\":\"Abderrahim Zannou, Abdelhak Boulaaam, E. Nfaoui\",\"doi\":\"10.1109/ISACS48493.2019.9068889\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Internet of Things (IoT) is a paradigm provides a possibility to connect several heterogeneous Things/Devices into internet. The heterogeneity of those devices is a big challenge in terms of traffic heterogeneity and services requirements. Furthermore, for the network stability, several considerations must be taken into account in order to execute any task by any IoT node. More precisely, the nodes random tasks distribution leads to fail some nodes and also to reduce the network lifetime. A task can be composed at least of one subtask, which holds a collection of capabilities that must be verified to obtain a relevant service. In this contribution, an algorithm based on the Ant Colony Optimization (ACO) to address the IoT task allocation issues. We assume that each subtask has only one capability, and the goal is to distribute the task capabilities to the most competent nodes for reducing resource consumption of the network. The simulation result shows that our proposed algorithm is more efficient also adaptable in terms of the desired capabilities and the shortest path length.\",\"PeriodicalId\":312521,\"journal\":{\"name\":\"2019 International Conference on Intelligent Systems and Advanced Computing Sciences (ISACS)\",\"volume\":\"48 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 International Conference on Intelligent Systems and Advanced Computing Sciences (ISACS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISACS48493.2019.9068889\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 International Conference on Intelligent Systems and Advanced Computing Sciences (ISACS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISACS48493.2019.9068889","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

摘要

物联网(IoT)是一种范式,提供了将多个异构物/设备连接到互联网的可能性。这些设备的异构性在流量异构和业务需求方面是一个很大的挑战。此外,为了网络的稳定性,必须考虑几个因素,以便由任何物联网节点执行任何任务。更准确地说,节点的随机任务分布导致一些节点失效,也减少了网络的生命周期。一个任务至少可以由一个子任务组成,子任务包含一组必须经过验证才能获得相关服务的功能。本文提出了一种基于蚁群优化(ACO)的物联网任务分配算法。我们假设每个子任务只有一种能力,目标是将任务能力分配给最有能力的节点,以减少网络的资源消耗。仿真结果表明,本文提出的算法在性能和最短路径长度方面具有更高的效率和适应性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Task Allocation In IoT Using Ant Colony Optimization
Internet of Things (IoT) is a paradigm provides a possibility to connect several heterogeneous Things/Devices into internet. The heterogeneity of those devices is a big challenge in terms of traffic heterogeneity and services requirements. Furthermore, for the network stability, several considerations must be taken into account in order to execute any task by any IoT node. More precisely, the nodes random tasks distribution leads to fail some nodes and also to reduce the network lifetime. A task can be composed at least of one subtask, which holds a collection of capabilities that must be verified to obtain a relevant service. In this contribution, an algorithm based on the Ant Colony Optimization (ACO) to address the IoT task allocation issues. We assume that each subtask has only one capability, and the goal is to distribute the task capabilities to the most competent nodes for reducing resource consumption of the network. The simulation result shows that our proposed algorithm is more efficient also adaptable in terms of the desired capabilities and the shortest path length.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信