
基于校园机会网络的协作小组缓存调度策略
Cache Scheduling Strategy for Collaborative Group Based on Campus Opportunistic Network
缓存管理已经成为机会网络的研究热点,目前大多数缓存管理方法都集中在单节点,本文在校园协作学习背景下提出了缓存共享的协作小组资源调度方法.节点活跃度描述了移动节点的缓存空间利用率和节点参与消息转发积极性,消息树描述了消息在网络中的扩散程度.以协作小组为单位建立已送达消息链表,对已成功投递消息所占缓存空间及时进行释放.该方法能有效提升节点空间利用率和消息投递率并且降低了消息的投递延迟.实验结果表明,与已有算法相比,消息投递成功率平均提高了10.53%,为小组缓存的共享利用与资源的高效调度提供方法.
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.
协作学习 / 机会网络 / 缓存调度 / 消息树 / 积极度 {{custom_keyword}} /
collaborative learning / opportunistic network / cache scheduling / message tree / activity {{custom_keyword}} /
| |
---|---|
1: | WHILE (消息q存在于节点i && 消息q不存在于节点j) |
2: | IF (消息q的源节点与目的节点不属于同一小组) |
3: | IF (节点j的空闲缓存空间>=转发消息q所需缓存空间) |
4: | j forward q; |
5: | update q.tree; |
6: | END IF; |
7: | IF (节点j的空闲缓存空间<转发消息q所需缓存空间) |
8: | 计算节点j的积极度Aj; |
9: | IF (存在节点k作为节点j的备用缓存节点) |
10: | k forward q; |
11: | END IF; |
12: | IF (无节点可作为节点j的备用缓存节点) |
13: | 计算消息q的效用值 Vq; |
14: | IF (节点j中存在效用值低于消息q的消息) |
15: | 删除效用值低于消息q的消息; |
16: | j forward q; |
17: | update q.tree; |
18: | END IF; |
19: | END IF; |
20: | END IF; |
21: | END IF; |
22: | IF (消息q的源节点、目的节点和节点j属于同一小组) |
23: | IF (节点j的空闲缓存空间>=转发消息q所需缓存空间) |
24: | j forward q; |
25: | update q.tree; |
26: | END IF; |
27: | END IF; |
28: | WHILE (消息q存在于节点i && 消息q存在于节点j) |
29: | update q.tree; |
表1 仿真参数设置 |
参数名称 | 参数值 |
---|---|
数据集 | haggle6-infocom6 |
仿真时长/s | 100000 |
消息大小/KB | 500~5000 |
仿真区域/m2 | 4500*3400 |
等待时长/s | 0~120 |
节点个数/个 | 98 |
节点分组数/个 | 5 |
节点移动速度/(m/s) | 1~10 |
1 |
马学彬, 郑田玉, 李明珠. 机会网络中自私行为影响的分析与调节[J]. 电子学报, 2019, 47(4): 71 - 81.
{{custom_citation.content}}
{{custom_citation.annotation}}
|
2 |
李鹏, 王小明, 张立臣, 等.机会网络视频数据的分块渐进传输新方法[J].电子学报, 2018, 46(9): 2165 - 2172.
{{custom_citation.content}}
{{custom_citation.annotation}}
|
3 |
陈志刚,殷滨安,吴嘉.基于消息重要性的机会网络能量均衡路由算法[J].通信学报, 2018, 39(12): 91 - 101.
{{custom_citation.content}}
{{custom_citation.annotation}}
|
4 |
马学彬,白婧,郑田玉.机会网络中基于有权社团结构图的路由协议研究[J].电子学报, 2016, 44(10): 2449 - 2458.
{{custom_citation.content}}
{{custom_citation.annotation}}
|
5 |
刘春蕊,张书奎,贾俊铖,等.机会网络中基于摆渡节点与簇节点相互协作的路由机制[J].电子学报, 2016, 44(11): 2607 - 2617.
{{custom_citation.content}}
{{custom_citation.annotation}}
|
6 |
舒坚,张学佩,刘琳岚,等.基于深度卷积神经网络的多节点间链路预测方法[J].电子学报, 2018, 46(12): 2970 - 2977.
{{custom_citation.content}}
{{custom_citation.annotation}}
|
7 |
{{custom_citation.content}}
{{custom_citation.annotation}}
|
8 |
{{custom_citation.content}}
{{custom_citation.annotation}}
|
9 |
{{custom_citation.content}}
{{custom_citation.annotation}}
|
10 |
{{custom_citation.content}}
{{custom_citation.annotation}}
|
11 |
{{custom_citation.content}}
{{custom_citation.annotation}}
|
{{custom_ref.label}} |
{{custom_citation.content}}
{{custom_citation.annotation}}
|
/
〈 |
|
〉 |