Skip to main content

Advertisement

Springer Nature Link
Log in

Low energy consumption routing algorithm based on message importance in opportunistic social networks

  • Published:
Peer-to-Peer Networking and Applications Aims and scope Submit manuscript

Abstract

With the advent of the 5G era, the number and complexity of messages on the network has exploded. Some important information needs to be forwarded first. However, in traditional opportunistic networks, the importance of messages is not paid attention to, and messages are only transmitted on key nodes. Excessive dependence on key nodes will shorten the life cycle of the network. Therefore, we propose a message importance based low energy consumption routing (MILECR) algorithm. When forwarding the message, we consider the energy of the node and the importance of the message. It solves the problems of priority forwarding of important messages and fast energy consumption of key nodes. When the cache space is insufficient, we adopt the cache replacement strategy to ensure the maximum cache space. In the simulation experiment, we analyzed the influence of the number of nodes and cache space on the algorithm. The results show that the algorithm has good performance in terms of message delivery rate, message delay, and energy consumption.

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

Access this article

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

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12

Similar content being viewed by others

References

  1. Wu Z et al (2018) Development challenges for 5G base station antennas. 2018 International Workshop on Antenna Technology (iWAT). IEEE. https://doi.org/10.1109/IWAT.2018.8379163

  2. Hernández-Orallo E et al (2017) An analytical model based on population processes to characterize data dissemination in 5g opportunistic networks. IEEE Access 6:1603–1615. https://doi.org/10.1109/access.2017.2779748

    Article  Google Scholar 

  3. Gautam T, Dev A (2019) Opportunistic network routing protocols: challenges, implementation and evaluation. 2019 9th International Conference on Cloud Computing, Data Science & Engineering (Confluence). IEEE. https://doi.org/10.1109/CONFLUENCE.2019.8776947

  4. Weiyu YANG, Jia WU, Jingwen LUO (2020) Effective date transmission and control base on social communication in Social Opportunistic Complex Networks. Complexity 2020:3721579, 13 pages–3721520. https://doi.org/10.1155/2020/3721579

    Article  MATH  Google Scholar 

  5. Chakchouk N (2015) A survey on opportunistic routing in wireless communication networks. IEEE Communications Surveys & Tutorials 17(4):2214–2241. https://doi.org/10.1109/COMST.2015.2411335

    Article  Google Scholar 

  6. Soelistijanto B, Howarth MP (2014) Transfer reliability and congestion control strategies in opportunistic networks: a survey. IEEE Communications Surveys & Tutorials 16(1):538–555. https://doi.org/10.1109/SURV.2013.052213.00088

    Article  Google Scholar 

  7. Wu J, Chen Z, Zhao M (2020) An efficient data packet iteration and transmission algorithm in opportunistic social networks. J Ambient Intell Humaniz Comput 11:3141–3153. https://doi.org/10.1007/s12652-019-01480-2

    Article  Google Scholar 

  8. Jia WU, Genghua YU, Guan P (2019) Interest characteristic probability predicted method in social opportunistic networks. IEEE Access 7(99):59002–59012. https://doi.org/10.1109/ACCESS.2019.2915359

    Article  Google Scholar 

  9. Wu J, Chen Z, Zhao M (2020) Community recombination and duplication node traverse algorithm in opportunistic social networks. Peer-to-Peer Networking and Applications 13:940–947. https://doi.org/10.1007/s12083-019-00833-0

    Article  Google Scholar 

  10. Jingwen LUO, Jia WU, Yuzhou WU (2020) Advanced data delivery strategy base on multi-perceived community with IoT in social complex networks. Complexity 2020), Article ID 3576542:20–15. https://doi.org/10.1155/2020/3576542

    Article  Google Scholar 

  11. Pelusi L, Passarella A, Conti M (2006) Opportunistic networking: data forwarding in disconnected mobile ad hoc networks. IEEE Commun Mag 44(11):134–141. https://doi.org/10.1109/MCOM.2006.248176

    Article  Google Scholar 

  12. Wu J, Chen Z, Zhao M (2019) Information cache management and data transmission algorithm in opportunistic social networks. Wireless Networks. https://doi.org/10.1007/s11276-018-1691-6

  13. Wu J, Chen Z, Zhao M (2019) SECM status estimation. J Supercomput 75(5):2629–2647. https://doi.org/10.1007/s11227-018-2675-0

    Article  Google Scholar 

  14. Wu J, Chen Z, Zhao M (2018) Weight distribution and community reconstitution based on communities communications in social opportunistic networks. Peer-to-Peer Networking and Applications. https://doi.org/10.1007/s12083-018-0649-x

  15. Chen, Weimin, et al. "An enhanced community-based routing with ferry in opportunistic networks." 2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI). IEEE, 2016. doi: https://doi.org/10.1109/IIKI.2016.8

  16. Guan P, Wu J (2019) Effective data communication based on social community in social opportunistic networks. IEEE Access:1–1. https://doi.org/10.1109/ACCESS.2019.2893308

  17. Haoran, Sun , W. Muqing, and C. Yanan. (2019) A community-based opportunistic routing protocol in delay tolerant networks. 2018 IEEE 4th International Conference on Computer and Communications (ICCC) IEEE. https://doi.org/10.1109/CompComm.2018.8780894

  18. Xiaoli Li and Jia Wu (2020) Node-oriented secure data transmission algorithm based on IoT system in social networks. IEEE Communications Letters, 17th Augest. https://doi.org/10.1109/LCOMM.2020.3017889

  19. Socievole A et al (2013) Opportunistic message routing using multi-layer social networks:39–46. https://doi.org/10.1145/2507908.2507923

  20. Yu G, Wu J (2020) Content caching based on mobility prediction and joint user Prefetch in Mobile edge networks. Peer-to-Peer Netw Appl 13:1839–1852. https://doi.org/10.1007/s12083-020-00954-x

    Article  Google Scholar 

  21. Prodhan AT, Das R, Kabir H, Shoja GC (2011) TTL based routing in opportunistic networks. Journal of Network & Computer Applications 34(5):1660–1670. https://doi.org/10.1016/j.jnca.2011.05.005

    Article  Google Scholar 

  22. Ying B, Xu K, Nayak A (2019) Fair and social-aware message forwarding method in opportunistic social networks. IEEE Communications Letters. https://doi.org/10.1109/LCOMM.2019.2900892

  23. Hui P, Crowcroft J, Yoneki E (2011) BUBBLE rap: social-based forwarding in delay-tolerant networks. IEEE Trans Mob Comput 10(11):1576–1589. https://doi.org/10.1109/TMC.2010.246

    Article  Google Scholar 

  24. Sui Z (2016) The research of the route protocols in opportunistic network. 2015 International Conference on Computational Intelligence and Communication Networks (CICN) IEEE. https://doi.org/10.1109/CICN.2015.45

  25. Huang Y et al (2014) TTL sensitive social-aware routing in mobile opportunistic networks. Consumer Communications & Networking Conference IEEE. https://doi.org/10.1109/CCNC.2014.6994389

  26. Wu J, Chang L, Yu G (2020) Effective data decision-making and transmission system based on Mobile health for chronic diseases Management in the Elderly. IEEE Systems Journal. https://doi.org/10.1109/JSYST.2020.3024816

  27. Socievole A, et al. (2015) ML-SOR: Message1 routing using multi-layer social networks in opportunistic communications. Computer Networks 81.apr.22:201–219. https://doi.org/10.1016/j.comnet.2015.02.016

  28. Socievole A, et al. (2014) Wireless contacts, Facebook friendships and interests: analysis of a multi-layer social network in an academic environment. in 2014 IFIP Wireless Days (WD), https://doi.org/10.1109/WD.2014.7020819

  29. Socievole A, De Rango F (2015) Energy-aware centrality for information forwarding in mobile social opportunistic networks." Wireless Communications & Mobile Computing Conference IEEE. https://doi.org/10.1109/IWCMC.2015.7289155

    Book  Google Scholar 

  30. De Rango F, Amelio S, Fazio P (2013) Enhancements of epidemic routing in delay tolerant networks from an energy perspective. Wireless Communications & Mobile Computing Conference IEEE. https://doi.org/10.1109/IWCMC.2013.6583647

  31. Batabyal S, Bhaumik P (2014) Delay-overhead trade-offs in mobile opportunistic network using TTL based restricted flooding. Applications & Innovations in Mobile Computing IEEE. https://doi.org/10.1109/AIMOC.2014.6785512

  32. Sati S, Ippisch A, Graffi K (2017, 2017) Replication probability-based routing scheme for opportunistic networks. International Conference on Networked Systems (NetSys) IEEE. https://doi.org/10.1109/NetSys.2017.7903953

  33. Yu C et al (2011) Scheduling and dropping policies for probabilistic routing in delay tolerant networks. International Conference on Pervasive Computing & Applications IEEE. https://doi.org/10.1109/ICPCA.2011.6106523

  34. Huang W et al (2018) Connectivity probability based spray and wait routing algorithm in mobile opportunistic networks. IEEE Smartworld, Ubiquitous Intelligence & Computing, Advanced & Trusted Computing, Scalable Computing & Communications, Cloud & Big Data Computing, Internet of People & Smart City Innovation IEEE. https://doi.org/10.1109/SmartWorld.2018.00280

  35. Yazhi L, Jianwei N, Jian M (2009) Content encounter probability based message forwarding in opportunistic networks. First IEEE International Conference on Information Science & Engineering IEEE Computer Society. https://doi.org/10.1109/ICISE.2009.426

  36. Kosmides P, Lambrinos L (2018) Intelligent routing in mobile opportunistic networks. 2018 Global information infrastructure and networking symposium (GIIS), Thessaloniki, Greece, pp. 1–4. https://doi.org/10.1109/GIIS.2018.8635592

  37. Zhao P, Yang X (2016) Opportunistic routing for bandwidth-sensitive traffic in wireless networks with Lossy links. Journal of Communications & Networks 18(5):806–817. https://doi.org/10.1109/JCN.2016.000109

    Article  Google Scholar 

  38. Lindgren A, Doria A, Schelén O (2004) Probabilistic routing in intermittently connected networks. International Workshop on Service Assurance with Partial and Intermittent Resources Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27767-5_24

  39. Nguyen H, Cremonese SG, Puiatti A (2007) Probabilistic routing protocol for intermittently connected mobile ad hoc network (PROPICMAN). IEEE International Symposium on World of Wireless IEEE. https://doi.org/10.1109/WOWMOM.2007.4351696

Download references

Funding

This work was supported in The National Natural Science Foundation of China(61672540); Hunan Provincial Natural Science Foundation of China (2018JJ3299, 2018JJ3682);

Author information

Authors and Affiliations

  1. School of computer science and engineering, Central South University, Chang Sha, 410075, Hu Nan, China

    Sheng Yin, Jia Wu & Genghua Yu

Authors
  1. Sheng Yin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jia Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Genghua Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jia Wu.

Additional information

Publisher’s note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Yin, S., Wu, J. & Yu, G. Low energy consumption routing algorithm based on message importance in opportunistic social networks. Peer-to-Peer Netw. Appl. 14, 948–961 (2021). https://doi.org/10.1007/s12083-021-01072-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12083-021-01072-y

Keywords