RBCRP: A Routing Approach Based on Crowded Rendezvous Points in Delay Tolerant Networks

Recently Delay Tolerant Networks (DTNs) have been a successful paradigm especially for the network environments where the nodes are characterized by opportunistic connectivity. These networks are used in the environments where suffer from the lack of infrastructure. Finding the best routing strategy in order to forwarding the bundles have been a challenging issue in DTNs . In this paper we propose a new DTN routing algorithm called Routing Based on Crowded Rendezvous Points (RBCRP). The proposed algorithm, at first divides the network into different regions, and then associates an extra node named rendezvous point (RP) as crowded place for each region. Each source node upon sending a bundle to a given destination, checks the PRs of the contingent areas in order to deliver the bundle to the destination. If this check fails, the bundle will be sent to the PRs of all areas. Using PRs in this way will results in reducing the network overhead due to controlling the number of distributed messages. In addition, using the proposed approach, the nodes of the network will not require large quantities of memory for data buffering. Simulation results show that RBCRP algorithm significantly improves packet delivery rate and also reduces the overhead of the system.