{"title":"Data Mule Service for Mobile Ad-Hoc Networks","authors":"Mark Riordan, D. Grigoras","doi":"10.1109/ISPDC.2012.38","DOIUrl":null,"url":null,"abstract":"In service-driven mobile ad-hoc wireless networks (MANET), it is possible that due to mobility, the service requester (client) and the service provider are no longer in the same network when the service computation is completed, while they continue to be members of other mobile networks. Once the service is invoked and the computation is started, it is important to be able to eventually deliver the results to the requester. In this paper, we investigate the effectiveness of using highly mobile nodes as defined in service-driven MANET, as data mules. The hypothesis is that highly mobile nodes join a large number of networks and therefore have the best chance, among all nodes, to deliver the results to the requester. This is a best-effort solution that exploits the nodes' mobility and connectivity. The paper includes simulation results for scarce and dense MANETs and two different service computation durations.","PeriodicalId":287900,"journal":{"name":"2012 11th International Symposium on Parallel and Distributed Computing","volume":"130 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 11th International Symposium on Parallel and Distributed Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISPDC.2012.38","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4
Abstract
In service-driven mobile ad-hoc wireless networks (MANET), it is possible that due to mobility, the service requester (client) and the service provider are no longer in the same network when the service computation is completed, while they continue to be members of other mobile networks. Once the service is invoked and the computation is started, it is important to be able to eventually deliver the results to the requester. In this paper, we investigate the effectiveness of using highly mobile nodes as defined in service-driven MANET, as data mules. The hypothesis is that highly mobile nodes join a large number of networks and therefore have the best chance, among all nodes, to deliver the results to the requester. This is a best-effort solution that exploits the nodes' mobility and connectivity. The paper includes simulation results for scarce and dense MANETs and two different service computation durations.