Memory Forwarding Algorithm in Multiple Communities Delay Tolerant Networks

Authors:
Qingshan Wang;Qi Wang
Affiliations:
School of Mathematics, Hefei University of Technology, Hefei, China 230009 and Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, China 210093;School of Mathematics, Hefei University of Technology, Hefei, China 230009 and Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, China 210093
Venue:
Wireless Personal Communications: An International Journal
Year:
2014

Citing 9
Cited 0

A delay-tolerant network architecture for challenged internets

Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Probabilistic routing in intermittently connected networks

ACM SIGMOBILE Mobile Computing and Communications Review
DakNet: Rethinking Connectivity in Developing Nations

Computer
A new networking model for biological applications of ad hoc sensor networks

IEEE/ACM Transactions on Networking (TON)
Impact of Human Mobility on Opportunistic Forwarding Algorithms

IEEE Transactions on Mobile Computing
Practical Routing in Delay-Tolerant Networks

IEEE Transactions on Mobile Computing
DTN routing as a resource allocation problem

Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Efficient routing in intermittently connected mobile networks: the multiple-copy case

IEEE/ACM Transactions on Networking (TON)
Peoplerank: social opportunistic forwarding

INFOCOM'10 Proceedings of the 29th conference on Information communications

Quantified Score

Hi-index	0.00

Visualization

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.