Opportunistic content distribution in an urban setting

ABSTRACT

This paper investigates the feasibility of a city-wide content distribution architecture composed of short range wireless access points. We look at how a target group of intermittently and partially connected mobile nodes can improve the diffusion of information within the group by leveraging fixed and mobile nodes that are exterior to the group. The fixed nodes are data sources, and the external mobile nodes are data relays, and we examine the trade off between the use of each in order to obtain high satisfaction within the target group, which consists of data sinks. We conducted an experiment in Cambridge, UK, to gather mobility traces that we used for the study of this content distribution architecture. In this scenario, the simple fact that members of the target group collaborate leads to a delivery ratio of 90%. In addition, the use of external mobile nodes to relay the information slightly increases the delivery ratio while significantly decreasing the delay.

REFERENCES

• 1: J. Burgess, B. Gallagher, D. Jensen, and B. N. Levine. MaxProp: Routing for vehicle-based disruption tolerant networking. In Proc. Infocom, 2006.
• 2: A. Chaintreau, P. Hui, J. Crowcroft, C. Diot, R. Gass, and J. Scott. Impact of human mobility on the performance of opportunistic forwarding algorithms. In Proc. INFOCOM, 2006.
• 3: CRAWDAD a Community Ressource for Archiving Wireless Data At Dartmouth. http://crawdad.cs.dartmouth.edu.
• 4: Delay Tolerant Network Research Group (DTNRG). http://www.dtnrg.org.
• 5: Nathan Eagle , Alex (Sandy) Pentland, Reality mining: sensing complex social systems, Personal and Ubiquitous Computing, v.10 n.4, p.255-268, March 2006 [doi>10.1007/s00779-005-0046-3]
• 6: Tristan Henderson , David Kotz , Ilya Abyzov, The changing usage of a mature campus-wide wireless network, Proceedings of the 10th annual international conference on Mobile computing and networking, September 26-October 01, 2004, Philadelphia, PA, USA [doi>10.1145/1023720.1023739]
• 7: M. Kim and D. Kotz. Classifying the mobility of users and the popularity of access points. In Proc. LoCA, 2005.
• 8: J. Lawrence and T. Payne. Exploiting familiar strangers: creating a community content distribution network of co-located individuals. In Proc. FOAF, 2004.
• 9: J. Leguay, T. Friedman, and V. Conan. Evaluating mobility pattern space routing for DTNs. In Proc. INFOCOM, 2006.
• 10: A. Lindgren, A. Doria, and O. Schelén. Probabilistic routing in intermittently connected networks. In Proc. (SAPIR 2004), 2004.
• 11: Eric Paulos , Elizabeth Goodman, The familiar stranger: anxiety, comfort, and play in public places, Proceedings of the SIGCHI conference on Human factors in computing systems, p.223-230, April 24-29, 2004, Vienna, Austria [doi>10.1145/985692.985721]
• 12: Thrasyvoulos Spyropoulos , Konstantinos Psounis , Cauligi S. Raghavendra, Spray and wait: an efficient routing scheme for intermittently connected mobile networks, Proceeding of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking, p.252-259, August 26-26, 2005, Philadelphia, Pennsylvania, USA [doi>10.1145/1080139.1080143]
• 13: C. Tuduce and T. Gross. A mobility model based on wlan traces and its validation. In Proc. INFOCOM, 2005.
• 14: A. Vahdat and D. Becker. Epidemic routing for partially connected ad hoc networks. Technical Report CS-200006, Duke University, April 2000.

INDEX TERMS

Primary Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS

General Terms:
Algorithms, Experimentation, Measurement, Performance

Keywords:
content distribution, delay tolerant networking, mobility data