Epidemic algorithms for replicated database maintenance
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
The small-world phenomenon: an algorithmic perspective
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Spatial gossip and resource location protocols
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Mobility increases the capacity of ad hoc wireless networks
IEEE/ACM Transactions on Networking (TON)
Protocols and Impossibility Results for Gossip-Based Communication Mechanisms
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Analyzing Kleinberg's (and other) small-world Models
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Routing in a delay tolerant network
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Spatial gossip and resource location protocols
Journal of the ACM (JACM)
Why cell phones will dominate the future internet
ACM SIGCOMM Computer Communication Review
Analyzing and characterizing small-world graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Impact of Human Mobility on Opportunistic Forwarding Algorithms
IEEE Transactions on Mobile Computing
Power law and exponential decay of inter contact times between mobile devices
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Are you moved by your social network application?
Proceedings of the first workshop on Online social networks
Networks Become Navigable as Nodes Move and Forget
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Opportunistic trust based P2P services framework for disconnected MANETs
ATC'10 Proceedings of the 7th international conference on Autonomic and trusted computing
Managing workplace resources in office environments through ephemeral social networks
UIC'10 Proceedings of the 7th international conference on Ubiquitous intelligence and computing
EPSP: Enhancing Network Protocol with Social-Aware Plane
GREENCOM-CPSCOM '10 Proceedings of the 2010 IEEE/ACM Int'l Conference on Green Computing and Communications & Int'l Conference on Cyber, Physical and Social Computing
Tight bounds on information dissemination in sparse mobile networks
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Order optimal information spreading using algebraic gossip
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
MINT: maximizing information propagation in predictable delay-tolerant network
Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing
Hi-index | 0.00 |
This paper investigates how the principles underlying online social network services could be used to take advantage of node mobility in an opportunistic manner. As an example, we show how to take advantage of opportunistic contacts between mobile phones that run an online social network service. Our model includes static nodes, and mobile nodes which follow random walks. As in an online network service, we assume that each node can only communicate with a small subset of others nodes (called its mates) in addition to its geographical neighbors. Here we prove that, in such context, a simple connection scheme enables to execute sophisticated tasks (e.g., routing) and mechanisms (e.g., spatial gossip), while using only opportunistic communication and communication between mates. In other words, our results show that future online social networks can exploit mobility as long as they forget connections appropriately.