Skip to main content

Advertisement

Springer Nature Link
Log in

Social characteristics-based routing algorithm for a mobile social network

  • Regular Paper
  • Published:
Computing Aims and scope Submit manuscript

Abstract

Utilization of social characteristics presents a modern approach in the design of routing protocols for Mobile Social Networks. In this paper, we present a novel routing algorithm called the Social Characteristics-based Distributed Routing Algorithm (SCDRA) for a Mobile Social Network. SCDRA explores community and friendship as social features to effectively route messages. In SCDRA, nodes develop their community in a distributed way based on the concept of a familiar set. Merging of communities of nodes is governed by certain rules. Friendship in SCDRA evolves based on various factors like inter-contact duration, frequency of encounters and successful delivery of messages forwarded in a few past time intervals between the nodes. Routing of messages is accomplished by utilizing community and friendship as social characteristics. Extensive simulation studies performed show that the proposed algorithm performs better when compared to existing algorithms such as Bubble rap, SMART and EpSoc for performance metrics like delivery ratio, overhead ratio and average delivery latency in various scenarios.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Zhu Y, Xu B, Shi X, Wang Y (2013) A survey of social-based routing in delay tolerant networks: positive and negative social effects. IEEE Commun Surv Tutor 15(1):387–401

    Article  Google Scholar 

  2. Khabbaz MJ, Assi CM, Fawaz WF (2011) Disruption-tolerant networking: a comprehensive survey on recent developments and persisting challenges. IEEE Commun Surv Tutor 14(2):607–640

    Article  Google Scholar 

  3. Hui P, Crowcroft J, Yoneki E (2011) Bubble rap: social-based forwarding in delay-tolerant networks. IEEE Trans Mob Comput 10(11):1576–1589

    Article  Google Scholar 

  4. Chen K, Shen H (2014) Smart: utilizing distributed social map for lightweight routing in delay-tolerant networks. IEEE/ACM Trans Netw 22(5):1545–1558

    Article  MathSciNet  Google Scholar 

  5. Halikul L, Mohamad A (2018) EpSoc: social-based epidemic-based routing protocol in opportunistic mobile social network. Mob Inf Syst 2018:1–8

    Google Scholar 

  6. Hui P, Yoneki E, Chan SY, Crowcroft J (2007) Distributed community detection in delay tolerant networks. In: Proceedings of 2nd ACM/IEEE international workshop on Mobility in the evolving internet architecture, ACM, p 7

  7. Daly EM, Haahr M (2007) Social network analysis for routing in disconnected delay-tolerant manets. In: Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing, ACM, pp 32–40

  8. Bulut E, Szymanski BK (2012) Exploiting friendship relations for efficient routing in mobile social networks. IEEE Trans Parallel Distrib Syst 23(12):2254–2265

    Article  Google Scholar 

  9. Nasiri E, Derakhshanfard N (2018) Ftr: features tree based routing in mobile social networks. Wirel Netw 26:1–9

    Google Scholar 

  10. Asl ST, Derakhshanfard N (2019) Sfq: social features based quota routing in mobile social networks. Wirel Pers Commun 104(3):1109–1120

    Article  Google Scholar 

  11. Mei A, Morabito G, Santi P, Stefa J (2011) Social-aware stateless forwarding in pocket switched networks. In: Infocom, 2011 proceedings IEEE, IEEE, pp 251–255

  12. Wu J, Wang Y (2012) Hypercube-based multipath social feature routing in human contact networks. IEEE Trans Comput 63(2):383–396

    MathSciNet  MATH  Google Scholar 

  13. Moreira W, Mendes P, Sargento S (2012) Opportunistic routing based on daily routines. In: 2012 IEEE international symposium on a world of wireless, mobile and multimedia networks (WoWMoM), IEEE, pp 1–6

  14. Nguyen HA, Giordano S (2012) Context information prediction for social-based routing in opportunistic networks. Ad Hoc Netw 10(8):1557–1569

    Article  Google Scholar 

  15. Moreira W, Mendes P, Sargento S (2013) Social-aware opportunistic routing protocol based on user’s interactions and interests. In: International conference on ad hoc networks, Springer, pp 100–115

  16. Xiao M, Wu J, Huang L (2013) Community-aware opportunistic routing in mobile social networks. IEEE Trans Comput 63(7):1682–1695

    Article  MathSciNet  Google Scholar 

  17. Socievole A, Yoneki E, De Rango F, Crowcroft J (2013) Opportunistic message routing using multi-layer social networks. In: Proceedings of the 2nd ACM workshop on High performance mobile opportunistic systems, pp 39–46

  18. Li Z, Wang C, Yang S, Jiang C, Li X (2014) Lass: local-activity and social-similarity based data forwarding in mobile social networks. IEEE Trans Parallel Distrib Syst 26(1):174–184

    Article  Google Scholar 

  19. Ciobanu RI, Dobre C, Cristea V, Pop F, Xhafa F (2015) SPRINT-SELF: Social-based routing and selfish node detection in opportunistic networks. Mob Inf Syst 2015:1–12

    Google Scholar 

  20. Wang R, Wang X, Hao F, Zhang L, Liu S, Wang L, Lin Y (2018) Social identity-aware opportunistic routing in mobile social networks. Trans Emerg Telecommun Technol 29(5):e3297

    Article  Google Scholar 

  21. Yan Y, Chen Z, Wu J, Wang L, Liu K, Zheng P (2019) An effective transmission strategy exploiting node preference and social relations in opportunistic social networks. IEEE Access 7:58186–58199

    Article  Google Scholar 

  22. Rabiya SM, Ramar R (2020) Multiattribute-based routing for lifetime maximization in opportunistic mobile social networks. Int J Commun Syst 2020:1–13. https://doi.org/10.1002/dac.4312

    Article  Google Scholar 

  23. Vahdat A, Becker D (2000) Epidemic routing for partially connected ad hoc networks. Technical Report CS-200006, Duke University

  24. Perkins DD, Florin P, Rich RC, Wandersman A, Chavis DM (1990) Participation and the social and physical environment of residential blocks: crime and community context. Am J Commun Psychol 18(1):83–115

    Article  Google Scholar 

  25. Okasha S (2005) Altruism, group selection and correlated interaction. Br J Philos Sci 56(4):703–725

    Article  Google Scholar 

  26. Newman ME (2005) A measure of betweenness centrality based on random walks. Soc Netw 27(1):39–54

    Article  Google Scholar 

  27. Bulut E, Szymanski BK (2010) Friendship based routing in delay tolerant mobile social networks. Global Telecommunications Conference (GLOBECOM 2010), 2010 IEEE, IEEE, pp 1–5

  28. Zhang Y, Zhao J (2009) Social network analysis on data diffusion in delay tolerant networks. In: Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing, ACM, pp 345–346

  29. Keränen A, Ott J, Kärkkäinen T (2009) The one simulator for dtn protocol evaluation. In: Proceedings of the 2nd international conference on simulation tools and techniques, ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering), p 55

  30. Scott J, Gass R, Crowcroft J, Hui P, Diot C, Chaintreau A (2009) CRAWDAD dataset cambridge/haggle (v. 2009-05-29). https://crawdad.org/cambridge/haggle/20090529, https://doi.org/10.15783/C70011

  31. Eagle N, Pentland AS (2006) Reality mining: sensing complex social systems. Pers Ubiquit Comput 10(4):255–268

    Article  Google Scholar 

  32. Scott J, et al. (2006) Impact of human mobility on the design of opportunistic forwarding algorithms. In: Proceeding of IEEE INFOCOM

  33. Cai H, Eun DY (2008) Toward stochastic anatomy of inter-meeting time distribution under general mobility models. In: Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing, ACM, pp 273–282

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, IIIT, Nagpur, India

    Milind R. Penurkar

  2. Department of Computer Science and Engineering, VNIT, Nagpur, India

    Umesh A. Deshpande

Authors
  1. Milind R. Penurkar
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Umesh A. Deshpande
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Milind R. Penurkar.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Penurkar, M.R., Deshpande, U.A. Social characteristics-based routing algorithm for a mobile social network. Computing 103, 133–153 (2021). https://doi.org/10.1007/s00607-020-00843-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00607-020-00843-4

Keywords

Mathematics Subject Classification