{"title":"Opportunistic Networks: End-to-End Performance Analysis","authors":"Rodrigo M. Santos, J. Orozco","doi":"10.1109/SBESC.2011.46","DOIUrl":null,"url":null,"abstract":"In this paper, a real-time analysis of opportunistic networks is done. The worst case end-to-end delay is presented when there are special nodesnamed mules that are periodic and follow a fixed and known path. Necessaryand sufficient conditions for the schedulability of the system are presented sodeadlines can be guaranteed.","PeriodicalId":147899,"journal":{"name":"2011 Brazilian Symposium on Computing System Engineering","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 Brazilian Symposium on Computing System Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SBESC.2011.46","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
In this paper, a real-time analysis of opportunistic networks is done. The worst case end-to-end delay is presented when there are special nodesnamed mules that are periodic and follow a fixed and known path. Necessaryand sufficient conditions for the schedulability of the system are presented sodeadlines can be guaranteed.