首页 | 本学科首页   官方微博 | 高级检索  
     


Memory Forwarding Algorithm in Multiple Communities Delay Tolerant Networks
Authors:Qingshan Wang  Qi Wang
Affiliation:1. School of Mathematics, Hefei University of Technology, Hefei, 230009, China
2. Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, 210093, China
Abstract:The routing is one of the key problems in delay tolerant networks (DTNs) because the source and destination often could not find a contemporaneous end-to-end path. In this paper, with the objective of reducing the number of copies, we propose two corresponding routings including a memory forwarding algorithm (MFA) and an extended memory forwarding algorithm (EMFA) for the specific type of node placement in DTNs where the nodes are randomly located and moved at different communities. The main idea of our algorithms are that the node copies a packet to an encountering node or not based on the relationship of their and the destination’s community locations calculated from the memory table, and they are designed for small and moderate number of communities respectively. We then state and analyze the expected number of copies of our algorithms. Simulation results reveal that MFA and EMFA can apparently decrease the number of copies and achieve comparable delivery delays compared with the classic multi-copy routings.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号