Efficient Routing using Partitive Clustering Algorithms in Ferry-based Delay Tolerant Networks

Abstract

The Delay Tolerant Networks (DTNs) generally contain relatively sparse nodes that are frequently disconnected. Message Ferrying (MF) is a mobility-assisted approach which utilizes a set of mobile elements to provide communication service in ferry-based DTNs. In this paper, we propose a Density-Aware Route Design (DARD) algorithm using partitive clustering algorithms along a validity index for identifying the suitable node clusters and assigning ferries to these clusters. In the proposed algorithm, unlike using multiple ferries in a single route (SIRA algorithm) or dividing the deployment area into grid as static (NRA and FRA algorithms), the manner of node’s distribution and their density in network are regarded as clustering metric. Evaluation results for comparing our scheme with existing routing algorithms demonstrate that DARD either minimizes message delivery delay or by preserving message delay, it reduces resource requirements in both ferries and nodes resulting in increasing ferries efficiency.