Social-Based Routing with Congestion Avoidance in Opportunistic Networks

  • Alexandru Asandei
  • Ciprian Dobre
  • Matei Popovici
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7960)


In particular types of Delay-Tolerant Networks (DTN) such as Opportunistic Mobile Networks, node connectivity is transient. For this reason, traditional routing mechanisms are no longer suitable. New approaches use social relations between mobile users as a criterion for the routing process. We argue that in such an approach, nodes with high social popularity may become congested. We show that social-based routing algorithms such as Bubble Rap are prone to congestion, and introduce two algorithms Outer and LowerEps. We present experimental results showing that the latter outperform Bubble Rap and solve the congestion problem.


Average Latency Delivery Cost Delay Tolerant Network Saturation Rate Opportunistic Network 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Cisco visual networking index: Global mobile data traffic forecast update (2011-2016),
  2. 2.
    Asandei, A.: Socio-aware routing in opportunistic networks. Bachelor ThesisGoogle Scholar
  3. 3.
    Bjurefors, F., Gunningberg, P., et al.: Congestion avoidance in a data-centric opportunistic network. In: Proc. of the ACM SIGCOMM Workshop on Information-Centric Networking, ICN 2011, New York, USA, pp. 32–37 (2011)Google Scholar
  4. 4.
    Boldrini, C., Conti, M., Passarella, A.: Exploiting users and social relations to forward data in opportunistic networks: The hibop solution. Pervasive and Mobile Computing 4(5), 633–657 (2008)CrossRefGoogle Scholar
  5. 5.
    Grossglauser, M., Tse, D.N.C.: Mobility increases the capacity of ad hoc wireless networks. IEEE/ACM Trans. Netw. 10(4), 477–486 (2002)CrossRefGoogle Scholar
  6. 6.
    Huberman, B.A., Romero, D.M., Wu, F.: Social networks that matter: Twitter under the microscope. CoRR, vol. abs/0812.1045 (December 5, 2008),
  7. 7.
    Hui, P., Crowcroft, J., Yoneki, E.: Bubble rap: social-based forwarding in delay tolerant networks. In: Proc. of the 9th ACM Int. Symp. on Mobile Ad Hoc Net. and Comp., MobiHoc 2008, pp. 241–250. ACM, New York (2008)Google Scholar
  8. 8.
    Jain, S., Fall, K., Patra, R.: Routing in a delay tolerant network. In: Proc. of the 2004 Conf. on Applications, Technologies, Architectures, and Protocols for Computer Comm., SIGCOMM 2004, pp. 145–158. ACM, New York (2004)CrossRefGoogle Scholar
  9. 9.
    Lindgren, A., Doria, A., Schelén, O.: Probabilistic routing in intermittently connected networks. SIGMOBILE Mob. Comput. Commun. Rev. 7(3), 19–20 (2003)CrossRefGoogle Scholar
  10. 10.
    Pelusi, L., Passarella, A., Conti, M.: Opportunistic networking: data forwarding in disconnected mobile ad hoc networks. IEEE Comm. Magazine 44(11), 134–141 (2006)CrossRefGoogle Scholar
  11. 11.
    Vahdat, A., Becker, D.: Epidemic routing for partially connected ad hoc networks. Tech. Rep. CS-2000006, Duke University, Durham, NC (December 2000)Google Scholar
  12. 12.
    Wilson, C., Boe, B., et al.: User interactions in social networks and their implications. In: Proc. of the 4th ACM Eu. Conf. on Computer Systems, EuroSys 2009, pp. 205–218. ACM, New York (2009)Google Scholar
  13. 13.
    Wortham, J.: Customers Angered as iPhones Overload AT&T, The New York Times (September 2, 2009), (accessed November 2, 2012)
  14. 14.
    Xu, K., Hui, P., et al.: Impact of altruism on opportunistic communications. In: Proc. of the First Int. Conf. on Ubiquitous and Future Networks, ICUFN 2009, pp. 153–158. IEEE Press, Piscataway (2009)CrossRefGoogle Scholar
  15. 15.
    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

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Alexandru Asandei
    • 1
  • Ciprian Dobre
    • 1
  • Matei Popovici
    • 1
  1. 1.Faculty of Automatic Control and ComputersUniversity Politehnica of BucharestRomania

Personalised recommendations