Localized Hybrid Data Delivery Scheme using K-hop Clustering Algorithm in Ad Hoc Networks

In mobile ad hoc networks, as nodes move freely, network partitions occur frequently, which significantly degrades the performance of data access. Data replication is a promising approach to improve data availability in mobile ad hoc networks. In this paper, we propose a localized hybrid data delivery scheme that combines the push-based and the pull-based approaches. This scheme is constructed by implementing a localized clustering algorithm that constructs groups, in which each node is at most K hops away from a group leader. This construction permits to bind the query access delay by K hops. The localized clustering algorithm dynamically creates groups to adapt to topology changes. It can also predict when the group will partition. So, it can replicate data items on nodes of the future separate group before the partitioning occurs. The proposed localized scheme helps to increase data availability while improving query delay and update cost