Cluster Based Data Consistency for Cooperative Caching over Partitionable Mobile Adhoc Network

Abstract

Problem statement: Data availability and consistency are foremost issues in Mobile Ad hoc Networks due to the absence of permanent infrastructure. Cooperative caching addresses the data availability issue through coordinating the mobile nodes and sharing the cache copies among them. In the meantime, the mobile node must ensure the staleness of cache copies. The consistency maintenance resolves the staleness of the data among the source and caching node. Due to addition of more mobile nodes the network size is increased and it leads to increase the caching nodes. The mobility and disconnections causes additional overhead, latency and reduces the data delivery success ratio while updating the cache copy from the source. Approach: This study proposed Adaptive Push and Pull Algorithm for Clusters (APPC) and Cluster Based Data Consistency (CBDC) approach to address the consistency requirements and maintenance in mobile ad hoc network. Results: The CBDC satisfy the consistency requirements in partitioned clusters. The source node transmits the updated data through the cluster heads to the caching nodes. The APPC ensures the validity of cache copy by threshold Time-to-Live (TTL). Thus it provides efficient valid data accessibility in mobile ad hoc network. Conclusion: The simulation results shown that this proposed approach increases packet success ratio and reduces the delay and overhead when compared with the existing approaches Flexible Cache Consistency (FCPP) maintenance and Cluster Based Cooperative Caching Technique (CBCCT) for increasing number of nodes and speed respectively.