An analytical model for deploying mobile sinks in industrial Internet of Things

M. Vahabi, H. Faragardi, H. Fotouhi
{"title":"An analytical model for deploying mobile sinks in industrial Internet of Things","authors":"M. Vahabi, H. Faragardi, H. Fotouhi","doi":"10.1109/WCNCW.2018.8368986","DOIUrl":null,"url":null,"abstract":"Nowadays, the Industrial Internet of Things (IIoT) has the potential to be implemented in factories and supply chains to improve manufacturing efficiency. It is becoming more common to use mobile robots in such factories for further improvements. Adding data collection capability to the mobile robots would realize the mobile sink deployment in future factories. As it is important to reduce the deployment cost, we are aiming at a network with minimum number of mobile sinks while ensuring network reliability and timeliness. In this paper, we analytically model a given trajectory for the motion of mobile sinks and the routing of mobile sinks along the trajectory in an IIoT system. We introduce an optimization problem in the form of Integer Linear Programming (ILP) to specify the minimum number of required mobile sinks to reduce deployment cost of an IIoT system, and also to identify the routing of multiple mobile sinks along a given trajectory. The proposed ILP model can be solved by several existing off-the-shelf ILP-solvers.","PeriodicalId":122391,"journal":{"name":"2018 IEEE Wireless Communications and Networking Conference Workshops (WCNCW)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE Wireless Communications and Networking Conference Workshops (WCNCW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WCNCW.2018.8368986","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

Nowadays, the Industrial Internet of Things (IIoT) has the potential to be implemented in factories and supply chains to improve manufacturing efficiency. It is becoming more common to use mobile robots in such factories for further improvements. Adding data collection capability to the mobile robots would realize the mobile sink deployment in future factories. As it is important to reduce the deployment cost, we are aiming at a network with minimum number of mobile sinks while ensuring network reliability and timeliness. In this paper, we analytically model a given trajectory for the motion of mobile sinks and the routing of mobile sinks along the trajectory in an IIoT system. We introduce an optimization problem in the form of Integer Linear Programming (ILP) to specify the minimum number of required mobile sinks to reduce deployment cost of an IIoT system, and also to identify the routing of multiple mobile sinks along a given trajectory. The proposed ILP model can be solved by several existing off-the-shelf ILP-solvers.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
工业物联网中移动sink部署的分析模型
如今,工业物联网(IIoT)有可能在工厂和供应链中实施,以提高制造效率。为了进一步改进,在这些工厂中使用移动机器人正变得越来越普遍。为移动机器人增加数据采集能力,将实现未来工厂的移动水槽部署。考虑到降低部署成本的重要性,我们的目标是在保证网络可靠性和时效性的同时,使移动sink的数量最少。在本文中,我们对IIoT系统中移动sink的运动和移动sink沿轨迹路由的给定轨迹进行了解析建模。我们以整数线性规划(ILP)的形式引入了一个优化问题,以指定所需移动接收器的最小数量,以降低IIoT系统的部署成本,并确定沿给定轨迹的多个移动接收器的路由。所提出的ILP模型可以通过几个现有的现成的ILP求解器来求解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Siren: A platform for deploying virtual network services in the cloud to Fog continuum Good neighbor distributed beam scheduling in coexisting multi-RAT networks Service orchestration and federation for verticals An accelerometer lossless compression algorithm and energy analysis for IoT devices Socially-aware content delivery for device-to-device communications underlay cellular networks
×
引用
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