Abstract
A delay tolerant network (DTN) realizes a message exchange among mobile terminals without static communication network structures. However, current probability-based DTN routing algorithms do not accurately take into account the selection of messages that should be forwarded to other terminals. This often produces many redundant messages in the field, and causes an overflow in message buffer at each terminal. In this paper, we propose a DTN routing algorithm that controls message forwarding in each terminal using parameters named “Community” and “Centrality.” According to the evaluation considering real situations, our routing algorithm reduces 86% of redundant messages, compared to the epidemic routing algorithm, without compromising on the quality of the message delivery among the mobile terminals.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
