Ioannis Komnios, Sotirios Diamantopoulos, V. Tsaoussidis
{"title":"Evaluation of dynamic DTN routing protocols in space environment","authors":"Ioannis Komnios, Sotirios Diamantopoulos, V. Tsaoussidis","doi":"10.1109/IWSSC.2009.5286392","DOIUrl":null,"url":null,"abstract":"As the number of space elements increases, routing becomes an issue of great interest. The majority of routing schemes that have been proposed till now, employ a fairly static design and, only recently, more sophisticated protocols have been introduced. In this study, we evaluate some of the most prominent routing protocols for Delay-Tolerant Networks, Epidemic, PRoPHET and Contact Graph Routing, in space environment. Using COMNET Lab's DTN testbed, we show that for increasing delay, Contact Graph Routing significantly outperforms the other two routing schemes.","PeriodicalId":137431,"journal":{"name":"2009 International Workshop on Satellite and Space Communications","volume":"49 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 International Workshop on Satellite and Space Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IWSSC.2009.5286392","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11
Abstract
As the number of space elements increases, routing becomes an issue of great interest. The majority of routing schemes that have been proposed till now, employ a fairly static design and, only recently, more sophisticated protocols have been introduced. In this study, we evaluate some of the most prominent routing protocols for Delay-Tolerant Networks, Epidemic, PRoPHET and Contact Graph Routing, in space environment. Using COMNET Lab's DTN testbed, we show that for increasing delay, Contact Graph Routing significantly outperforms the other two routing schemes.