节点状态感知的机会网络分布式协作缓存机制

王汝言; 杨慧娉; 应俊; 舒娜

doi:10.11999/JEIT151374

节点状态感知的机会网络分布式协作缓存机制

doi: 10.11999/JEIT151374

基金项目:

国家自然科学基金(61371097, 61271261)，重庆市自然科学重点基金(CSTC2013JJB40001, CSTC2013JJB40006)，重庆市教委项目(KJ1400402)，重庆市青年科技人才培养计划(CSTC2014KJRC-QNRC40001)

计量
- 文章访问数: 1276
- HTML全文浏览量: 74
- PDF下载量: 433
- 被引次数: 0
出版历程
- 收稿日期: 2015-12-08
- 修回日期: 2016-04-18
- 刊出日期: 2016-09-19

Node Status Aware Distributed Cooperative CachingMechanism for Opportunistic Networks

Funds:

The National Natural Science Foundation of China (61371097, 61271261), Chongqing Natural Science Foundation (CSTC2013JJB40001, CSTC2013JJB40006), Chongqing Education Commission Project (KJ1400402), Youth Talents Training Project of Chongqing Science Technology Commission (CSTC2014KJRC-QNRC40001)

摘要

摘要: 合理利用节点间的协作关系及相邻节点的缓存资源可有效提高机会网络中节点缓存的利用率与消息的投递率。该文提出一种节点状态感知的分布式协作缓存机制，通过感知消息扩散程度动态估计消息的重要程度，确定消息在缓存操作中的优先级。进而根据节点的活跃度及相对粘度获知给定消息与其目标节点的相遇概率，并针对消息源节点的差异设计分区协作缓存方法，同时在本地缓存处于存满状态时动态选取协作节点，实现本地消息到相邻节点的转移，以达到高效利用缓存资源的目的。结果表明，所提出的协作缓存机制能够有效地利用节点有限的缓存资源，并大幅度地改善消息投递率及节点缓存利用率。
- 机会网络 /
- 扩散程度 /
- 相遇概率 /
- 协作节点
Abstract: By reasonably exploiting the collaborative relationships between nodes and the limited cache resources of neighbor nodes, the cache utilization rate and the message delivery probability of opportunistic networks can be effectively improved. A node status aware distributed cooperative cache management mechanism is proposed in the paper, where the importance degree of a given message can be dynamically estimated by perceiving its spreading degree to determine the caching priority. Furthermore, according to the active degree and the relative viscosity, the encounter probability of a given message to its destination node can be obtained for the design of adaptive cooperative cache management strategies for messages in each cache area respectively. When the cache is fully occupied, the collaboration node within the transmission range is dynamically selected, thus the message transferring to the collaboration node and the efficient utilization of caching resources can be ideally achieved. The results show that the proposed caching mechanism can fully exploit the limited cache resources and greatly improve the message delivery rate and the buffer utilization rate.
- Opportunistic networks /
- Spreading degree /
- Encounter probability /
- Collaboration node

HTML全文

参考文献(16)

WU Dapeng, ZHANG Hongpei, WANG Honggang, et al. Quality-of-protection-driven data forwarding for intermittently connected wireless networks[J]. IEEE Wireless Communications, 2015, 22(4): 66-73. doi: 10.1109/MWC. 2015.7224729.

ZHANG Zufan, YI Yinxue, YANG Jing, et al. Energy efficiency based on joint data frame fragmentation and cooperative transmission[J]. China Communications, 2014, 11(10): 96-105. doi: 10.1109/CC.2014.6969798.

CHEN Honglong and LOU Wei. GAR: Group aware cooperative routing protocol for resource-constraint opportunistic networks[J]. Computer Communications, 2014, 48: 20-29. doi: 10.1016/j.comcom.2014.03.022.

GAO Wei, CAO Guohong, IYENGAR A, et al. Cooperative caching for efficient data access in disruption tolerant networks[J]. IEEE Transactions on Mobile Computing, 2014, 13(3): 611-625. doi: 10.1109/TMC.2013.33.

WANG Yunsheng, WU Jie, and XIAO Mingjun. Hierarchical cooperative caching in mobile opportunistic social networks[C]. Global Telecommunications Conference (GLOBECOM 2014), Austin, USA, 2014: 411-416. doi: 10.1109/GLOCOM.2014.7036843.

PAN Hui, CROWCROFT J, and YONEKI E. BUBBLE rap: social-based forwarding in delay-tolerant networks[J]. IEEE Transactions on Mobile Computing, 2011, 10(11): 1576-1589. doi: 10.1109/TMC.2010.246.

吴大鹏, 靳继伟, 吕翊, 等. 节点相似度感知的社会化间断连接无线网络结构检测机制[J]. 电子与信息学报, 2013, 35(1): 141-146. doi: 10.3724/SP.J.1146.2011.01178.

WU Dapeng, JIN Jiwei, L Yi, et al. Similarity aware community detecting method for social intermittently connected mobile network[J]. Journal of Electronics Information Technology, 2013, 35(1): 141-146. doi: 10.3724/ SP.J.1146.2011.01178.

申健, 夏靖波, 付凯, 等. 基于历史相遇概率的容迟容断网络主动拥塞控制算法[J]. 计算机应用, 2014, 34(3): 644-648. doi: 10.11772/j.issn.1001-9081.2014.03.0644.

SHEN Jian, XIA Jingbo, FU Kai, et al. Active congestion control strategy based on historical probability in delay tolerant networks[J]. Journal of Computer Applications, 2014, 34(3): 644-648. doi: 10.11772/j.issn.1001-9081.2014.03.0644.

LI Ze and SHEN Haiying. SEDUM: exploiting social networks in utility-based distributed routing for DTNs[J]. IEEE Transactions on Computers, 2013, 62(1): 83-97. doi: 10.1109/TC.2011.232.

LIU Lei, CUI Zehan, XING Mingjie, et al. A software memory partition approach for eliminating bank-level interference in multicore systems[C]. Proceedings of the 21st International Conference on Parallel Architectures and Compilation Techniques, New York, USA, 2012: 367-376. doi: 10.1145 /2370816.2370869.

LILIEN L T, BEN OTHMANE L, ANGIN P, et al. A simulation study of ad hoc networking of UAVs with opportunistic resource utilization networks[J]. Journal of Network and Computer Applications, 2014, 38: 3-15. doi: 10.1016/j.jnca.2013.05.003.

LIU Yao, WANG Jianxin, ZHANG Shigeng, et al. A buffer management scheme based on message transmission status in delay tolerant networks[C]. Global Telecommunications Conference (GLOBECOM 2011), Houston, USA, 2011: 1-5. doi: 10.1109/GLOCOM.2011.6134084.

吴大鹏, 张普宁, 王汝言. 带有消息投递概率估计的机会网络自适应缓存管理策略[J]. 电子与信息学报, 2014, 36(2): 390-395. doi: 10.3724/SP.J.1146.2012.01677.

WU Dapeng, ZHANG Puning, and WANG Ruyan. Adaptive buffer management strategy with message delivery probability estimating method in opportunistic networks[J]. Journal of Electronics Information Technology, 2014, 36(2): 390-395. doi: 10.3724/SP.J.1146.2012.01677.

施引文献

资源附件(0)

访问统计