Analysis and Impact of Trust and Recommendation in Social Network Based Algorithm for Delay Tolerant Network

  • Abhilasha Rangra
  • Vivek Kumar SehgalEmail author
  • Shailendra Shukla
Conference paper
Part of the Communications in Computer and Information Science book series (CCIS, volume 1046)


In delay tolerant network data, routing is a field of concern in late years and a lot of researchers suggested many techniques for routing. Number of nodes is very less in delay tolerant sparse network, even criteria of losing data is huge. Many approaches been proposed in recent past but most of them failed to perform significantly. An opinion dynamic based approach proposed in this work, which calculates the trust value of a node due to which source node decide whether to send the data to the next node or not because of security issues as in network malicious nodes can be present, and it also calculate an opinion with other nodes too in a network. An opinion calculated based on parameters like packet delivery delay, number of packets lost and residual energy. The result also shows the improvement in various performance parameters in the network.


Delay tolerant network (DTN) Data routing 


  1. 1.
    Gao, W., Li, Q., Zhao, B., Cao, G.: Multicasting in delay tolerant networks: a social network perspective. In: Proceedings of the Tenth ACM International Symposium on Mobile Ad Hoc Networking and Computing, pp. 299–308. ACM (2009)Google Scholar
  2. 2.
    Liu, Y., et al.: Performance and energy consumption analysis of a delay-tolerant network for censorship-resistant communication. In: Proceedings of the 16th ACM International Symposium on Mobile Ad Hoc Networking and Computing, pp. 257–266. ACM (2015)Google Scholar
  3. 3.
    Costa, P., Mascolo, C., Musolesi, M., Picco, G.P.: Socially-aware routing for publish-subscribe in delay-tolerant mobile ad hoc networks. IEEE J. Sel. Areas Commun. 26(5), 748–760 (2008)CrossRefGoogle Scholar
  4. 4.
    Dang, H., Wu, H.: Clustering and cluster-based routing protocol for delay-tolerant mobile networks. IEEE Trans. Wirel. Commun. 9(6), 1874–1881 (2010)CrossRefGoogle Scholar
  5. 5.
    Lo, S.-C., Tsai, C.-C., Lai, Y.-H.: Quota-control routing in delay-tolerant networks. Ad Hoc Netw. 25, 393–405 (2015)CrossRefGoogle Scholar
  6. 6.
    Frenkiel, R.H., Badrinath, B.R., Borres, J., Yates, R.D.: The infostations challenge: balancing cost and ubiquity in delivering wireless data. IEEE Pers. Commun. 7(2), 66–71 (2000)CrossRefGoogle Scholar
  7. 7.
    Shah, R.C., Roy, S., Jain, S., Brunette, W.: Data MULEs: modeling a three-tier architecture for sparse sensor networks. In: Proceedings of First IEEE International Workshop Sensor Network Protocols and Applications (SNPA 2003), pp. 30–41, May 2003Google Scholar
  8. 8.
    Li, Q., Rus, D.: Sending messages to mobile users in disconnected ad-hoc wireless networks. In: Proceedings of ACM MobiCom, pp. 44–55, August 2000Google Scholar
  9. 9.
    Zhao, W., Ammar, M., Zegura, E.: A message ferrying approach for data delivery in sparse mobile ad hoc networks. In: Proceedings of ACM MobiHoc, pp. 187–198, May 2004Google Scholar
  10. 10.
    Vahdat, A., Becker, D.: Epidemic routing for partially connected ad hoc networks. Technical report, April 2000Google Scholar
  11. 11.
    Spyropoulos, T., Psounis, K., Raghavendra, C.S.: Spray and wait: an efficient routing scheme for intermittently connected mobile networks. In: Proceedings of ACM SIGCOMM Workshop Delay-Tolerant Networking (WDTN 2005), pp. 252–259, August 2005Google Scholar
  12. 12.
    Burgess, J, Gallagher, B., Jensen, D., Levine, B.N.: MaxProp: routing for vehicle-based disruption-tolerant networking. In: Proceedings of IEEE INFOCOM, March 2006Google Scholar
  13. 13.
    Lindgren, A., Doria, A., Schelén, O.: Probabilistic routing in intermittently connected networks. In: Proceedings of First International Workshop Service Assurance with Partial and Intermittent Resources (SAPIR 2004), pp. 239–254, August 2004CrossRefGoogle Scholar
  14. 14.
    Khelil, A., Marron, P.J., Rothermel, K.: Contact-based mobility metrics for delay-tolerant ad hoc networking. In: Proceedings of 13th IEEE International Symposium Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS 2005) pp. 435–444 (2005)Google Scholar
  15. 15.
    Tan, K., Zhang, Q., Zhu, W.: Shortest path routing in partially connected ad hoc networks. In: Proceedings of IEEE Global Telecommunication Conference (GLOBECOM 2003), vol. 2, pp. 1038–1042, December 2003Google Scholar
  16. 16.
    Dubois-Ferriere, H., Grossglauser, M., Vetterli, M.: Age matters: efficient route discovery in mobile ad hoc networks using encounter ages. In: Proceedings of ACM MobiHoc, pp. 257–266 (2003)Google Scholar
  17. 17.
    Grossglauser, M., Vetterli, M.: Locating nodes with ease: last encounter routing in ad hoc networks through mobility diffusion. In: Proceedings of IEEE INFOCOM, vol. 3, pp. 1954–1964 (2003)Google Scholar
  18. 18.
    Daly, E.M., Haahr, M.: 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, pp. 32–40. ACM (2007)Google Scholar
  19. 19.
    Chen, H., Lou, W.: Contact expectation based routing for delay tolerant networks. Ad Hoc Netw. 36, 244–257 (2016)CrossRefGoogle Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2019

Authors and Affiliations

  • Abhilasha Rangra
    • 1
  • Vivek Kumar Sehgal
    • 1
    Email author
  • Shailendra Shukla
    • 1
  1. 1.Jaypee University of Information TechnologyWakhnaghatIndia

Personalised recommendations