Resource Scheduling for Mobility Scenarios with Time Constraints

Marcelo Petri, Janine Kniess, R. S. Parpinelli
{"title":"Resource Scheduling for Mobility Scenarios with Time Constraints","authors":"Marcelo Petri, Janine Kniess, R. S. Parpinelli","doi":"10.1109/CLEI.2018.00030","DOIUrl":null,"url":null,"abstract":"This paper presents an approach for resource scheduling in service discovery to MANETs operating in cenarios with time constraints, as emergency scenarios. The shared resources can be ambulances or rescue cars. With an efficient model of resource scaling, it is intended to provide the largest number of victims in the shortest time. In this work, we present an approach for resource scheduling modeled based on two concepts: Genetic Algorithm and A-Star Algorithm. The results obtained from the Network Simulator (NS3) show that the resource scheduling mechanism is efficient in response time and scalable in relation to different numbers of victims.","PeriodicalId":379986,"journal":{"name":"2018 XLIV Latin American Computer Conference (CLEI)","volume":"159 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 XLIV Latin American Computer Conference (CLEI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CLEI.2018.00030","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

This paper presents an approach for resource scheduling in service discovery to MANETs operating in cenarios with time constraints, as emergency scenarios. The shared resources can be ambulances or rescue cars. With an efficient model of resource scaling, it is intended to provide the largest number of victims in the shortest time. In this work, we present an approach for resource scheduling modeled based on two concepts: Genetic Algorithm and A-Star Algorithm. The results obtained from the Network Simulator (NS3) show that the resource scheduling mechanism is efficient in response time and scalable in relation to different numbers of victims.
具有时间约束的移动场景资源调度
本文提出了一种在紧急情况下运行的多网服务发现中的资源调度方法。共享的资源可以是救护车或救援车。利用高效的资源扩展模型,在最短的时间内提供最多的受害者。本文提出了一种基于遗传算法和A-Star算法的资源调度模型。在网络模拟器(NS3)上的实验结果表明,该资源调度机制在响应时间上是有效的,并且针对不同的受害者数量具有可扩展性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信