Social Aspects to Support Opportunistic Networks in an Academic Environment
As wireless and 3G networks become more crowded, users with mobile devices have difficulties in accessing the network. Opportunistic networks, created between mobile phones using local peer-to-peer connections, have the potential to solve such problems by dispersing some of the traffic to neighboring smartphones. Recently various opportunistic routing or dissemination algorithms were proposed and evaluated in different scenarios emulating real-world phenomena as close as possible. In this paper we present an experiment performed at the Politehnica University of Bucharest in which we collected social and mobiltity data to evaluate opportunistic routing and dissemination algorithms. We present an analysis of our findings, highlighting key social and mobility behavior factors that can influence such opportunistic solutions. Most importantly, we show that by adding knowledge such as social links between participants in an opportunistic network routing and dissemination algorithms can be greatly improved.
KeywordsMobile Device Community Detection External Device Delay Tolerant Network Opportunistic Network
Unable to display preview. Download preview PDF.
- 4.CRAWDAD, http://crawdad.cs.dartmouth.edu/
- 10.Nguyen, H.A., Giordano, S., Puiatti, A.: Probabilistic routing protocol for intermittently connected mobile ad hoc network (propicman). In: 2007 IEEE Int. Symp. on a World of Wireless Mobile and Multimedia Networks, pp. 1–6 (2007)Google Scholar
- 11.Boldrini, C., Conti, M., Jacopini, J., Passarella, A.: HiBOp: a History Based Routing Protocol for Opportunistic Networks. In: IEEE Int. Symp. on a World of Wireless, Mobile and Multimedia Networks, WoWMoM 2007, pp. 1–12 (2007)Google Scholar
- 12.Yoneki, E., Hui, P., Chan, S., Crowcroft, J.: A socio-aware overlay for publish/subscribe communication in delay tolerant networks. In: Proc. of the 10th ACM Symp. on Modeling, Analysis, and Simulation of Wireless and Mobile Systems, MSWiM 2007, pp. 225–234. ACM, New York (2007)CrossRefGoogle Scholar
- 14.Pop, F.: A fault tolerant decentralized scheduling in large scale distributed systems. In: Antonopoulos, N., Exarchakos, G., Li, M., Liotta, A. (eds.) Handbook of Research on P2P and Grid Systems for Service-Oriented Computing: Models, Methodologies and Applications. Info. Science Ref., pp. 566–589 (2010)Google Scholar
- 16.Ciobanu, R., Dobre, C.: Data dissemination in opportunistic networks. In: 18th Int. Conf. on Control Systems and Computer Science, CSCS-18, pp. 529–536 (2011)Google Scholar
- 17.Bigwood, G., Rehunathan, D., Bateman, M., Henderson, T., Bhatti, S.: Exploiting self-reported social networks for routing in ubiquitous computing environments. In: Proc. of the 2008 IEEE Int. Conf. on Wireless & Mobile Computing, Networking & Comm., pp. 484–489. IEEE Computer Society, Washington, USA (2008)CrossRefGoogle Scholar
- 19.Social Tracer, http://code.google.com/p/social-tracer/
- 21.Chaintreau, A., Hui, P., Crowcroft, J., Diot, C., Gass, R., Scott, J.: Pocket Switched Networks: Real-world mobility and its consequences for opportunistic forwarding. Technical report, University of Cambridge, Computer Lab (2005)Google Scholar
- 22.Hui, P., Yoneki, E., Chan, S.Y., Crowcroft, J.: Distributed community detection in delay tolerant networks. In: Proc. of 2nd ACM/IEEE Inter. Workshop on Mobility in the Evolving Internet Architecture, MobiArch 2007, pp. 7:1–7:8. ACM, New York (2007)Google Scholar