Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1145/1397735.1397751 | WOSN |
Keywords | Field | DocType |
communication range,contact graph,temporal network,social network application,social graph,opportunistic contact,forwarding path,bluetooth-based mobile social network,computer communication conference,opportunistic forwarding complies,delay tolerant network,mobile network,centrality,social network | Social network,Social graph,Mobile social network,Computer science,Computer network,Evolving networks,Centrality,Network simulation,Weighted network,Distributed computing,Intelligent computer network | Conference |
Citations | PageRank | References |
43 | 3.36 | 9 |
Authors | ||
6 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Abderrahmen Mtibaa | 1 | 497 | 30.39 |
| Augustin Chaintreau | 2 | 2086 | 116.37 |
| Jason LeBrun | 3 | 269 | 12.75 |
| Earl Oliver | 4 | 287 | 13.85 |
| Anna Kaisa Pietilainen | 5 | 239 | 10.59 |
| Christophe Diot | 6 | 7831 | 590.69 |