{"title":"A DTN Routing Protocol Based on Mobility and Maximum Number of Replications","authors":"Kenta Henmi, A. Koyama","doi":"10.1109/CISIS.2013.54","DOIUrl":null,"url":null,"abstract":"Spray and Wait protocol, which is a typical routing protocol in Delay/Disruption/Disconnection Tolerant Network (DTN), sets a maximum number of replications per message for restricting a number of replications. However, it is difficult to set a maximum number of appropriate replications in advance. Moreover, there is possibility to replicate to nodes that do not contribute to the data arrival, because appropriate replicated nodes are not selected. In this paper, we propose a routing method to dynamically set the maximum number of appropriate replications depending on network states and to select appropriate relay nodes. We verified by simulation that the proposed method has high packet delivery ratio compared with conventional methods.","PeriodicalId":155467,"journal":{"name":"2013 Seventh International Conference on Complex, Intelligent, and Software Intensive Systems","volume":"45 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 Seventh International Conference on Complex, Intelligent, and Software Intensive Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CISIS.2013.54","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6
Abstract
Spray and Wait protocol, which is a typical routing protocol in Delay/Disruption/Disconnection Tolerant Network (DTN), sets a maximum number of replications per message for restricting a number of replications. However, it is difficult to set a maximum number of appropriate replications in advance. Moreover, there is possibility to replicate to nodes that do not contribute to the data arrival, because appropriate replicated nodes are not selected. In this paper, we propose a routing method to dynamically set the maximum number of appropriate replications depending on network states and to select appropriate relay nodes. We verified by simulation that the proposed method has high packet delivery ratio compared with conventional methods.