Skip to main content
SpringerLink
Log in

Community recombination and duplication node traverse algorithm in opportunistic social networks

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

Abstract

In social communication, mobile devices can be regarded as socialization nodes in opportunistic social networks. Furthermore, they can carry and store useful information. Mobile devices can select destination nodes and deliver messages through opportunistic social networks because messages can be securely and conveniently stored, carried, and transmitted with nodes. However, many communities in traditional methods, may deliver messages often depending on one or two nodes, such as messages exchange by two nodes in Epidemic algorithm, or messages are sprayed with node in Spray and Wait algorithm. If those nodes are not enough cache and over-flooding, data transmission in communities may wait for a long time. In this study, communities are recombined and then duplication nodes are filtered in our method. According to evaluate contribution by node and restructure community, deliver ratio and overhead can be improved in opportunistic networks. With satisfactory results from simulation and comparison with some existing algorithms, the average delivery ratio of new research method is 0.91, which is 30% higher than that of Epidemic algorithm; the end-to-end delay reduces 75% with Spray and wait algorithm.

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

Access this article

Log in via an institution

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

Similar content being viewed by others

Data availability

Data sharing not applicable to this article as no datasets were generated or analyzed during the current study.

References

  1. Wu J, Chen Z, Zhao M (2018) Information cache management and data transmission algorithm in opportunistic social networks. Wirel Netw 25:2977–2988. https://doi.org/10.1007/s11276-018-1691-6

    Article  Google Scholar 

  2. Cheong M, Lee VCS (2011) A microblogging-based approach to terrorism informatics: exploration and chronicling civilian sentiment and response to terrorism events via Twitter. Inf Syst Front 13(13):45–59

    Article  Google Scholar 

  3. Wu J, Chen Z, Zhao M (2017) Effective information transmission based on socialization nodes in opportunistic networks. Comput Netw 129(Part 1):297–305. https://doi.org/10.1016/j.comnet.2017.10.005

    Article  Google Scholar 

  4. Ristanovic N, Theodorakopoulos G, Le Boudec JY (2012) Traps and pitfalls of using contact traces in performance studies of opportunistic networks. NFOCOM, 2012 Proceedings IEEE. IEEE, 2012, pp 1377–1385

  5. Wu J, Chen Z (2016) Data decision and transmission based on mobile data health records on sensor devices in wireless networks. Wirel Pers Commun 90(4):2073–2087. https://doi.org/10.1007/s11277-016-3438-y

    Article  Google Scholar 

  6. Wu J, Chen Z (2016) Human activity optimal cooperation objects selection routing scheme in opportunistic networks communication. Wirel Pers Commun 95:1–19. https://doi.org/10.1007/s11277-017-4001-1

    Article  Google Scholar 

  7. Mehak KKSAS (2014) Nature based trust security protocol against Greyhole attacks in opportunistic networks. Nature 1(3)

  8. Yuan P, Wang W, Wang C (2015) Poster: an adaptive copy spraying scheme for data forwarding in mobile opportunistic networks. In: Proceedings of the 16th ACM International Symposium on Mobile Ad Hoc Networking and Computing. ACM, 2015, pp 377–378

  9. Wu J, Chen Z, Zhao M (2018) SECM: status estimation and cache management algorithm in opportunistic networks. J Super 75:1–12. https://doi.org/10.1007/s11227-018-2675-0

    Article  Google Scholar 

  10. Zhao D, Ma H, Tang S et al (2015) COUPON: a cooperative framework for building sensing maps in mobile opportunistic networks. IEEE Trans Parallel Distrib Syst 26(2):392–402

    Article  Google Scholar 

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

    Article  Google Scholar 

  12. Trifunovic S, Kurant M, Hummel KA et al (2014) Preventing spam in opportunistic networks. Comput Commun 41:31–42

    Article  Google Scholar 

  13. Cheng H, Sun F, Buthpitiya S, Griss M (2012) SensOrchestra: collaborative sensing for symbolic location recognition. Mob Comput Appl Serv 76:195–210

    Google Scholar 

  14. Toledano E, Sawaday D, Lippman A, Holtzman H, Casalegno F (2013) CoCam: a collaborative content sharing framework based on opportunistic P2P networking. In: Proceedings of the IEEE CCNC 2013, pp 158–163

  15. Han B, Pan H, Kumar A (2012) Mobile data offloading through opportunistic communications and social participation. IEEE Trans Mob Comput 11(5):821–834

    Article  Google Scholar 

  16. Wu J, Tian X, Tan Y (2019) Hospital evaluation mechanism based on mobile health for IoT system in social networks. Comput Biol Med 109:1–17. https://doi.org/10.1016/j.compbiomed.2019.04.021

    Article  Google Scholar 

  17. Ra M, Liu B, Porta T, Govindan R. Medusa: a programming framework for crowd-sensing applications. In: Proceedings of the ACM MobiSys 2012, pp 337–350

  18. Wu J, Chen Z (2018) Sensor communication area and node extend routing algorithm in opportunistic networks. Peer-to-Peer Netw Appl 11(1):90–100. https://doi.org/10.1007/s12083-016-0526-4

    Article  MathSciNet  Google Scholar 

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

  20. Jia W, Zhigang C, Ming Z (2019) An efficient data packet iteration and transmission algorithm in opportunistic social networks. Journal of Ambient Intelligence and Humanized Computing pp 1-17. https://doi.org/10.1007/s12652-019-01480-2

  21. Menon VG, Prathap PJ (2016) Comparative analysis of opportunistic routing protocols for underwater acoustic sensor networks. In 2016 International Conference on Emerging Technological Trends (ICETT). IEEE, pp 1–5

  22. Menon VG, Prathap J, J. (2016) Analyzing the behavior and performance of opportunistic routing protocols in highly mobile wireless ad hoc networks. Int J Eng Technol 8(5):1916–1924

    Article  Google Scholar 

  23. Menon VG, Prathap J (2018) Vehicular fog computing: challenges applications and future directions. In: Fog computing: breakthroughs in research and practice. IGI global, pp 220–229

  24. Wu XH, Gu XF, Poslad S (2016) Routing algorithm based on social relations in opportunistic networks. In: International Computer Conference on Wavelet Active Media Technology and Information Processing. IEEE, 2016, pp 146–149

  25. Mayer JM, Hiltz SR, Barkhuus L et al (2016) Supporting opportunities for context-aware social matching: an experience sampling study. In: Conference on Human Factors in Computing Systems. ACM, 2016

  26. Nguyen P, Nahrstedt K (2016) Context-aware crowd-sensing in opportunistic mobile social networks. In: IEEE, International Conference on Mobile Ad Hoc and Sensor Systems. IEEE, 2016, pp 477–478

  27. Talipov E, Chon Y, Cha H (2015) User context-based data delivery in opportunistic smartphone networks. Pervasive Mob Comput 17:122’lC138

    Article  Google Scholar 

  28. Wu J, Yu G, Guan P (2019) Interest characteristic probability predicted method in social opportunistic networks. IEEE Access 7(1):59002–59012. https://doi.org/10.1109/ACCESS.2019.2915359

    Article  Google Scholar 

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, Changsha, 410083, China

    Jia Wu, Zhigang Chen & Ming Zhao

Authors
  1. Jia Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhigang Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ming Zhao
    View author publications

    You can also search for this author in PubMed Google Scholar

Contributions

Jia WU and Ming ZHAO designed the project and drafted the manuscript, collected the data, wrote the code and performed the analysis. All participated in finalizing and approved the manuscript.

Corresponding author

Correspondence to Jia Wu.

Ethics declarations

Competing interests

The authors declare that they have no competing interests (All financial).

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

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

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12083-019-00833-0

Keywords

Search

Navigation