{"title":"Data Transfer in Delay-Tolerant Networks","authors":"Ronan Bocquillon, A. Jouglet","doi":"10.1109/BWCCA.2013.62","DOIUrl":null,"url":null,"abstract":"Delay-Tolerant Networking (DTN) is a promising approach to address main issues arising from unusual networks which are subject to frequent partitioning (due to node mobility and other factors), e.g. drones and satellites networks. In such situations, routing follows the well known store-carry-forward paradigm since an end-to-end path between two nodes is never guaranteed to exist. We assume reliable predictions can be made about node mobility, and therefore study a deterministic problem aiming at profiting from this knowledge to compute an efficient data dissemination strategy. In this paper, we describe our research works in the more general framework of systems of systems (SoS). We notably propose to tackle a first simple case for which we provide dominance-rule-based resolution techniques.","PeriodicalId":227978,"journal":{"name":"2013 Eighth International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 Eighth International Conference on Broadband and Wireless Computing, Communication and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BWCCA.2013.62","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
Delay-Tolerant Networking (DTN) is a promising approach to address main issues arising from unusual networks which are subject to frequent partitioning (due to node mobility and other factors), e.g. drones and satellites networks. In such situations, routing follows the well known store-carry-forward paradigm since an end-to-end path between two nodes is never guaranteed to exist. We assume reliable predictions can be made about node mobility, and therefore study a deterministic problem aiming at profiting from this knowledge to compute an efficient data dissemination strategy. In this paper, we describe our research works in the more general framework of systems of systems (SoS). We notably propose to tackle a first simple case for which we provide dominance-rule-based resolution techniques.