ACM Transactions on Computer Systems (TOCS)
The many faces of publish/subscribe
ACM Computing Surveys (CSUR)
Information diffusion through blogspace
Proceedings of the 13th international conference on World Wide Web
Efficient search in unstructured peer-to-peer networks
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
On the Bursty Evolution of Blogspace
World Wide Web
Modeling and predicting personal information dissemination behavior
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Information revelation and privacy in online social networks
Proceedings of the 2005 ACM workshop on Privacy in the electronic society
Bubble rap: social-based forwarding in delay tolerant networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Automatic metadata generation using associative networks
ACM Transactions on Information Systems (TOIS)
A measurement-driven analysis of information propagation in the flickr social network
Proceedings of the 18th international conference on World wide web
PeerSoN: P2P social networking: early experiences and insights
Proceedings of the Second ACM EuroSys Workshop on Social Network Systems
GoDisco: selective gossip based dissemination of information in social community based overlays
ICDCN'11 Proceedings of the 12th international conference on Distributed computing and networking
The Small World of File Sharing
IEEE Transactions on Parallel and Distributed Systems
Socially-aware routing for publish-subscribe in delay-tolerant mobile ad hoc networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
Information dissemination in a decentralized network is a challenging issue as no single node can have knowledge of the whole network for reasons like security, access control, memory. Most importantly - a centralized service provider is missing which can cater to user requests. In this paper we propose and investigate an algorithm for information dissemination in decentralized networks which only uses local information - that is information associated with a node and its neighbors for disseminating a piece of information with a goal of maximum coverage and minimum spamming. The approach emulates multiagent system using particle swarms, and explores multiple relations that exist among nodes while selecting potential forwarders in case members having same interests are not well connected. The approach is generic enough to be used in various kinds of scenarios: for example in job market or network of emails, decentralized recommendation and contextual advertisement systems. We measure various metrics such as recall, precision and message duplication to analyze the quality of our protocol. The experimental results on real and synthetic dataset show the effectiveness of our approach.