Cache Scheduling Strategy for Collaborative Group Based on Campus Opportunistic Network

被引：0
|
作者：
Cui Y.-R. [1 ,4 ]
Li P. [1 ,2 ,3 ,4 ]
Liu H. [1 ,4 ]
Wang X.-M. [1 ,2 ,3 ,4 ]
Wu X.-J. [1 ,2 ,3 ,4 ]
机构：
[1] School of Computer Science, Shaanxi Normal University, Xi'an
[2] Key Laboratory of Folk Song Intelligent Computing and Service Technology, Ministry of Culture and Tourism, Xi'an
[3] Key Laboratory of Modern Teaching Technology, Ministry of Education, Xi'an
[4] Engineering Laboratory of Teaching Information Technology of Shaanxi Province, Xi'an
来源：
Tien Tzu Hsueh Pao/Acta Electronica Sinica | 2021年 / 49卷 / 12期
关键词：
Activity; Cache scheduling; Collaborative learning; Message tree; Opportunistic network;
D O I：
10.12263/DZXB.20210420
中图分类号：
学科分类号：
摘要：
Cache management has become a research hotspot in opportunistic networks. At present, most cache management methods are concentrated on single node. In this paper, we propose a cache sharing resource scheduling method for collaborative groups under the background of campus collaborative learning. Node activity describes the cache space utilization of mobile nodes and the enthusiasm of nodes to participate in message forwarding. Message tree describes the degree of message diffusion in the network. A linked list of delivered messages is established based on the collaboration group, and the cache space occupied by the successfully delivered messages is released in time. This method can effectively improve the node space utilization and message delivery rate, and reduce the message delivery delay. The experimental results show that, compared with the existing algorithms, the success rate of message delivery is increased by 10.53% on average, which provides a method for the sharing and utilization of group cache and the efficient scheduling of resources. © 2021, Chinese Institute of Electronics. All right reserved.
引用
收藏
页码：2399 / 2406
页数：7
相关论文
共 11 条
  • [1] Ma X B, Zheng T Y, Li M Z., Analysis and regulation of effects of selfishness on opportunistic network, Acta Electronica Sinica, 47, 4, pp. 71-81, (2019)
  • [2] Li P, Wang X M, Zhang L C, Et al., A novel method of video data fragmentary and progressive transmission in opportunistic network, Acta Electronica Sinica, 46, 9, pp. 2165-2172, (2018)
  • [3] Chen Z G, Yin B A, Wu J., Energy balanced routing algorithm for opportunistic network based on message importance[J], Journal on Communications, 39, 12, pp. 91-101, (2018)
  • [4] Ma X B, Bai J, Zheng T Y., A routing algorithm based on weighted community detection for opportunistic networks, Acta Electronica Sinica, 44, 10, pp. 2449-2458, (2016)
  • [5] Liu C R, Zhang S K, Jia J C, Et al., Routing mechanism based on the cooperation of the ferry nodes and cluster nodes in opportunistic networks, Acta Electronica Sinica, 44, 11, pp. 2607-2617, (2016)
  • [6] Shu J, Zhang X P, Liu L L, Et al., Multi-nodes link prediction method based on deep convolution neural networks, Acta Electronica Sinica, 46, 12, pp. 2970-2977, (2018)
  • [7] Liu Q, Wang Y, Zhuge L, Et al., A game theoretical distributed approach for opportunistic caching strategy, Wireless Networks, 25, 5, pp. 2817-2829, (2019)
  • [8] Yang P, Kang X, Zhang P, Et al., Cooperation willingness aware caching mechanism towards opportunistic network, 2018 IEEE International Conference on Communication Systems (ICCS), pp. 473-477, (2018)
  • [9] Goudar G, Batabyal S., Optimizing bulk transfer size and scheduling for efficient buffer management in mobile opportunistic networks, IEEE Transactions on Mobile Computing, (2021)
  • [10] Yu G, Chen Z G, Wu J, Et al., Quantitative social relations based on trust routing algorithm in opportunistic social network[J], EURASIP Journal on Wireless Communications and Networking, 2019, 1, pp. 1-18, (2019)
12