DocumentCode
2116161
Title
Popularity Based Mobile Peer-to-Peer Search Mechanism
Author
Huang, Bo ; Chen, Huai-Xi
Author_Institution
Dept. of Comput. Sci. & Eng., South China Univ. of Technol., Guangzhou, China
fYear
2009
fDate
24-26 Sept. 2009
Firstpage
1
Lastpage
4
Abstract
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.
Keywords
ad hoc networks; mobile computing; peer-to-peer computing; routing protocols; software agents; mobile search mechanism; peer-to-peer search mechanism; popular file information; proactive information; relay agents communication; Cellular phones; History; Internet; Mobile communication; Mobile computing; Peer to peer computing; Protective relaying; Relays; Routing protocols; Scalability;
fLanguage
English
Publisher
ieee
Conference_Titel
Wireless Communications, Networking and Mobile Computing, 2009. WiCom '09. 5th International Conference on
Conference_Location
Beijing
Print_ISBN
978-1-4244-3692-7
Electronic_ISBN
978-1-4244-3693-4
Type
conf
DOI
10.1109/WICOM.2009.5302648
Filename
5302648
Link To Document