This Article 
 Bibliographic References 
 Add to: 
BUBBLE Rap: Social-Based Forwarding in Delay-Tolerant Networks
November 2011 (vol. 10 no. 11)
pp. 1576-1589
Pan Hui, Deutsche Telekom Laboratories, Berlin
Jon Crowcroft, University of Cambridge, Cambridge
Eiko Yoneki, University of Cambridge, Cambridge
The increasing penetration of smart devices with networking capability form novel networks. Such networks, also referred as pocket switched networks (PSNs), are intermittently connected and represent a paradigm shift of forwarding data in an ad hoc manner. The social structure and interaction of users of such devices dictate the performance of routing protocols in PSNs. To that end, social information is an essential metric for designing forwarding algorithms for such types of networks. Previous methods relied on building and updating routing tables to cope with dynamic network conditions. On the downside, it has been shown that such approaches end up being cost ineffective due to the partial capture of the transient network behavior. A more promising approach would be to capture the intrinsic characteristics of such networks and utilize them in the design of routing algorithms. In this paper, we exploit two social and structural metrics, namely centrality and community, using real human mobility traces. The contributions of this paper are two-fold. First, we design and evaluate BUBBLE, a novel social-based forwarding algorithm, that utilizes the aforementioned metrics to enhance delivery performance. Second, we empirically show that BUBBLE can substantially improve forwarding performance compared to a number of previously proposed algorithms including the benchmarking history-based PROPHET algorithm, and social-based forwarding SimBet algorithm.

