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

Xu, Quanqing, Shen, Hengtao, Chen, Zaiben, Cui, Bin, Zhou, Xiaofang and Dai, Yafei (2009) Hybrid information retrieval policies based on cooperative cache in mobile P2P networks. Frontiers of Computer Science in China, 3 3: 381-395. doi:10.1007/s11704-009-0055-x


Author Xu, Quanqing
Shen, Hengtao
Chen, Zaiben
Cui, Bin
Zhou, Xiaofang
Dai, Yafei
Title Hybrid information retrieval policies based on cooperative cache in mobile P2P networks
Journal name Frontiers of Computer Science in China   Check publisher's open access policy
ISSN 1673-7350
1673-7466
2095-2228
Publication date 2009
Year available 2009
Sub-type Article (original research)
DOI 10.1007/s11704-009-0055-x
Open Access Status
Volume 3
Issue 3
Start page 381
End page 395
Total pages 15
Place of publication Beijing, China
Publisher Gaodeng Jiaoyu Chubanshe
Collection year 2010
Language eng
Subject 1700 Computer Science
2614 Theoretical Computer Science
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.
Keyword Cache consistency
Cache update
Flooding
Hybrid information retrieval
Mobile Kademlia
Peer to peer (P2P)
Q-Index Code C1
Q-Index Status Provisional Code
Institutional Status UQ

Document type: Journal Article
Sub-type: Article (original research)
Collection: School of Information Technology and Electrical Engineering Publications
 
Versions
Version Filter Type
Citation counts: Scopus Citation Count Cited 4 times in Scopus Article | Citations
Google Scholar Search Google Scholar
Created: Wed, 27 Nov 2013, 08:35:30 EST by System User on behalf of School of Information Technol and Elec Engineering