Are you moved by your social network application? Export

@inproceedings{mtibaa:moved, 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.}, address = {New York, NY, USA}, author = {Mtibaa, Abderrahmen and Chaintreau, Augustin and LeBrun, Jason and Oliver, Earl and Pietilainen, Anna K. and Diot, Christophe}, booktitle = {Proceedings of the First ACM SIGCOMM Workshop on Online Social Networks}, citeulike-article-id = {4231084}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=1397735.1397751}, citeulike-linkout-1 = {http://dx.doi.org/10.1145/1397735.1397751}, doi = {10.1145/1397735.1397751}, isbn = {978-1-60558-182-8}, keywords = {dtn, opportunistic-networks, pvnets, social-networks}, location = {Seattle, WA, USA}, month = {August}, pages = {67--72}, posted-at = {2009-10-17 20:53:57}, priority = {2}, publisher = {ACM}, title = {Are you moved by your social network application?}, url = {http://dx.doi.org/10.1145/1397735.1397751}, year = {2008} }

TY - CONF ID - mtibaa:moved L3 - citeulike-article-id:4231084 N2 - 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. CY - Seattle, WA, USA SN - 978-1-60558-182-8 AD - New York, NY, USA EP - 72 TI - Are you moved by your social network application? PB - ACM T2 - Proceedings of the First ACM SIGCOMM Workshop on Online Social Networks SP - 67 KW - dtn KW - opportunistic-networks KW - pvnets KW - social-networks AU - Mtibaa, Abderrahmen AU - Chaintreau, Augustin AU - LeBrun, Jason AU - Oliver, Earl AU - Pietilainen, Anna AU - Diot, Christophe PY - 2008/August// UR - http://dx.doi.org/10.1145/1397735.1397751 ER -