Skip to main content
SpringerLink
Log in

A Routing Algorithm Based on Node Utility and Energy in Opportunistic Networks

  • Conference paper
  • First Online:
Wireless and Satellite Systems (WiSATS 2021)

Included in the following conference series:

  • 1256 Accesses

Abstract

There does not exit a complete transmission path in the opportunistic network. In order to further improve the delivery rate and transmission delay, hybrid routing algorithms with node utility and redundancy was proposed, but they face the problem of higher network overhead. In addition, data transmission consumes energy while the energy of node is limited. Therefore, efficient nodes may lead to energy depletion due to excessive data transmission, aggravating the network disconnection. Considering this fact, a routing algorithm based on node utility and energy is proposed, which takes into account the influence of self-difference and dynamic variation of node relationship on routing packets, and makes full use of social relations to calculate the social utility of nodes, and synthesizes the node’s residual energy to evaluate the node’s forwarding capability, so as to make balance between communication overhead and energy consumption. Finally, compared with other algorithms, the proposed routing scheme can achieve better packet delivery rate and transmission delay, while network overhead and energy balance are greatly improved.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 109.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 139.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. Wu, D., Zhang, F., Wang, H., et al.: Security-oriented opportunistic data forwarding in mobile social networks. Future Gener. Comput. Syst. 87(10), 803–815 (2017)

    Google Scholar 

  2. Yuan, P., Fan, L., Liu, P., et al.: Recent progress in routing protocols of mobile opportunistic networks: a clear taxonomy, analysis and evaluation. J. Network Comput. Appl. 62(C), 163–170 (2016)

    Google Scholar 

  3. Patel, D., Shah, R.: Improved PROPHET routing protocol in DTN. Int. Res. J. Eng. Technol. 503–509 (2016)

    Google Scholar 

  4. Pan, H., Chaintreau, A., Scott, J., et al.: Pocket switched networks and human mobility in conference environments. In: Proceedings of the 2005 ACM SIGCOMM Workshop on Delay-Tolerant Networking, pp. 244–251. ACM, Philadelphia (2005)

    Google Scholar 

  5. Wang, X., Lin, Y., Zhang, S., et al.: A social activity and physical contact-based routing algorithm in mobile opportunistic networks for emergency response to sudden disasters. Enterp. Inf. Syst. 1–30 (2015)

    Google Scholar 

  6. Yuan, P., Ma, H., Fu, H.: Hotspot-entropy based data forwarding in opportunistic social networks. Pervasive Mob. Comput. 16, 136–154 (2015)

    Article  Google Scholar 

  7. Ayyat, S.A., Harras, K.A., Aly, S.G.: Interest aware PeopleRank: towards effective social-based opportunistic advertising. In: IEEE Wireless Communications and Networking Conference. IEEE (2013)

    Google Scholar 

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

  9. Qirtas, M.M., Faheem, Y., Rehmani, M.H.: A cooperative mobile Throwbox-based routing protocol for social-aware delay tolerant networks. Wirel. Netw. 2, 1–13 (2020)

    Google Scholar 

  10. Wang, X., Lin, Y., Zhang, S., et al.: A social activity and physical contact-based routing algorithm in mobile opportunistic networks for emergency response to sudden disasters. Enterp. Inf. Syst. 11(1–5), 597–626 (2015)

    Google Scholar 

  11. Boldrini, C., Conti, M., Jacopini, J., et al.: HiBOp: a history based routing protocol for opportunistic networks. In: IEEE International Symposium on World of Wireless, Mobile and Multimedia Networks (2007)

    Google Scholar 

  12. Lindgren, A., Doria, A.: Probabilistic routing in intermittently connected networks. ACM SIGMOBILE Mobile Comput. Commun. Rev. 7(3), 19 (2003)

    Article  Google Scholar 

  13. Dhurandher, S.K., et al.: EDR: an encounter and distance based routing protocol for opportunistic networks. In: IEEE International Conference on Advanced Information Networking and Applications IEEE (2016)

    Google Scholar 

  14. Sharma, D.K., Dhurandher, S.K., Woungang, I., et al.: A machine learning-based protocol for efficient routing in opportunistic networks. IEEE Syst. J. 12, 2207–2213 (2016)

    Article  Google Scholar 

  15. Ying, Z., Zhang, C., Li, F., et al.: Geo-social: routing with location and social metrics in mobile opportunistic networks. In: IEEE International Conference on Communications, pp. 3405–3410 (2015)

    Google Scholar 

  16. Jang, K., Lee, J., Kim, S.K., et al.: An adaptive routing algorithm considering position and social similarities in an opportunistic network. Wirel. Netw. 22(5), 1537–1551 (2016)

    Article  Google Scholar 

  17. Jia, W.U., Chen, Z.: Reducing energy consumption priority selection of node transmission routing algorithm in opportunistic network. Adv. Inf. Sci. Serv. Sci. (2014)

    Google Scholar 

  18. Sobin, C.C., Raychoudhury, V., Saha, S.: An energy-efficient and buffer-aware routing protocol for opportunistic smart traffic management. In: Proceedings of the 18th International Conference on Distributed Computing and Networking, pp. 1–8 (2017)

    Google Scholar 

  19. Basaras, P., Iosifidis, G., Katsaros, D., et al.: Identifying influential spreaders in complex multilayer networks: a centrality perspective. IEEE Trans. Netw. Sci. Eng. 6(1), 31–45 (2017)

    Article  MathSciNet  Google Scholar 

  20. Freeman, L.C.: Centrality in social networks conceptual clarification. Soc. Netw. 1(3), 215–239 (1978)

    Article  Google Scholar 

  21. Wei, K., Xiao, L., Ke, X.: A survey of social-aware routing protocols in delay tolerant networks: applications, taxonomy and design-related issues. IEEE Commun. Surv. Tutor. 16(1), 556–578 (2014)

    Article  Google Scholar 

  22. Ahmad, T., Li, X.J., Seet, B.C., et al.: Social network analysis based localization technique with clustered closeness centrality for 3D wireless sensor networks. Electronics 9(5), 738 (2020)

    Article  Google Scholar 

  23. Ding, S., Hipel, K.W., Dang, Y.G.: Forecasting China’s electricity consumption using a new grey prediction model. Energy 149(4), 314–328 (2018)

    Article  Google Scholar 

  24. Yu, Q., Lyu, J., Jiang, L., et al.: Traffic anomaly detection algorithm for wireless sensor networks based on improved exploitation of the GM (1,1) Model. Int. J. Distrib. Sens. Netw. 12(7), 2181256 (2016)

    Article  Google Scholar 

  25. Kun, G., Qishan, Z.: Privacy preserving method based on GM (1,1) and its application to clustering. Grey Syst. Theor. Appl. 2(2), 157–165 (2012)

    Article  Google Scholar 

  26. Pratima, G., Pardasani, K.R.: A fast algorithm for mining multilevel association rule based on Boolean matrix. Int. J. Comput. Sci. Eng. 2(3), 746–752 (2010)

    Google Scholar 

  27. Soni, A., Saxena, A., Bajaj, P.: A methodological approach for mining the user requirements using Apriori algorithm. J. Cases Inform. Technol. 22(4), 1–30 (2020)

    Article  Google Scholar 

  28. Yuan, P., Song, M.: MONICA one simulator for mobile opportunistic networks. In: 11th EAI International Conference on Mobile Multimedia Communications, pp. 21–32 (2018)

    Google Scholar 

  29. Ma, H., Zhao, D., Yuan, P.: Opportunities in mobile crowd sensing. Infocommunications J. 7(2), 32–38 (2015)

    Google Scholar 

  30. Rhee, I., Shin, M., Hong, S., et al.: On the levy-walk nature of human mobility. IEEE/ACM Trans. Netw. (TON) 19(3), 630–643 (2011)

    Article  Google Scholar 

