{"title":"PERM: Performance Evaluated Routing Mechanism in Delay Tolerant Networks","authors":"P. Das, Pratik Bhattacharya, T. De","doi":"10.1109/ICBIM.2014.6970918","DOIUrl":null,"url":null,"abstract":"The Delay Tolerant Networks (DTNs) are special networks wherein no two nodes share any continuous or dedicated path. Nodes go up and down various times a day and do not behave in any prescribed or probabilistic manner. In such a scenario message flooding seems the easiest solution but it is a costly affair. Network connections being so abrupt, the chance of delivery of a message gets affected hugely by the strategy we use to flood the messages. Nevertheless we can try to find a method to this madness so that maximum messages get delivered by using as less message replications as possible. In this paper we propose a new system which will facilitate in more messages being delivered by trying to utilize the behavioral patterns of the nodes present in the network in an unbiased manner.","PeriodicalId":6549,"journal":{"name":"2014 2nd International Conference on Business and Information Management (ICBIM)","volume":"9 1","pages":"1-6"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 2nd International Conference on Business and Information Management (ICBIM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICBIM.2014.6970918","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4
Abstract
The Delay Tolerant Networks (DTNs) are special networks wherein no two nodes share any continuous or dedicated path. Nodes go up and down various times a day and do not behave in any prescribed or probabilistic manner. In such a scenario message flooding seems the easiest solution but it is a costly affair. Network connections being so abrupt, the chance of delivery of a message gets affected hugely by the strategy we use to flood the messages. Nevertheless we can try to find a method to this madness so that maximum messages get delivered by using as less message replications as possible. In this paper we propose a new system which will facilitate in more messages being delivered by trying to utilize the behavioral patterns of the nodes present in the network in an unbiased manner.