Skip to main content

P-TECS: An Energy Balance Algorithm forĀ Opportunistic Networks Integrating Multiple Node Attributes

  • Conference paper
  • First Online:
Security and Privacy in New Computing Environments (SPNCE 2022)

Abstract

This paper proposes an energy balance opportunistic networks routing algorithm P-TECS. The P-TECS solves the problems of energy consumption of key nodes in existing opportunistic routing algorithms. This paper defines the relay degree of communication between nodes, and designs a P-TECS opportunistic routing algorithm integrating dynamic attributes of multiple nodes. Simulation results show that in resource-constrained opportunistic networks, P-TECS significantly improves the message delivery rate and average remaining energy of nodes, and significantly reduces the routing overhead rate.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.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. Xiong, Y.P.: Opportunistic networks. J. Softw. 20(1), 124ā€“137 (2009)

    ArticleĀ  Google ScholarĀ 

  2. Mansouri, H.: Checkpointing distributed application running on mobile ad hoc networks. Int. J. High Perform. Comput. Netw. 11(2), 95ā€“107 (2018)

    ArticleĀ  Google ScholarĀ 

  3. Lei, Y.J.: Research on routing protocol based on opportunistic communication in internet of vehicles environment. Changā€™an University (2018)

    Google ScholarĀ 

  4. Bacanli, S.: Energy-efficient unmanned aerial vehicle scanning approach with node clustering in opportunistic networks. Comput. Commun. 161, 76ā€“85 (2020)

    ArticleĀ  Google ScholarĀ 

  5. De Vos, L.D.: Hydrometeorological monitoring using opportunistic sensing networks in the Amsterdam metropolitan area. Bull. Am. Meteor. Soc. 101(2), E167ā€“E185 (2019)

    ArticleĀ  MathSciNetĀ  Google ScholarĀ 

  6. Li, X.P.: Research on opportunistic routing for mine wireless coverage blind area safety monitoring. China University of Mining and Technology (2020)

    Google ScholarĀ 

  7. Zhou, H.: Predicting temporal social contact patterns for data forwarding in opportunistic mobile networks. IEEE Trans. Veh. Technol. 66(11), 10372ā€“10383 (2017)

    ArticleĀ  Google ScholarĀ 

  8. Taleb, T.: Mobile edge computing potential in making cities smarter. IEEE Commun. Mag. 55(3), 38ā€“43 (2017)

    ArticleĀ  Google ScholarĀ 

  9. Ma, H.: Application of throughput rate-based Prophet routing in DTN. Comput. Technol. Dev. 28(7), 187ā€“191 (2018)

    Google ScholarĀ 

  10. Zhang, F.: The ProPhet routing algorithm. Comput. Eng. Design 36(5), 1145ā€“1149 (2015)

    Google ScholarĀ 

  11. Fradj, H.B., Anane, R., Bouallegue, R.: Energy consumption for opportunistic routing algorithms in WSN. In: 2018 IEEE 32nd International Conference on Advanced Information Networking and Applications, pp. 259ā€“265. IEEE, Krakow (2018)

    Google ScholarĀ 

  12. Bista, B.B., Rawat, D.B.: EA-PRoPHET: an energy aware PRoPHET-based routing protocol for delay tolerant networks. In: 2017 IEEE 31st International Conference on Advanced Information Networking and Applications, pp. 670ā€“677. IEEE, Taipei (2017)

    Google ScholarĀ 

  13. Chen, Z.G.: Social relationship-based data transmission mechanisms in opportunistic social networks. J. Huazhong Univ. Sci. Technol. (Nat. Sci. Edn.) 49(2), 79ā€“84 (2021)

    Google ScholarĀ 

  14. Xu, G., Xu, Z.D., He, Y.: Opportunistic networks routing algorithm based on the uncertain social relationship. In: 2018 IEEE 22nd International Conference on Computer Supported Cooperative Work in Design, pp. 301ā€“306. IEEE, Nanjing (2018)

    Google ScholarĀ 

  15. Lindgren, A.: Probabilistic routing in intermittently connected networks. Serv. Assur. Partial Intermittent Resour. 7(3), 19ā€“20 (2013)

    Google ScholarĀ 

  16. Chen, Z.G.: Energy balanced routing algorithm for opportunistic network based on message importance. J. Commun. 39(12), 91ā€“101 (2018)

    Google ScholarĀ 

  17. Wang, Z.: Research on opportunistic network simulator ONE and its extension. Appl. Res. Comput. 29(1), 272ā€“277 (2012)

    Google ScholarĀ 

  18. Chen, J.J., Xu, G., Wu, X.R., Wei, F.Q., He, L.Q.: Energy balance and cache optimization routing algorithm based on communication willingness. In: 2021 IEEE Wireless Communications and Networking Conference, pp. 1ā€“6. IEEE, Nanjing (2021)

    Google ScholarĀ 

Download references

Acknowledgment

This work was supported by the National Natural Science Foundation of China under Grants 62061036, 61841109, and 62077032; Natural Science Foundation of Inner Mongolia under Grant 2019MS06031 and in part by the Self-Open Project of Engineering Research Center of Ecological Big Data, Ministry of Education.

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to Gang Xu or Jingjian Chen .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

Ā© 2023 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

Xu, G., Yang, X., Chen, J., Huang, B. (2023). P-TECS: An Energy Balance Algorithm forĀ Opportunistic Networks Integrating Multiple Node Attributes. In: Jiang, Q., Li, X., Wang, D. (eds) Security and Privacy in New Computing Environments. SPNCE 2022. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 496. Springer, Cham. https://doi.org/10.1007/978-3-031-30623-5_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-30623-5_11

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-30622-8

  • Online ISBN: 978-3-031-30623-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics