Abstract
In opportunistic networks, due to the randomness of node moving and the uncertainty of network topology, it’s a challenging issue to establish a complete communication link between the source and the destination node. Fortunately, the “store-carry-forward” strategy can be used to solve this problem. However, such forwarding strategy heavily relies on the cooperation among nodes. Thus, the selection of a proper relay node has a great impact on the performance of the whole network. In this paper, considering the differences between users’ interest and the variability of interest with the change of time, firstly, we propose a dynamic update and calculation method of the value of interests, and then establish a calculation model of interest. Secondly, according to the Ebbinghaus forgetting curve and the ability of users to forward messages, we propose a dynamic calculation method of the trust value of users and establish a model for computing trust relationships. Finally, we propose an efficient routing algorithm based on interest similarity and trust relationship (BIST) between users. The simulation results show that our proposed algorithm has better routing performance, and it validates the correctness and validity of our proposed models and algorithm.
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
Xiao, M., Wu, J., Huang, L.: Community-aware opportunistic routing in mobile social networks. IEEE Trans. Comput. 63(7), 1682–1695 (2014)
Kolios, P., Friderikos, V., Papadaki, K.: Energy-efficient relaying via store-carry and forward within the cell. IEEE Trans. Mobile Comput. 13(1), 202–215 (2014)
Bhorkar, A., Naghshvar, M., Javidi, T.: Opportunistic routing with congestion diversity in wireless ad hoc networks. IEEE/ACM Trans. Netw. 24(2), 1167–1180 (2016)
Trifunovic, S., Kouyoumdjieva, S.T., Distl, B., et al.: A decade of research in opportunistic networks: challenges, relevance, and future directions. IEEE Commun. Mag. 55(1), 168–173 (2017)
Wang, X., Lin, Y., Zhang, S., Cai, Z.: A social activity and physical contact-based routing algorithm in mobile opportunistic networks for emergency response to sudden disasters. Enterp. Inf. Syst. 11(5), 597–626 (2017)
Chen, L., Yu, C., Tseng, C., et al.: A content-centric framework for effective data dissemination in opportunistic networks. IEEE J. Sel. Areas Commun. 10, 761–772 (2008)
Mendes, P.M., Moreira, W.: Structural analysis of social-aware opportunistic networks. Ichthyol. Res. Official J. Ichthyol. Soc. Jpn. 60(1), 85–88 (2013)
Hui, P., Crowcroft, J., Yoneki, E.: BUBBLE rap: social-based forwarding in delay-tolerant networks. IEEE Trans. Mobile Comput. 10(11), 1576–1589 (2011)
Liu, Y., Yan, L., Liu, K., et al.: Incentives for delay-constrained data query in mobile opportunistic social networks. In: Control Conference, pp. 10363–10368. IEEE (2016)
Liu, J., Wan, J., Wang, Q., Deng, P., Zhou, K., Qiao, Y.: A survey on position-based routing for vehicular ad hoc networks. Telecommun. Syst. 62(1), 15–30 (2016)
Allen, S.M., Chorley, M.J., Colombo, G.B.: Exploiting user interest similarity and social links for micro-blog forwarding in mobile opportunistic networks. Pervasive Mobile Comput. 11(2), 106–131 (2014)
Jang, K., Lee, J., Kim, S.K., Yoon, J.H., Yang, S.B.: An adaptive routing algorithm considering position and social similarities in an opportunistic network. Wirel. Netw. 22(5), 1537–1551 (2016)
Vahdat, A., Becker, D.: Epidemic routing for partially-connected ad hoc networks. Master thesis (2000)
Harras, K.A., Almeroth, K.C., Belding-Royer, E.M.: Delay Tolerant Mobile Networks (DTMNs): controlled flooding in sparse mobile networks. In: Boutaba, R., Almeroth, K., Puigjaner, R., Shen, S., Black, James, P. (eds.) NETWORKING 2005. LNCS, vol. 3462, pp. 1180–1192. Springer, Heidelberg (2005). https://doi.org/10.1007/11422778_95
Spyropoulos, T., Psounis, K., Raghavendra, C.S.: Spray and wait: an efficient routing scheme for intermittently connected mobile networks. In: ACM SIGCOMM Workshop on Delay-Tolerant Networking, pp. 252–259. ACM (2005)
Lindgren, A., Doria, A., Schelén, O.: Probabilistic routing in intermittently connected networks. ACM Sigmobile Mobile Comput. Commun. Rev. 7(3), 239–254 (2004)
Leguay, J., Friedman. T., Conan, V.: DTN routing in a mobility pattern space. In: Proceedings of the 2005 ACM SIGCOMM Workshop on Delay-Tolerant Networking, pp. 276–283 (2005)
Ciobanu, R.I., Marin, R.C., Dobre, C., Cristea, V.: Interest-awareness in data dissemination for opportunistic networks. Ad hoc Netw. 25, 330–345 (2014)
Shu, J., Zeng, L., Liu, L.: Random graph model for opportunistic sensor networks based on divided area. Commun. Comput. Inf. Sci. 418, 179–190 (2014)
Yao, L., Man, Y., Huang, Z., Deng, J., Wang, X.: Secure routing based on social similarity in opportunistic networks. IEEE Trans. Wirel. Commun. 15(1), 594–605 (2016)
Bo, W., Chuanhe, H., Layuan, L.: Trust-based minimum cost opportunistic routing for Ad hoc networks. J. Syst. Softw. 84(12), 2107–2122 (2011)
Conti, M., Giordano, S.: Mobile ad hoc networking: milestones, challenges, and new research direction. IEEE Commun. Mag. 52(1), 85–96 (2014)
Acknowledgments
This work is supported by the National Natural Science Foundation of China (Grant Nos. 61373083, 61402273); the Program of Shaanxi Science and Technology Innovation Team of China (Grant No. 2014KTC-18); the 111 Programme of Introducing Talents of Discipline to Universities (Grant No. B16031).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Qin, X., Wang, X., Lin, Y., Wang, L., Zhang, L. (2018). An Efficient Routing Algorithm Based on Interest Similarity and Trust Relationship Between Users in Opportunistic Networks. In: Li, J., et al. Wireless Sensor Networks. CWSN 2017. Communications in Computer and Information Science, vol 812. Springer, Singapore. https://doi.org/10.1007/978-981-10-8123-1_24
Download citation
DOI: https://doi.org/10.1007/978-981-10-8123-1_24
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-10-8122-4
Online ISBN: 978-981-10-8123-1
eBook Packages: Computer ScienceComputer Science (R0)
