{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T16:37:12Z","timestamp":1781109432065,"version":"3.54.1"},"reference-count":38,"publisher":"IGI Global Scientific Publishing","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,4,1]]},"abstract":"<p>This paper proposes CADRE (Collaborative Allocation and De-allocation of Replicas with Efficiency), which is a dynamic replication scheme for improving the typically low data availability in dedicated and cooperative mobile ad-hoc peer-to-peer (M-P2P) networks. In particular, replica allocation and de-allocation are collaboratively performed in tandem to facilitate effective replication. Such collaboration is facilitated by a hybrid super-peer architecture in which some of the mobile hosts act as the \u2018gateway nodes\u2019 (GNs) in a given region. GNs facilitate both search and replication. The main contributions of CADRE are as follows. First, it facilitates the prevention of \u2018thrashing\u2019 conditions due to its collaborative replica allocation and de-allocation mechanism. Second, it considers the replication of images at different resolutions to optimize the usage of the generally limited memory space of the mobile hosts (MHs). Third, it addresses fair replica allocation across the MHs. Fourth, it facilitates the optimization of the limited energy resources of MHs during replication. The authors\u2019 performance evaluation demonstrates that CADRE is indeed effective in improving data availability in M-P2P networks with significant reduction in query response times and low communication traffic during replication as compared to a recent existing scheme as well as a baseline approach, which does not consider any replication.<\/p>","DOI":"10.4018\/jhcr.2010040105","type":"journal-article","created":{"date-parts":[[2010,6,30]],"date-time":"2010-06-30T16:54:53Z","timestamp":1277916893000},"page":"75-97","source":"Crossref","is-referenced-by-count":0,"title":["A Collaborative Replication Approach for Mobile-P2P Networks"],"prefix":"10.4018","volume":"1","author":[{"given":"Anirban","family":"Mondal","sequence":"first","affiliation":[{"name":"Indraprastha Institute of Information Technology, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sanjay","family":"Kumar Madria","sequence":"additional","affiliation":[{"name":"University of Missouri-Rolla, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Masaru","family":"Kitsuregawa","sequence":"additional","affiliation":[{"name":"Institute of Industrial Science, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"jhcr.2010040105-0","doi-asserted-by":"crossref","unstructured":"Bhagwan, R., Moore, D., Savage, S., & Voelker, G. M. (2003). Replication strategies for highly available peer-to-peer storage. In Proceedings of the Future Directions in Distributed Computing.","DOI":"10.1007\/3-540-37795-6_28"},{"key":"jhcr.2010040105-1","doi-asserted-by":"crossref","unstructured":"Broch, J., Maltz, D. A., Johnson, D. B., Hu, Y. C., & Jetcheva, J. (1998). A performance comparison of multi-hop wireless ad hoc network routing protocol. In Proceedings of the MOBICOM (pp. 159-164).","DOI":"10.1145\/288235.288256"},{"key":"jhcr.2010040105-2","unstructured":"Buttyan, L., & Hubaux, J. P. (2001). Nuglets: a virtual currency to stimulate cooperation in self-organized mobile ad hoc networks (Tech. Rep. No. DSC\/2001\/001). Lausanne, Switzerland: Swiss Federal Institute of Technology."},{"issue":"5","key":"jhcr.2010040105-3","doi-asserted-by":"crossref","DOI":"10.1023\/A:1025146013151","article-title":"Stimulating cooperation in self-organizing mobile ad hoc networks. ACM\/Kluwer","volume":"8","author":"L.Buttyan","year":"2003","journal-title":"Mobile Networks and Applications"},{"key":"jhcr.2010040105-4","doi-asserted-by":"crossref","unstructured":"Carpentieri, B., Weinberger, M., & Seroussi, G. (2000). Lossless compression of continuous-tone images. In Proceedings of the IEEE.","DOI":"10.1109\/5.892715"},{"key":"jhcr.2010040105-5","doi-asserted-by":"crossref","unstructured":"Chen, K., & Nahrstedt, K. (2004). iPass: an incentive compatible auction scheme to enable packet forwarding service in MANET. In Proceedings of the ICDCS.","DOI":"10.1109\/ICDCS.2004.1281620"},{"key":"jhcr.2010040105-6","unstructured":"Compression. (n.d.). Retrieved from http:\/\/compression.ca\/act\/"},{"key":"jhcr.2010040105-7","doi-asserted-by":"crossref","unstructured":"Crowcroft, J., Gibbens, R., Kelly, F., & Ostring, S. (2003). Modelling incentives for collaboration in mobile ad hoc networks. In Proceedings of the WiOpt.","DOI":"10.1016\/S0166-5316(04)00031-8"},{"key":"jhcr.2010040105-8","doi-asserted-by":"crossref","unstructured":"Datta, A., Hauswirth, M., & Aberer, K. (2003). Updates in highly unreliable replicated peer-to-peer systems. In Proceedings of the ICDCS.","DOI":"10.1109\/ICDCS.2003.1203454"},{"key":"jhcr.2010040105-9","doi-asserted-by":"crossref","unstructured":"Ferguson, D. F., Nikolaou, C., & Yemini, Y. (1993). An economy for managing replicated data in autonomous decentralized systems. In Proceedings of the International Symposium in Autonomous Decentralized Systems (pp. 367-375).","DOI":"10.1109\/ISADS.1993.262681"},{"key":"jhcr.2010040105-10","doi-asserted-by":"crossref","unstructured":"Ferguson, D. F., Yemini, Y., & Nikolaou, C. (1988). Microeconomic algorithms for load balancing in distributed computer systems. In Proceedings of the ICDCS (pp. 491-499).","DOI":"10.1109\/DCS.1988.12552"},{"issue":"2","key":"jhcr.2010040105-11","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1145\/776985.776991","article-title":"Research issues for data communication in mobile ad-hoc network database systems.","volume":"32","author":"L. D.Fife","year":"2003","journal-title":"SIGMOD Record"},{"key":"jhcr.2010040105-12","doi-asserted-by":"crossref","unstructured":"Golle, P., Brown, K. L., & Mironov, I. (2001). Incentives for sharing in peer-to-peer networks. In Proceedings of the Electronic Commerce.","DOI":"10.1145\/501158.501193"},{"key":"jhcr.2010040105-13","doi-asserted-by":"crossref","unstructured":"Guy, R., Reiher, P., Ratner, D., Gunter, M., Ma, W., & Popek, G. (1998). Rumor: Mobile data access through optimistic peer-to-peer replication. In Proceedings of the ER Workshops.","DOI":"10.1007\/978-3-540-49121-7_22"},{"key":"jhcr.2010040105-14","first-page":"125","article-title":"ARA: A robust audit to prevent free-riding in P2P networks. In","volume":"2P","author":"M.Ham","year":"2005","journal-title":"Proceedings of the P"},{"key":"jhcr.2010040105-15","doi-asserted-by":"crossref","unstructured":"Hara, T., & Madria, S. K. (2005). Consistency management among replicas in peer-to-peer mobile ad hoc networks. In Proceedigns of the IEEE SRDS.","DOI":"10.1109\/RELDIS.2005.12"},{"key":"jhcr.2010040105-16","author":"T.Hara","year":"2006","journal-title":"Data replication for improving data accessibility in ad hoc networks"},{"key":"jhcr.2010040105-17","doi-asserted-by":"crossref","unstructured":"Huang, Y., Sistla, A. P., & Wolfson, O. (1994) Data replication for mobile computers. In Proceedings of the ACM SIGMOD.","DOI":"10.1145\/191839.191845"},{"key":"jhcr.2010040105-18","doi-asserted-by":"crossref","unstructured":"Kamvar, S., Schlosser, M., & Garcia-Molina, H. (2003). Incentives for combatting free-riding on P2P networks. In Proceedigns of the Euro-Par.","DOI":"10.1007\/978-3-540-45209-6_171"},{"key":"jhcr.2010040105-19","unstructured":"Kazaa. (n.d.). Retrieved from http:\/\/www.kazaa.com\/."},{"key":"jhcr.2010040105-20","doi-asserted-by":"crossref","unstructured":"Kemme, B. (2002). Implementing database replication based on group communication. In Proceedings of the Future Directions in Distributed Computing.","DOI":"10.1007\/3-540-37795-6_24"},{"key":"jhcr.2010040105-21","doi-asserted-by":"crossref","unstructured":"Kemme, B., & Alonso, G. (2000). A new approach to developing and implementing eager database replication protocols. ACM TODS, 25(3).","DOI":"10.1145\/363951.363955"},{"issue":"5","key":"jhcr.2010040105-22","doi-asserted-by":"crossref","first-page":"705","DOI":"10.1109\/12.24272","article-title":"A microeconomic approach to optimal resource allocation in distributed computer systems.","volume":"38","author":"J. F.Kurose","year":"1989","journal-title":"IEEE Transactions on Computers"},{"key":"jhcr.2010040105-23","doi-asserted-by":"crossref","unstructured":"Liebau, N., Darlagiannis, V., Heckmann, O., & Steinmetz, R. (2005). Asymmetric incentives in peer-to-peer systems. In Proceedings of the AMCIS.","DOI":"10.1007\/11530657_32"},{"key":"jhcr.2010040105-24","doi-asserted-by":"crossref","unstructured":"Liu, J., & Issarny, V. (2004). Service allocation in selfish mobile ad hoc networks using Vickrey auction. In Proceedings of the Current Trends in Database Technology - EDBT (LNCS 3268).","DOI":"10.1007\/978-3-540-30192-9_38"},{"key":"jhcr.2010040105-25","doi-asserted-by":"crossref","unstructured":"Mondal, A., Madria, S. K., & Kitsuregawa, M. (2006). CLEAR: An efficient context and location-based dynamic replication scheme for mobile-P2P networks. In Proceedings of the DEXA.","DOI":"10.1007\/11827405_39"},{"key":"jhcr.2010040105-26","unstructured":"Papadimos, V., Maier, D., & Tufte, K. (2003). Distributed query processing and catalogs for peer-to-peer systems. In Proceedings of the CIDR."},{"key":"jhcr.2010040105-27","doi-asserted-by":"crossref","unstructured":"Pitoura, E. (1996). A replication scheme to support weak connectivity in mobile information systems. In Proceedings of the DEXA.","DOI":"10.1007\/BFb0034706"},{"issue":"6","key":"jhcr.2010040105-28","doi-asserted-by":"crossref","DOI":"10.1023\/A:1011862121702","article-title":"Replication requirements in mobile environments.","volume":"6","author":"D.Ratner","year":"2001","journal-title":"Mobile Networks and Applications"},{"key":"jhcr.2010040105-29","doi-asserted-by":"crossref","unstructured":"Richard, B., Nioclais, D., & Chalon, D. (2003). Clique: A transparent, peer-to-peer replicated file system. In Proceedings of the MDM.","DOI":"10.1007\/3-540-36389-0_27"},{"key":"jhcr.2010040105-30","unstructured":"Saroiu, S., Gummadi, P. K., & Gribbler, S. D. (2002). A measurement study of peer-to-peer file sharing systems. In Proceedings of the MMCN."},{"key":"jhcr.2010040105-31","doi-asserted-by":"crossref","unstructured":"Srinivasan, V., Nuggehalli, P., Chiasserini, C. F., & Rao, R. R. (2003). Cooperation in wireless ad hoc networks. In Proceedings of the INFOCOM.","DOI":"10.1109\/INFCOM.2003.1208918"},{"key":"jhcr.2010040105-32","doi-asserted-by":"crossref","unstructured":"Stoica, I., Morris, R., Karger, D., Kaashoek, M. F., & Balakrishnan, H. (2001). Chord: A scalable peer-to-peer lookup service for internet applications. In Proceedings of the ACM SIGCOMM.","DOI":"10.1145\/383059.383071"},{"issue":"4","key":"jhcr.2010040105-33","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1145\/249978.249982","article-title":"An adaptive data replication algorithm.","volume":"22","author":"O.Wolfson","year":"1997","journal-title":"ACM TODS"},{"key":"jhcr.2010040105-34","doi-asserted-by":"crossref","unstructured":"Wolfson, O., Xu, B., & Sistla, A. P. (2004). An economic model for resource exchange in mobile Peer-to-Peer networks. In Proceedings of the SSDBM.","DOI":"10.1109\/SSDM.2004.1311215"},{"key":"jhcr.2010040105-35","unstructured":"Xu, B., Wolfson, O., & Rishe, N. (2006). Benefit and pricing of spatio-temporal information in Mobile Peer-to-Peer networks. In Proceedings of the HICSS-39."},{"key":"jhcr.2010040105-36","doi-asserted-by":"crossref","unstructured":"Xue, Y., Li, B., & Nahrstedt, K. (2005). Channel-relay price pair: Towards arbitrating incentives in wireless ad hoc networks. Journal of Wireless Communications and Mobile Computing.","DOI":"10.1002\/wcm.383"},{"key":"jhcr.2010040105-37","author":"Y.Xue","year":"2005","journal-title":"Optimal resource allocation in wireless ad hoc networks: A price-based approach"}],"container-title":["International Journal of Handheld Computing Research"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=43605","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T20:44:26Z","timestamp":1654116266000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/jhcr.2010040105"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2010,4,1]]},"references-count":38,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,4]]}},"URL":"https:\/\/doi.org\/10.4018\/jhcr.2010040105","relation":{},"ISSN":["1947-9158","1947-9166"],"issn-type":[{"value":"1947-9158","type":"print"},{"value":"1947-9166","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,4,1]]}}}