CLEAR: an efficient context and location-based dynamic replication scheme for mobile-p2p networks

  • Authors:
  • Anirban Mondal;Sanjay Kumar Madria;Masaru Kitsuregawa

  • Affiliations:
  • Institute of Industrial Science, University of Tokyo, Japan;Department of Computer Science, University of Missouri-Rolla;Institute of Industrial Science, University of Tokyo, Japan

  • Venue:
  • DEXA'06 Proceedings of the 17th international conference on Database and Expert Systems Applications
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

We propose CLEAR (Context and Location-based Efficient Allocation of Replicas), a dynamic replica allocation scheme for improving data availability in mobile ad-hoc peer-to-peer (M-P2P) networks. To manage replica allocation efficiently, CLEAR exploits user mobility patterns and deploys a super-peer architecture, which avoids both broadcast storm during replica allocation as well as broadcast-based querying. CLEAR considers different levels of replica consistency and load as replica allocation criteria. Our performance study indicates CLEAR's overall effectiveness in improving data availability in M-P2P networks.