{"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}
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.