New DTN Routing Algorithm
Routing in Delay Tolerant Networks is currently considered as one of the most attracting research areas. While several efforts have led to the introduction of different routing protocols for Delay Tolerant Networks, there are few approaches, which aimed to improve existing protocols. In this paper, we present a new algorithm based on the predictability concept since it introduces better resources management in terms of bandwidth, messages delivery compared to other routing algorithms for DTN. We prove by large-scale simulations, the effectiveness of our algorithm in terms of eventually delivered messages, failed transmissions, dropped messages between nodes, buffer time and hop count enhancement.
Keywords: Delay Tolerant Networks; routing; protocols; predictability; algorithms; ONE-Simulator
Download Full-Text
ABOUT THE AUTHORS
Mohammad Boudguig
Mohammad Boudguig IT Engineer graduated in 1998 from the University of applied Sciences of Dortmund / Germany. Microsoft certified systems engineer since 2000. PhD student at the doctoral studies center, Cadi ayyad University Marrakech / Morocco. His research interests are computer science,DTN Network
Abdelmounaïm Abdali
Faculty of Sciences and Technics Marrakech, Cadi Ayyad University, Marrakech, 40000, Morocco
Mohammad Boudguig
Mohammad Boudguig IT Engineer graduated in 1998 from the University of applied Sciences of Dortmund / Germany. Microsoft certified systems engineer since 2000. PhD student at the doctoral studies center, Cadi ayyad University Marrakech / Morocco. His research interests are computer science,DTN Network
Abdelmounaïm Abdali
Faculty of Sciences and Technics Marrakech, Cadi Ayyad University, Marrakech, 40000, Morocco