[1] P. Hui, A. Chaintreau, J. Scott, R. Gass, J. Crowcroft, and C. Diot, "Pocket Switched Networks and Human Mobility in Conf. Environments," Proc. ACM Special Interest Group Data Comm. Workshop (SIGCOMM '05), 2005.
[2] K. Fall, "A Delay-Tolerant Network Architecture for Challenged Internets," Proc. ACM Special Interest Group Data Comm. Workshop (SIGCOMM '03), 2003.
[3] D. Kempe, J. Kleinberg, and A. Kumar, "Connectivity and Inference Problems for Temporal Networks," J. Computer and System Sciences, vol. 64, no. 4, pp. 820-842, 2002.
[4] E.P.C. Jones, L. Li, and P.A.S. Ward, "Practical Routing in Delay-Tolerant Networks," Proc. ACM Special Interest Group Data Comm. Workshop (SIGCOMM '05), 2005.
[5] A. Lindgren, A. Doria, and O. Schelen, "Probabilistic Routing in Intermittently Connected Networks," ACM SIGMOBILE Mobile Computing and Comm. Rev., vol. 7, no. 3, July 2004.
[6] S. Okasha, "Altruism, Group Selection and Correlated Interaction," British J. for the Philosophy of Science, vol. 56, no. 4, pp. 703-725, Dec. 2005.
[7] M.E.J. Newman, "Detecting Community Structure in Networks," The European Physical J. B, vol. 38, pp. 321-330, 2004.
[8] L. Danon, J. Duch, A. Diaz-Guilera, and A. Arenas, "Comparing Community Structure Identification," J. Statistical Mechanics, vol. 2005, no. 9, p. P09008, Sept. 2005.
[9] L.C. Freeman, "A Set of Measuring Centrality Based on Betweenness," Sociometry, vol. 40, pp. 35-41, 1977.
[10] E. Daly and M. Haahr, "Social Network Analysis for Routing in Disconnected Delay-Tolerant Manets," Proc. ACM MobiHoc, 2007.
[11] N. Eagle and A. Pentland, "Reality Mining: Sensing Complex Social Systems," Personal and Ubiquitous Computing, vol. 10, no. 4, pp. 255-268, May 2006.
[12] A. Chaintreau, P. Hui, J. Crowcroft, C. Diot, R. Gass, and J. Scott, "Impact of Human Mobility on the Design of Opportunistic Forwarding Algorithms," Proc. IEEE INFOCOM, Apr. 2006.
[13] T. Karagiannis, J.-Y. Le Boudec, and M. Vojnović, "Power Law and Exponential Decay of Inter Contact Times between Mobile Devices," Proc. ACM MobiCom, 2007.
[14] J. Leguay, A. Lindgren, J. Scott, T. Friedman, and J. Crowcroft, "Opportunistic Content Distribution in an Urban Setting," Proc. ACM MobiCom Workshop Challenged Networks (CHANTS '06), pp. 205-212, 2006.
[15] G. Palla, I. Derényi, I. Farkas, and T. Vicsek, "Uncovering the Overlapping Community Structure of Complex Networks in Nature and Society," Nature, 03607, vol. 435, no. 7043, pp. 814-818, 2005.
[16] M.E.J. Newman, "Analysis of Weighted Networks," Physical Rev. E, vol. 70, p. 056131, 2004.
[17] P. Hui and J. Crowcroft, "Human Mobility Models and Opportunistic Communications System Design," Philosophical Trans. Royal Soc. A: Math., Physical and Eng. Sciences, vol. 366, no. 1872, pp. 2005-2016, June 2008.
[18] P. Hui, J. Crowcroft, and E. Yoneki, "Bubble Rap: Social-Based Forwarding in Delay Tolerant Networks," Proc. ACM MobiHoc, May 2008.
[19] M.E.J. Newman and M. Girvan, "Finding and Evaluating Community Structure in Networks," Physical Rev. E,, vol. 69, Feb. 2004.
[20] P. Hui and J. Crowcroft, "How Small Labels Create Big Improvements," Proc. IEEE Int'l Workshop Intermittently Connected Mobile Ad Hoc Networks (ICMAN '07), Mar. 2007.
[21] L.A. Adamic, B.A. Huberman, R.M. Lukose, and A.R. Puniyani, "Search in Power Law Networks," Physical Rev. E, vol. 64, pp. 46 135-46 143, Oct. 2001.
[22] A. Trusina, S. Maslov, P. Minnhagen, and K. Sneppen, "Hierarchy Measures in Complex Networks," Physical Rev. Letters, , vol. 92, p. 178702, 2004.
[23] P. Hui, E. Yoneki, S.-Y. Chan, and J. Crowcroft, "Distributed Community Detection in Delay Tolerant Networks," Proc. Second ACM/IEEE Int'l Workshop Mobility in the Evolving Internet Architecture (MobiArch '07), Aug. 2007.
[24] P. Winters, "Forecasting Sales by Exponentially Weighted Moving Averages," Management Science, vol. 6, pp. 324-342, 1960.
[25] P. Hui and N. Sastry, "Real World Routing Using Virtual World Information," Proc. Int'l Conf. Computational Science and Eng. (CCSE '09), pp. 1103-1108, 2009.
[26] N. Sarshar, P.O. Boykin, and V.P. Roychoudhury, "Scalable Percolation Search in Power Law Networks: Making Unstructured Peer-to-Peer Networks Scalable," Proc. Fourth Int'l Conf. Peer-to-Peer Computing (P2P '04), June 2004.
[27] A. Vahdat and D. Becker, "Epidemic Routing for Partially Connected Ad Hoc Networks," Technical Report CS-200006, Duke Univ., Apr. 2000.
[28] T. Spyropoulos, K. Psounis, and C. Raghavendra, "Spray and Wait: An Efficient Routing Scheme for Intermittently Connected Mobile Networks," Proc. ACM Special Interest Group Data Comm. Workshop Delay-Tolerant Networking (WDTN '05), 2005.
[29] M. Grossglauser and D. Tse, "Mobility Increases the Capacity of Ad-Hoc Wireless Networks," IEEE/ACM Trans. Networks, vol. 10, no. 4, pp. 477-486, Aug. 2002.
[30] J. Leguay, T. Friedman, and V. Conan, "Evaluating Mobility Pattern Space Routing for DTNs," Proc. IEEE INFOCOM, 2006.
[31] J. Lebrun, C.-N. Chuah, D. Ghosal, and M. Zhang, "Knowledge-based Opportunistic Forwarding in Vehicular Wireless Ad Hoc Networks," Proc. Vehicular Technology Conf., vol. 4, pp. 2289-2293, 2005.
[32] M. Musolesi, S. Hailes, and C. Mascolo, "Adaptive Routing for Intermittently Connected Mobile Ad Hoc Networks," Proc. Sixth IEEE Int'l Symp. World of Wireless Mobile and Multimedia Networks (WOWMOM '05), pp. 183-189, 2005.
[33] W. Zhao, M. Ammar, and E. Zegura, "A Message Ferrying Approach for Data Delivery in Sparse Mobile Ad Hoc Networks," Proc. ACM MobiCom, pp. 187-198, 2004.
[34] M.P.N. Sarafijanovic-Djukic and M. Grossglauser, "Island Hopping: Efficient Mobility-Assisted Forwarding in Partitioned Networks," Proc. 3rd Ann. IEEE Comm. Soc. Sensor and Ad Hoc Comm. Networks (SECON '06), vol. 1, pp. 226-235, 2006.

Index Terms:
Social networks, forwarding algorithms, delay-tolerant networks, pocket-switched networks, centrality, community detection.
Pan Hui, Jon Crowcroft, Eiko Yoneki, "BUBBLE Rap: Social-Based Forwarding in Delay-Tolerant Networks," IEEE Transactions on Mobile Computing, vol. 10, no. 11, pp. 1576-1589, Nov. 2011, doi:10.1109/TMC.2010.246
Usage of this product signifies your acceptance of the Terms of Use.