{"title":"基于节点移动性和最大复制数的增强型喷雾等待DTN路由协议","authors":"Kenta Henmi, A. Koyama","doi":"10.1504/IJAIS.2014.061045","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 rate compared with conventional methods.","PeriodicalId":383612,"journal":{"name":"International Journal of Adaptive and Innovative Systems","volume":"188 3-4","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"An enhanced spray and wait DTN routing protocol based on node mobility and maximum number of replications\",\"authors\":\"Kenta Henmi, A. Koyama\",\"doi\":\"10.1504/IJAIS.2014.061045\",\"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 rate compared with conventional methods.\",\"PeriodicalId\":383612,\"journal\":{\"name\":\"International Journal of Adaptive and Innovative Systems\",\"volume\":\"188 3-4\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-05-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Adaptive and Innovative Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1504/IJAIS.2014.061045\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Adaptive and Innovative Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/IJAIS.2014.061045","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4
摘要
Spray and wait协议是DTN (delay/disruption/disconnection tolerance network)中典型的路由协议,它通过设置每条消息的最大复制数来限制复制的数量。但是,很难预先设置合适的最大复制数。此外,有可能复制到对数据到达没有贡献的节点,因为没有选择适当的复制节点。本文提出了一种根据网络状态动态设置适当复制的最大数量并选择适当中继节点的路由方法。仿真结果表明,与传统方法相比,该方法具有较高的分组传输速率。
An enhanced spray and wait DTN routing protocol based on node mobility and maximum number of replications
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 rate compared with conventional methods.