Skip to main content

Part of the book series: Lecture Notes in Networks and Systems ((LNNS,volume 121))

  • 797 Accesses

Abstract

Today’s network becomes more complex due to which performances of network decrease like message delivery ratio, overhead ratio, average latency, cost, etc. A new technique comes to forward the message on the basis of social infrastructure. In this paper, we analyze and compare the result of social-based opportunistic routing protocol with different mobility traces, and we compare the BubbleRap, DLife (daily life routine routing algorithm) and dLifeComm (daily life routine community-based routing algorithm) social routing protocol with different movement models and real traces with respect to delivery ratio, overhead ratio, and average latency. Comparison is based on the real human traces and synthetic mobility model. We use Opportunistic Network Environment (ONE) simulator for result analysis. As from the simulation result, delivery ratio of BubbleRap is better than DLife and dLifeComm when node follows the community-based movement.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Arastouie, N., Sabaei, M., Bakhshi, B.: Near-optimal online routing in opportunistic networks. Int. J. Commun. Syst. 32(3), e3863 (2018)

    Google Scholar 

  2. Costantino, G., Maiti, R.R., Martinelli, F., Santi, P.: Losero: a locality sensitive routing protocol in opportunistic networks. In: Proceedings of the 31st Annual ACM Symposium on Applied Computing, vol. 14, no. 7, pp. 644–650 (2016)

    Google Scholar 

  3. Eagle, N., Pentland, A.S.: Reality mining: Sensing complex social systems. Personal Ubiquitous Comput. 10(4), 255–268 (2006)

    Google Scholar 

  4. Hossen, S., Rahim, M.S.: Impact of mobile nodes for few mobility models on delay-tolerant network routing protocols, pp. 1–6 (2016)

    Google Scholar 

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

    Article  Google Scholar 

  6. Keränen, A., Ott, J., Kärkkäinen, T.: The one simulator for dtn protocol evaluation, vol. 55, pp. 1–10 (2009)

    Google Scholar 

  7. Mendes, P., Sofia, R.C., Soares, J., Tsaoussidis, V., Diamantopoulos, S., Sarros, C.A.: Information-centric routing for opportunistic wireless networks,vol. 2, pp. 194–195 (2018)

    Google Scholar 

  8. Moreira, W., Mendes, P., Sargento, S.: Opportunistic routing based on daily routines. In: 2012 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM), vol. 6, pp. 1–6 (June 2012)

    Google Scholar 

  9. Narmawala, Z., Srivastava, S.: Community aware heterogeneous human mobility (cahm): model and analysis. Pervasive Mob. Comput. 21, 119–132 (2015)

    Article  Google Scholar 

  10. Pal, S., Saha, B.K., Misra, S.: Game theoretic analysis of cooperative message forwarding in opportunistic mobile networks. IEEE Trans. Cybern. 47(12), 4463–4474 (2017)

    Article  Google Scholar 

  11. Rashidibajgan, S., Doss, R.: Privacy-preserving history-based routing in opportunistic networks. Comput. Secur. 84, 244–255 (2019)

    Article  Google Scholar 

  12. Scott, J., Gass, R., Crowcroft, J., Hui, P., Diot, C., Chaintreau, A.: CRAWDAD dataset cambridge/haggle (v. 2009-05-29) (May 2009)

    Google Scholar 

  13. Sharma, D.K., Dhurandher, S.K., Agarwal, D., Arora, K.: krop: k-means clustering based routing protocol for opportunistic networks. J. Ambient Intell. Humanized Comput. 10(4), 1289–1306 (2019)

    Article  Google Scholar 

  14. Socievole, A., Caputo, A., De Rango, F., Fazio, P.: Routing in mobile opportunistic social networks with selfish nodes. Wirel. Commun. Mob. Comput. pp. 1–15 (2019)

    Google Scholar 

  15. Wu, J., Chen, Z., Zhao, M.: Weight distribution and community reconstitution based on communities communications in social opportunistic networks. In: Peer-to-Peer Networking and Applications, vol. 12, no. 1, pp. 158–166 (2019)

    Google Scholar 

  16. Wu, Y., Zhao, Y., Riguidel, M., Wang, G., Yi, P.: Security and trust management in opportunistic networks: a survey. Secur. Commun. Netw. 8(9), 1812–1827 (2015)

    Article  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  18. Zeng, Y., Xiang, K., Li, D., Vasilakos, A.V.: Directional routing and scheduling for green vehicular delay tolerant networks. Wirel. Netw. 19(2), 161–173 (2013)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Shubham Singh .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Singh, S., Singh, P., Tiwari, A.K. (2020). Comprehensive Analysis of Social-Based Opportunistic Routing Protocol: A Study. In: Singh, P., Pawłowski, W., Tanwar, S., Kumar, N., Rodrigues, J., Obaidat, M. (eds) Proceedings of First International Conference on Computing, Communications, and Cyber-Security (IC4S 2019). Lecture Notes in Networks and Systems, vol 121. Springer, Singapore. https://doi.org/10.1007/978-981-15-3369-3_6

Download citation

Publish with us

Policies and ethics