Skip to main content
Log in

Weight distribution and community reconstitution based on communities communications in social opportunistic 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 social networks. Furthermore, they carry and store useful information. Mobile devices can select destination nodes and deliver messages through opportunistic networks because messages can be securely and conveniently stored, carried, and transmitted with nodes. However, many communities may deliver messages often depending on one or two nodes. If those nodes are not enough cache and over-flooding, data transmission in communities may wait for a long time. In this study, weight distribution between nodes and communities reconstitution would be established to solve this problem in social opportunistic networks. With satisfactory results from simulation and comparison with some existing algorithms, the new method is found to not only decrease tendency of energy consumption but also improve the delivery ratio, overhead and End-to-end delay in social opportunistic networks.

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

Access this article

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

Similar content being viewed by others

References

  1. Hu Y, Liu A (2015) An efficient heuristic subtraction deployment strategy to guarantee quality of event detection for WSNs. Comput J 58(8):1747–1762

    Article  Google Scholar 

  2. Dong M, Ota K, Yang LT, Liu A, Guo M (2016) LSCD: a lowstorage clone detection protocol for cyber-physical systems. IEEE Trans CAD Integr Circuits Syst 35(5):712–723

    Article  Google Scholar 

  3. Dong M, Ota K, Li H, Du S, Zhu H, Guo S (2014) RENDEZVOUS: towards fast event detecting in wireless sensor and actor networks. Computing 96(10):995–1010

    Article  Google Scholar 

  4. Dong M, Ota K, Liu A, Guo M (2016) Joint optimization of lifetime and transport delay under reliability constraint wireless sensor networks. IEEE Trans Parallel Distrib Syst 27(1):225–236

    Article  Google Scholar 

  5. Aliotta JM, Pereira M, Johnson KW et al (2012) Microvesicle entry into marrow cells mediates tissue-specific changes in mRNA by direct delivery of mRNA and induction of transcription. Exp Hematol 38(3):233–245

    Article  Google Scholar 

  6. Lokhov AY, Mézard M, Ohta H, Zdeborová L (2014) Inferring the origin of an epidemic with a dynamic message-passing algorithm. Phys Rev E 90(1):012801–012801

    Article  Google Scholar 

  7. Jia WU, Zhigang CHEN, Ming ZHAO (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 

  8. Misra S, Ojha T, Mondal A (2015) Game-theoretic topology Controlfor opportunistic localization in sparse underwater sensor networks. IEEE Trans Mob Comput 14:990–1003

    Article  Google Scholar 

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

  10. Grossglauser M, Tse DNC (2002) Mobility increases the capacity of ad hoc wireless networks. IEEE/ACM Trans Netw 10:477–486

    Article  Google Scholar 

  11. Wang G, Wang B, Gao Y (2010) Dynamic spray and wait routing algorithm with quality of node in delay tolerant network[C]//communications and mobile computing (CMC), 2010 international conference on. IEEE 3:452–456

    Google Scholar 

  12. Spyropoulos T, Psounis K, Raghavendra CS (2005) Spray and wait: an efficient routing scheme for intermittently connected mobile networks[C]//proceedings of the 2005 ACM SIGCOMM workshop on delay-tolerant networking. ACM 252–259

  13. Leguay J, Friedman T, Conan V (2005) DTN routing in a mobility pattern space[C]//proceedings of the 2005 ACM SIGCOMM workshop on delay-tolerant networking. ACM 276–283

  14. Burgess J, Gallagher B, Jensen D, et al. (2006) MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks[C]//INFOCOM 6: 1–11

  15. Leguay J, Lopez-Ramos M, Jean-Marie K, et al. (2008) An efficient service oriented architecture for heterogeneous and dynamic wireless sensor networks[C]//local computer networks, 2008. LCN 2008. IEEE Conference on IEEE 740–747

  16. Burns B, Brock O, Levine BN (2008) MORA routing and capacity building in disruption-tolerant networks. Ad Hoc Netw 6(4):600–620

    Article  Google Scholar 

  17. Kavitha V, Altman E (2010) Analysis and Design of message ferry routes in sensor networks using polling models[C]//modeling and optimization in mobile, ad hoc and wireless networks (WiOpt), 2010 proceedings of the 8th international symposium on. IEEE 247–255

Download references

Acknowledgements

This work was supported in The National Natural Science Foundation of China(61672540); Hunan Provincial Natural Science Foundation of China (2018JJ3299, 2018JJ3682); China Postdoctoral Science Foundation funded project(2017 M612586); Foundation of Central South University(185684); Major Program of National Natural Science Foundation of China(71633006);

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jia Wu.

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. Weight distribution and community reconstitution based on communities communications in social opportunistic networks. Peer-to-Peer Netw. Appl. 12, 158–166 (2019). https://doi.org/10.1007/s12083-018-0649-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12083-018-0649-x

Keywords

Navigation