{"title":"具有时间约束的移动场景资源调度","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":"{\"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}","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}
Resource Scheduling for Mobility Scenarios with Time Constraints
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.