Skip to main content
Top
Published in: Wireless Networks 6/2019

17-02-2018

Information cache management and data transmission algorithm in opportunistic social networks

Authors: Jia Wu, Zhigang Chen, Ming Zhao

Published in: Wireless Networks | Issue 6/2019

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

In social networks, nodes should analyze communication area during data transmission and find suitable neighbors to perform effective data classification transmission. This is similar to finding certain transmission destinations during data transmission with mobile devices. However, cache space with node in social opportunistic networks is limited, and waiting for destination node could also cause end-to-end delay. To improve the transmission environment, this study established a node recognition method for assessment probability, to satisfy the priority adjustment for the high probability nodes of cache, and then cache space should be reconstructed. To avoid accidentally deleting cached data, the cache task of the node is shared through the neighbor node cooperation, and the effective data transmission is performed. Through experiments and the comparison of social network algorithms, the proposed scheme improves delivery ratio by 82% and reduces delay by 74% with the traditional algorithms on average.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
1.
go back to reference Hu, Y., & Liu, A. (2015). An efficient heuristic subtraction deployment strategy to guarantee quality of event detection for WSNs. The Computer Journal, 58(8), 1747.CrossRef Hu, Y., & Liu, A. (2015). An efficient heuristic subtraction deployment strategy to guarantee quality of event detection for WSNs. The Computer Journal, 58(8), 1747.CrossRef
2.
go back to reference Guo, H., Wang, X. W., Huang, M., et al. (2012). Adaptive epidemic routing algorithm based on multi queue in DTN. Journal of Chinese Computer Systems, 33(4), 829–832. Guo, H., Wang, X. W., Huang, M., et al. (2012). Adaptive epidemic routing algorithm based on multi queue in DTN. Journal of Chinese Computer Systems, 33(4), 829–832.
3.
go back to reference Wang G, Wang B, Gao Y (2010) Dynamic spray and wait routing algorithm with quality of node in delay tolerant network. In: International conference on communications and mobile computing. IEEE, pp. 452–456. Wang G, Wang B, Gao Y (2010) Dynamic spray and wait routing algorithm with quality of node in delay tolerant network. In: International conference on communications and mobile computing. IEEE, pp. 452–456.
5.
go back to reference Sheu, J. P., & Chuo, Y. C. (2016). Wildcard rules caching and cache replacement algorithms in software-defined networking. IEEE Transactions on Network and Service Management, 13(1), 19–29.CrossRef Sheu, J. P., & Chuo, Y. C. (2016). Wildcard rules caching and cache replacement algorithms in software-defined networking. IEEE Transactions on Network and Service Management, 13(1), 19–29.CrossRef
6.
go back to reference Lokhov, A. Y., Mézard, M., Ohta, H., et al. (2014). Inferring the origin of an epidemicwith a dynamic message-passing algorithm. Physical Review E, 90(1), 012801.CrossRef Lokhov, A. Y., Mézard, M., Ohta, H., et al. (2014). Inferring the origin of an epidemicwith a dynamic message-passing algorithm. Physical Review E, 90(1), 012801.CrossRef
7.
go back to reference Wang, Y., Vasilakos, A. V., Jin, Q., et al. (2014). Survey on mobile social networking in proximity (MSNP): approaches, challenges and architecture. Wireless Networks, 20(6), 1295–1311.CrossRef Wang, Y., Vasilakos, A. V., Jin, Q., et al. (2014). Survey on mobile social networking in proximity (MSNP): approaches, challenges and architecture. Wireless Networks, 20(6), 1295–1311.CrossRef
8.
go back to reference Misra, S., Ojha, T., & Mondal, A. (2015). Game-theoretic topology control for opportunistic localization in sparse underwater sensor networks. IEEE Transactions on Mobile Computing, 14, 990–1003.CrossRef Misra, S., Ojha, T., & Mondal, A. (2015). Game-theoretic topology control for opportunistic localization in sparse underwater sensor networks. IEEE Transactions on Mobile Computing, 14, 990–1003.CrossRef
9.
go back to reference Naderializadeh, N., Maddah-Ali, M. A., & Avestimehr, A. S. (2016). Fundamental limits of cache-aided interference management. IEEE Transactions on Information Theory, 63(5), 3092–3107.MathSciNetMATH Naderializadeh, N., Maddah-Ali, M. A., & Avestimehr, A. S. (2016). Fundamental limits of cache-aided interference management. IEEE Transactions on Information Theory, 63(5), 3092–3107.MathSciNetMATH
10.
go back to reference Rango, F. D., Socievole, A., & Marano, S. (2015). Exploiting online and offline activity-based metrics for opportunistic forwarding. Wireless Networks, 21(4), 1163–1179.CrossRef Rango, F. D., Socievole, A., & Marano, S. (2015). Exploiting online and offline activity-based metrics for opportunistic forwarding. Wireless Networks, 21(4), 1163–1179.CrossRef
11.
go back to reference Zhao, J., Zhu, Y., & Ni, L. M. (2015). Correlating mobility with social encounters: Distributed localization in sparse mobile networks. Wireless Networks, 21(1), 201–215.CrossRef Zhao, J., Zhu, Y., & Ni, L. M. (2015). Correlating mobility with social encounters: Distributed localization in sparse mobile networks. Wireless Networks, 21(1), 201–215.CrossRef
12.
go back to reference Tuncer, D., Sourlas, V., Charalambides, M., et al. (2016). Scalable cache management for ISP-operated content delivery services. IEEE Journal on Selected Areas in Communications, 34(8), 2063–2076.CrossRef Tuncer, D., Sourlas, V., Charalambides, M., et al. (2016). Scalable cache management for ISP-operated content delivery services. IEEE Journal on Selected Areas in Communications, 34(8), 2063–2076.CrossRef
13.
go back to reference Gao, W., Cao, G., Iyengar, A., & Srivatsa, M. (2014). Cooperative caching for efficient data access in disruption tolerant networks. IEEE Transactions on Mobile Computing, 13(3), 611–625.CrossRef Gao, W., Cao, G., Iyengar, A., & Srivatsa, M. (2014). Cooperative caching for efficient data access in disruption tolerant networks. IEEE Transactions on Mobile Computing, 13(3), 611–625.CrossRef
14.
go back to reference Chen, K., & Shen, H. (2017). FaceChange: Attaining neighbor node anonymity in mobile opportunistic social networks with fine-grained control. IEEE/ACM Transactions on Networking, 25(2), 1176–1189.CrossRef Chen, K., & Shen, H. (2017). FaceChange: Attaining neighbor node anonymity in mobile opportunistic social networks with fine-grained control. IEEE/ACM Transactions on Networking, 25(2), 1176–1189.CrossRef
15.
go back to reference Zheng, H., & Wu, J. (2017). Up-and-down routing through nested core-periphery hierarchy in mobile opportunistic social networks. IEEE Transactions on Vehicular Technology, 66(5), 4300–4314. Zheng, H., & Wu, J. (2017). Up-and-down routing through nested core-periphery hierarchy in mobile opportunistic social networks. IEEE Transactions on Vehicular Technology, 66(5), 4300–4314.
16.
go back to reference Wang, Y., Wu, J., & Xiao, M. (2014). Hierarchical cooperative caching in mobile opportunistic social networks. In 2014 IEEE Global Communications Conference, Austin, TX, pp. 411–416. Wang, Y., Wu, J., & Xiao, M. (2014). Hierarchical cooperative caching in mobile opportunistic social networks. In 2014 IEEE Global Communications Conference, Austin, TX, pp. 411–416.
17.
go back to reference Saha, B. K., Misra, S., & Pal, S. (2017). SeeR: Simulated annealing-based routing in opportunistic mobile networks. IEEE Transactions on Mobile Computing, 16(10), 2876–2888.CrossRef Saha, B. K., Misra, S., & Pal, S. (2017). SeeR: Simulated annealing-based routing in opportunistic mobile networks. IEEE Transactions on Mobile Computing, 16(10), 2876–2888.CrossRef
18.
go back to reference Saha, B. K., & Misra, S. (2016). Named content searching in opportunistic mobile networks. IEEE Communications Letters, 20(10), 2067–2070.CrossRef Saha, B. K., & Misra, S. (2016). Named content searching in opportunistic mobile networks. IEEE Communications Letters, 20(10), 2067–2070.CrossRef
Metadata
Title
Information cache management and data transmission algorithm in opportunistic social networks
Authors
Jia Wu
Zhigang Chen
Ming Zhao
Publication date
17-02-2018
Publisher
Springer US
Published in
Wireless Networks / Issue 6/2019
Print ISSN: 1022-0038
Electronic ISSN: 1572-8196
DOI
https://doi.org/10.1007/s11276-018-1691-6

Other articles of this Issue 6/2019

Wireless Networks 6/2019 Go to the issue