Popularity Based Mobile Peer-to-Peer Search Mechanism

In this paper, a popularity based with time distance aided search mechanism is present for the communication between relay agents. It is based on agents' shooting query history information to calculate the agents and files' popularity. Relay agents pre-publish the popular file information according to popularity. At the same time, the proactive information effectively guides the search. Experiments show that even the frequency of using the system increases, the search mechanism proposed in this paper has better adaptability.

[1]  Zhou Yu-jiao.  Location Aided Proactive Search Mechanism for Mobile Peer-to-Peer Network , 2008 .

[2]  Vana Kalogeraki.  Mobile peer-to-peer computing: challenges, metrics and applications , 2005, MDM '05.

[3]  Oliver P. Waldhorst,et al.  A special-purpose peer-to-peer file sharing system for mobile ad hoc networks , 2003, 2003 IEEE 58th Vehicular Technology Conference. VTC 2003-Fall (IEEE Cat. No.03CH37484).

[4]  Wolfgang Kellerer,et al.  Performance evaluation of the mobile peer-to-peer service , 2004, IEEE International Symposium on Cluster Computing and the Grid, 2004. CCGrid 2004..