Multi-Objective Task Allocation for Dynamic IoT Networks

Dominik Weikert, Christoph Steup, Sanaz Mostaghim
{"title":"Multi-Objective Task Allocation for Dynamic IoT Networks","authors":"Dominik Weikert, Christoph Steup, Sanaz Mostaghim","doi":"10.1109/COINS54846.2022.9854949","DOIUrl":null,"url":null,"abstract":"This paper proposes a Multi-Objective Optimization Algorithm for task allocation within dynamic Internet of Things (IoT) networks, which experience both device mobility and device failures. A prediction of future node positions is combined with a diversity-enhancing archiving mechanism, combining and improving upon task allocation optimization algorithms for mobile (Mobility-Aware Multi-Objective Task Allocation Algorithm) and error-prone (Availability-Aware Multi-Objective Task Allocation Algorithm) networks. Additionally, an elitism mechanism serves to preserve the most optimal solutions. The proposed algorithm is thus capable of optimizing task allocations in IoT networks throughout node failures while simultaneously accounting for future node positions. The proposed algorithm is evaluated on networks with different error rates and amounts of mobile nodes. The evaluation shows the improved performance regarding the metrics network lifetime, latency, and availability.","PeriodicalId":187055,"journal":{"name":"2022 IEEE International Conference on Omni-layer Intelligent Systems (COINS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE International Conference on Omni-layer Intelligent Systems (COINS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COINS54846.2022.9854949","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

This paper proposes a Multi-Objective Optimization Algorithm for task allocation within dynamic Internet of Things (IoT) networks, which experience both device mobility and device failures. A prediction of future node positions is combined with a diversity-enhancing archiving mechanism, combining and improving upon task allocation optimization algorithms for mobile (Mobility-Aware Multi-Objective Task Allocation Algorithm) and error-prone (Availability-Aware Multi-Objective Task Allocation Algorithm) networks. Additionally, an elitism mechanism serves to preserve the most optimal solutions. The proposed algorithm is thus capable of optimizing task allocations in IoT networks throughout node failures while simultaneously accounting for future node positions. The proposed algorithm is evaluated on networks with different error rates and amounts of mobile nodes. The evaluation shows the improved performance regarding the metrics network lifetime, latency, and availability.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
动态物联网网络的多目标任务分配
本文提出了一种多目标优化算法,用于动态物联网(IoT)网络中设备移动性和设备故障的任务分配。对未来节点位置的预测与增强多样性的归档机制相结合,结合并改进了移动(机动性感知多目标任务分配算法)和易出错(可用性感知多目标任务分配算法)网络的任务分配优化算法。此外,精英主义机制有助于保存最优的解决方案。因此,所提出的算法能够在节点故障时优化物联网网络中的任务分配,同时考虑到未来节点的位置。在具有不同错误率和不同移动节点数量的网络上对该算法进行了评估。评估显示了在网络生命周期、延迟和可用性方面的性能改进。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Security risks in MQTT-based Industrial IoT Applications Time and Energy trade-off analysis for Multi-Installment Scheduling with result retrieval strategy for Large Scale data processing GANIBOT: A Network Flow Based Semi Supervised Generative Adversarial Networks Model for IoT Botnets Detection COINS 2022 Cover Page Interference Recognition for Fog Enabled IoT Architecture using a Novel Tree-based Method
×
引用
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