Download references

Acknowledgements

This work was supported in part by the National Natural Science Foundation of China under Grants U1804164, 62072159 and U1404602.

Author information

Authors and Affiliations

  1. College of Computer and Information Engineering, Henan Normal University, Xinxiang, 453007, China

    Peiyan Yuan & Xiaoyan Huang

  2. Engineering Lab of Intelligence Business and Internet of Things, Xinxiang, Henan, China

    Peiyan Yuan

Authors
  1. Peiyan Yuan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xiaoyan Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Peiyan Yuan .

Editor information

Editors and Affiliations

  1. Harbin Institute of Technology, Harbin, China

    Qing Guo

  2. Harbin Institute of Technology, Harbin, China

    Weixiao Meng

  3. Harbin Institute of Technology, Harbin, China

    Min Jia

  4. Harbin University of Science and Technology, Harbin, China

    Xue Wang

Rights and permissions

Reprints and permissions

Copyright information

© 2022 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Yuan, P., Huang, X. (2022). A Routing Algorithm Based on Node Utility and Energy in Opportunistic Networks. In: Guo, Q., Meng, W., Jia, M., Wang, X. (eds) Wireless and Satellite Systems. WiSATS 2021. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 410. Springer, Cham. https://doi.org/10.1007/978-3-030-93398-2_49

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-93398-2_49

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-93397-5

  • Online ISBN: 978-3-030-93398-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation