effecient file sharing using gossiping algorithm in mobile adhoc networks
K.L.S.Sindhu,A.Meena Priyadarsini
Published in International Journal of Advanced Research in Computer Science Engineering and Information Technology
ISSN: 2321-3337 Impact Factor:1.521 Volume:6 Issue:3 Year: 20 December,2016 Pages:1164-1168
Abstract
Abstract—A P2P content-based file sharing system, in Mobile Ad-hoc Networks, is used to derive a node’s interests from its files for content-based file searching. For file searching, the nodes which meet each other more frequently are considered as a community. For intracommunity file searching, nodes which meet neighboring nodes frequently are considered as community coordinators. Mobile nodes that visit other communities more frequently are considered as community ambassadors for intercommunity file searching. The gossiping algorithm is proposed which is based on pull and push mechanism, and gives time gap for each node to make an excellent relationship with ambassadors and coordinators. It avoids transmission transparency and also obtains efficient file sharing.
Kewords
MANETS, file sharing, community, intracommunity, intercommunity
Reference
[1] A. Klemm, C. Lindemann, and O. Waldhorst, “A SpecialPurpose Peer-to-Peer File Sharing System for Mobile Ad Hoc Networks,”. [2] D.W.A. Hayes, “Peer-to-Peer Information Sharing in a Mobile Ad Hoc Environment, [3] F. Li and J. Wu, “MOPS: Providing Content-Based Service in Disruption-Tolerant Networks,”. [4] Y. Huang, Y. Gao, K. Nahrstedt, and W. He, “Optimizing File Retrieval in Delay-Tolerant Content Distribution Community,”
