Routing Framework for Delay Tolerant Networks using BayesiaLab
Journal Title: IOSR Journals (IOSR Journal of Computer Engineering) - Year 2014, Vol 16, Issue 1
Abstract
Routing in delay tolerant networks (DTN) can benefit from the fact that most real life DTN, especially in the context of people-centric networks (e.g. Pocket Switching Networks (PSN)), exhibit some sort of periodicity in their mobility patterns. For example, public transportation networks follow periodic schedules. Even most individuals have fairly repetitive movement patterns, for example, driving to and from work at approximately the same time everyday. This paper proposes a BayesiaLab tool based DTN routing framework that adopts a methodical approach for computing the routing metrics by utilizing the network parameters (e.g. spatial and temporal information at the time of packet forwarding) that capture the periodic behavior of DTN nodes. After the calculation of routing metrics, different routing instantiations are possible based on this framework. We simulate a real-world vehicular DTN network using mobility traces from a metropolitan public transportation bus network and demonstrate that even a simplistic single-copy forwarding scheme based on our framework outperforms existing gradient-based single copy schemes by 25% in terms of delivery ratio.To the best of our knowledge this work is one of the first studies that adopts Bayesian inference in the context of DTN routing.
Authors and Affiliations
B. Sujatha
Keywords
Related Articles
- EP ID EP136440
- DOI -
- Views 101
- Downloads 0
Auto Mutating Cryptosystem- An approach towards better security
Abstract: The concept of learning systems has been an intriguing one since first appearance of Artificial Intelligence (AI) in literature. With the progress in each decade of research, new systems have been developed to...
Efficient Algorithm for Mining High Utility Itemsets from Large Datasets Using Vertical Approach
Abstract: High Utility Itemset Mining is a challenging task as the Downward Closure Property present in frequent itemset mining does not hold here. In recent times many algorithms have been proposed for mining high utili...
A Clustered Based Novel Approach of Graph Coloring
Abstract: An efficient graph coloring algorithm is proposed in this research paper that uses less number of colors for a graph coloring problem. The proposed algorithm is applicable for all types of graph. The algo...
Modulo Search Trees (Plain and Z-Overlapped)
Abstract: This paper exploits the modulo division operation to construct a tree which is termed as Modulo search tree with two versions out of which one is coined as Plain Modulo Search Tree and the other is termed...
Automated histopathological image analysis: a review on ROI extraction
Abstract: This review paper deals with the latest technology developed on computer assisted analysis for histopathology images. The process for locating, analyzing and classification of lethal diseases like cancer, using...