Hybrid information retrieval policies based on
cooperative cache in mobile P2P networks

doi:10.1007/s11704-009-0055-x

Front. Comput. Sci.

2009, Vol. 3

Issue (3) : 381-395 https://doi.org/10.1007/s11704-009-0055-x

Research articles

Hybrid information retrieval policies based on cooperative cache in mobile P2P networks

Quanqing XU ¹, Bin CUI ¹, Yafei DAI ¹, Hengtao SHEN ², Zaiben CHEN ², Xiaofang ZHOU ²,

1.State Key Lab for Advanced Optical Communication System & Networks, Peking University, Beijing 100871, China; 2.School of Information Technology and Electrical Engineering, The University of Queensland, Brisbane, Australia;

Download: PDF(671 KB)
Export: BibTeX | EndNote | Reference Manager | ProCite | RefWorks

Abstract The concept of Peer-to-Peer (P2P) has been introduced into mobile networks, which has led to the emergence of mobile P2P networks, and originated potential applications in many fields. However,mobile P2P networks are subject to the limitations of transmission range, and highly dynamic and unpredictable network topology, giving rise to many new challenges for efficient information retrieval. In this paper, we propose an automatic and economical hybrid information retrieval approach based on cooperative cache. In this method, the region covered by a mobile P2P network is partitioned into subregions, each of which is identified by a unique ID and known to all peers. All the subregions then constitute a mobile Kademlia (MKad) network. The proposed hybrid retrieval approach aims to utilize the floodingbased and Distributed Hash Table (DHT)-based schemes in MKad for indexing and searching according to the designed utility functions. To further facilitate information retrieval, we present an effective cache update method by considering all relevant factors. At the same time, the combination of two different methods for cache update is also introduced. One of them is pull based on time stamp including two different pulls: an on-demand pull and a periodical pull, and the other is a push strategy using update records. Furthermore, we provide detailed mathematical analysis on the cache hit ratio of our approach. Simulation experiments in NS-2 showed that the proposed approach is more accurate and efficient than the existing methods.

Keywords peer-to-peer (P2P) flooding mobile Kadem-lia hybrid information retrieval cache update cache consistency

Issue Date: 05 September 2009

Cite this article:

Quanqing XU,Yafei DAI,Bin CUI, et al. Hybrid information retrieval policies based on cooperative cache in mobile P2P networks[J]. Front. Comput. Sci., 2009, 3(3): 381-395.

URL:

https://academic.hep.com.cn/fcs/EN/10.1007/s11704-009-0055-x
https://academic.hep.com.cn/fcs/EN/Y2009/V3/I3/381

	Chen Z B, Shen H T, Xu Q Q, et al. Instant advertising in mobile peer-to-peer networks. In: Proceedings of ICDE’09. 2009, 736―747
	Yoon J K, Noble B, Liu M Y. Surface street traffic estimation. In: proceedings of MobiSys’07. 2007, 220―232
	Rybicki J, Scheuermann B, Kieb W, et al. Challenge: peers on wheels—a road to newtraffic information systems. In: Proceedingsof MOBICOM’07. 2007, 215―221
	Bychkovsky V, Hull B, Miu A, et al. A measurement study of vehicular internet accessusing in situ wi-fi networks. In: Proceedingsof MOBICOM’06. 2006, 50―61
	Maymounkov P, Mazi`eres. Kademlia: A peer-to-peer information system based onthe xor metric. In: Proceedings of IPTPS’02. 2002, 53―65
	Ratnasamy S, Karp B, Yin L, et al. Ght: a geographic hash table for data-centricstorage. In: Proceedings of WSNA’02. 2002, 78―87 doi: 10.1145/570738.570750
	Kieβ W, Füβler H, Widmer J, et al. Hierarchical location servicefor mobile ad-hoc networks. Mobile Computingand Communications Review, 2004, 8(4): 47―58 doi: 10.1145/1052871.1052875
	Shen H P, Joseph M S, Kumar M, et al. Precinct: a scheme for cooperative caching inmobile peer-to-peer systems. In: Proceedingsof IPDPS’05. 2005, 57a―57a
	Chow C-Y, Leong H V, Chan A T S. Grococa: group-based peer-topeer cooperative cachingin mobile environment. IEEE Journal onSelected Areas in Communications, 2007, 25(1): 79―191 doi: 10.1109/JSAC.2007.070118
	Li W Z, Chan E, Wang Y L, et al. Cache invalidation strategies for mobile adhoc networks. In: Proceedings of the 36thInternational Conference on Parallel Processing, 2007, 57
	Chawathe Y, Ratnasamy S, Breslau L, et al. Making gnutella-like p2p systems scalable. In: Proceedings of SIGCOMM’03. 2003, 407―418
	Loo B T, Huebsch R, Stoica I, et al. The case for a hybrid p2p search infrastructure. In: Proceedings of IPTPS’04. 2004, 141―150
	Chang N B, Liu M Y. Revisiting the ttl-basedcontrolled flooding search: optimality and randomization. In: Proceedings of MOBICOM’ 04. 2004, 85―99 doi: 10.1145/1023720.1023730
	Karp B, Kung H T. Gpsr: greedy perimeter statelessrouting for wireless networks. In: Proceedingsof MOBICOM’00. 2000, 243―254 doi: 10.1145/345910.345953
	Li J Y, Jannotti J, De Couto D S J, et al. A scalable location service for geographic adhoc routing. In: Proceedings of MOBICOM’00. 2000,120―130 doi: 10.1145/345910.345931

[1]	Chenchen HUANG, Huiqi HU, Xing WEI, Weining QIAN, Aoying ZHOU. Partition pruning for range query on distributed log-structured merge-tree[J]. Front. Comput. Sci., 2020, 14(3): 143604-.
[2]	Ye TIAN, Bangchuan LIU, Zhenhua HE, . PopCap: popularity oriented proxy caching for peer-assisted Internet video-on-demand streaming services[J]. Front. Comput. Sci., 2010, 4(4): 500-515.
[3]	LI Fengrong, IIDA Takuya, ISHIKAWA Yoshiharu. Traceable P2P record exchange: a database-oriented approach[J]. Front. Comput. Sci., 2008, 2(3): 257-267.

Viewed

Full text

Abstract

Cited

Shared

Discussed