Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
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)
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)
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)
Dang, H., Wu, H.: Clustering and cluster-based routing protocol for delay-tolerant mobile networks. IEEE Trans. Wirel. Commun. 9(6), 1874–1881 (2010)
Lo, S.-C., Tsai, C.-C., Lai, Y.-H.: Quota-control routing in delay-tolerant networks. Ad Hoc Netw. 25, 393–405 (2015)
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)
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 2003
Li, Q., Rus, D.: Sending messages to mobile users in disconnected ad-hoc wireless networks. In: Proceedings of ACM MobiCom, pp. 44–55, August 2000
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 2004
Vahdat, A., Becker, D.: Epidemic routing for partially connected ad hoc networks. Technical report, April 2000
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 2005
Burgess, J, Gallagher, B., Jensen, D., Levine, B.N.: MaxProp: routing for vehicle-based disruption-tolerant networking. In: Proceedings of IEEE INFOCOM, March 2006
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 2004
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)
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 2003
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)
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)
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)
Chen, H., Lou, W.: Contact expectation based routing for delay tolerant networks. Ad Hoc Netw. 36, 244–257 (2016)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Rangra, A., Sehgal, V.K., Shukla, S. (2019). Analysis and Impact of Trust and Recommendation in Social Network Based Algorithm for Delay Tolerant Network. In: Singh, M., Gupta, P., Tyagi, V., Flusser, J., Ören, T., Kashyap, R. (eds) Advances in Computing and Data Sciences. ICACDS 2019. Communications in Computer and Information Science, vol 1046. Springer, Singapore. https://doi.org/10.1007/978-981-13-9942-8_12
Download citation
DOI: https://doi.org/10.1007/978-981-13-9942-8_12
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-13-9941-1
Online ISBN: 978-981-13-9942-8
eBook Packages: Computer ScienceComputer Science (R0)