Skip to main content
Springer Nature Link
Log in

An Efficient Routing Algorithm Based on Interest Similarity and Trust Relationship Between Users in Opportunistic Networks

  • Conference paper
  • First Online:
Wireless Sensor Networks (CWSN 2017)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 812))

Included in the following conference series:

  • 979 Accesses

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

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

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

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

    Article  MathSciNet  MATH  Google Scholar 

  2. 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)

    Article  Google Scholar 

  3. 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)

    Article  Google Scholar 

  4. 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)

    Article  Google Scholar 

  5. 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)

    Article  Google Scholar 

  6. 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)

    Article  Google Scholar 

  7. Mendes, P.M., Moreira, W.: Structural analysis of social-aware opportunistic networks. Ichthyol. Res. Official J. Ichthyol. Soc. Jpn. 60(1), 85–88 (2013)

    Google Scholar 

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

    Article  Google Scholar 

  9. 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)

    Google Scholar 

  10. 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)

    Article  Google Scholar 

  11. 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)

    Article  Google Scholar 

  12. 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)

    Article  Google Scholar 

  13. Vahdat, A., Becker, D.: Epidemic routing for partially-connected ad hoc networks. Master thesis (2000)

    Google Scholar 

  14. 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

    Google Scholar 

  15. 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)

    Google Scholar 

  16. Lindgren, A., Doria, A., Schelén, O.: Probabilistic routing in intermittently connected networks. ACM Sigmobile Mobile Comput. Commun. Rev. 7(3), 239–254 (2004)

    Google Scholar 

  17. 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)

    Google Scholar 

  18. 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)

    Article  Google Scholar 

  19. 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)

    Google Scholar 

  20. 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)

    Article  Google Scholar 

  21. Bo, W., Chuanhe, H., Layuan, L.: Trust-based minimum cost opportunistic routing for Ad hoc networks. J. Syst. Softw. 84(12), 2107–2122 (2011)

    Article  Google Scholar 

  22. Conti, M., Giordano, S.: Mobile ad hoc networking: milestones, challenges, and new research direction. IEEE Commun. Mag. 52(1), 85–96 (2014)

    Article  Google Scholar 

Download references

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

  1. Key Laboratory of Modern Teaching Technology, Ministry of Education, Xi’an, 710062, China

    Xueyang Qin, Xiaoming Wang, Yaguang Lin, Liang Wang & Lichen Zhang

  2. School of Computer Science, Shaanxi Normal University, Xi’an, 710119, China

    Xueyang Qin, Xiaoming Wang, Yaguang Lin, Liang Wang & Lichen Zhang

Authors
  1. Xueyang Qin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xiaoming Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yaguang Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Liang Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Lichen Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xiaoming Wang .

Editor information

Editors and Affiliations

  1. Harbin Institute of Technology, Harbin, China

    Jianzhong Li

  2. Beijing University of Posts and Telecommunications, Beijing, China

    Huadong Ma

  3. Tianjin University, Tianjin, Tianjin, China

    Keqiu Li

  4. Chinese Academy of Sciences, Beijing, China

    Li Cui

  5. Chinese Academy of Sciences, Beijing, China

    Limin Sun

  6. Tianjin University, Tianjin, China

    Zenghua Zhao

  7. Tianjin University, Tianjin, China

    Xiaofei Wang

Copyright information

© 2018 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

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)

Publish with us

Policies and ethics

Societies and partnerships