Connectivity and inference problems for temporal networks
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Graphs over time: densification laws, shrinking diameters and possible explanations
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Impact of Human Mobility on Opportunistic Forwarding Algorithms
IEEE Transactions on Mobile Computing
A framework for community identification in dynamic social networks
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
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
Social network analysis for routing in disconnected delay-tolerant MANETs
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
The diameter of opportunistic mobile networks
CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
Bubble rap: social-based forwarding in delay tolerant networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Exploiting social interactions in mobile systems
UbiComp '07 Proceedings of the 9th international conference on Ubiquitous computing
Opportunistic spatial gossip over mobile social networks
Proceedings of the first workshop on Online social networks
Promoting tolerance for delay tolerant network research
ACM SIGCOMM Computer Communication Review
CoNEXT '08 Proceedings of the 2008 ACM CoNEXT Conference
Temporal distance metrics for social network analysis
Proceedings of the 2nd ACM workshop on Online social networks
MobiClique: middleware for mobile social networking
Proceedings of the 2nd ACM workshop on Online social networks
Extended social network: a new generalized framework for virtual world analysis
Proceedings of the 8th International Conference on Virtual Reality Continuum and its Applications in Industry
Characterising temporal distance and reachability in mobile and online social networks
ACM SIGCOMM Computer Communication Review
Social-Greedy: a socially-based greedy routing algorithm for delay tolerant networks
MobiOpp '10 Proceedings of the Second International Workshop on Mobile Opportunistic Networking
Second life: a social network of humans and bots
Proceedings of the 20th international workshop on Network and operating systems support for digital audio and video
Peoplerank: social opportunistic forwarding
INFOCOM'10 Proceedings of the 29th conference on Information communications
Human Contact Prediction Using Contact Graph Inference
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
Dissemination in opportunistic social networks: the role of temporal communities
Proceedings of the thirteenth ACM international symposium on Mobile Ad Hoc Networking and Computing
Collection and analysis of multi-dimensional network data for opportunistic networking research
Computer Communications
Fair content dissemination in participatory DTNs
Ad Hoc Networks
Fast track article: Predicting missing contacts in mobile social networks
Pervasive and Mobile Computing
CAF: Community aware framework for large scale mobile opportunistic networks
Computer Communications
Fairness-related challenges in mobile opportunistic networking
Computer Networks: The International Journal of Computer and Telecommunications Networking
Familiar strangers detection in online social networks
Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining
Social-awareness in opportunistic networking
International Journal of Intelligent Systems Technologies and Applications
Opportunistic message routing using multi-layer social networks
Proceedings of the 2nd ACM workshop on High performance mobile opportunistic systems
| Hi-index | 0.00 |
This paper studies a Bluetooth-based mobile social network application deployed among a group of 28 participants collected during a computer communication conference. We compare the social graph containing friends, as defined by participants, to the contact graph, that is the temporal network created by opportunistic contacts as owners of devices move and come into communication range. Our contribution is twofold: first, we prove that most properties of nodes, links, and paths correlate among the social and contact graphs. Second, we describe how the structure of the social graph helps build forwarding paths in the contact graph, allowing two nodes to communicate over time using opportunistic contacts and intermediate nodes. Efficient paths can be built using only pairs of nodes that are socially close (i.e. connected through a few pairs of friends). Our results indicate that opportunistic forwarding complies with the requirement of social network application.