節(jié)點(diǎn)狀態(tài)感知的機(jī)會網(wǎng)絡(luò)分布式協(xié)作緩存機(jī)制
doi: 10.11999/JEIT151374 cstr: 32379.14.JEIT151374
基金項(xiàng)目:
國家自然科學(xué)基金(61371097, 61271261)，重慶市自然科學(xué)重點(diǎn)基金(CSTC2013JJB40001, CSTC2013JJB40006)，重慶市教委項(xiàng)目(KJ1400402)，重慶市青年科技人才培養(yǎng)計(jì)劃(CSTC2014KJRC-QNRC40001)
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)
-
摘要: 合理利用節(jié)點(diǎn)間的協(xié)作關(guān)系及相鄰節(jié)點(diǎn)的緩存資源可有效提高機(jī)會網(wǎng)絡(luò)中節(jié)點(diǎn)緩存的利用率與消息的投遞率。該文提出一種節(jié)點(diǎn)狀態(tài)感知的分布式協(xié)作緩存機(jī)制，通過感知消息擴(kuò)散程度動態(tài)估計(jì)消息的重要程度，確定消息在緩存操作中的優(yōu)先級。進(jìn)而根據(jù)節(jié)點(diǎn)的活躍度及相對粘度獲知給定消息與其目標(biāo)節(jié)點(diǎn)的相遇概率，并針對消息源節(jié)點(diǎn)的差異設(shè)計(jì)分區(qū)協(xié)作緩存方法，同時(shí)在本地緩存處于存滿狀態(tài)時(shí)動態(tài)選取協(xié)作節(jié)點(diǎn)，實(shí)現(xiàn)本地消息到相鄰節(jié)點(diǎn)的轉(zhuǎn)移，以達(dá)到高效利用緩存資源的目的。結(jié)果表明，所提出的協(xié)作緩存機(jī)制能夠有效地利用節(jié)點(diǎn)有限的緩存資源，并大幅度地改善消息投遞率及節(jié)點(diǎn)緩存利用率。
-
關(guān)鍵詞:
- 機(jī)會網(wǎng)絡(luò) /
- 擴(kuò)散程度 /
- 相遇概率 /
- 協(xié)作節(jié)點(diǎn)
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.-
Key words:
- Opportunistic networks /
- Spreading degree /
- Encounter probability /
- Collaboration node
-
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. 吳大鵬, 靳繼偉, 呂翊, 等. 節(jié)點(diǎn)相似度感知的社會化間斷連接無線網(wǎng)絡(luò)結(jié)構(gòu)檢測機(jī)制[J]. 電子與信息學(xué)報(bào), 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. 申健, 夏靖波, 付凱, 等. 基于歷史相遇概率的容遲容斷網(wǎng)絡(luò)主動擁塞控制算法[J]. 計(jì)算機(jī)應(yīng)用, 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ì)的機(jī)會網(wǎng)絡(luò)自適應(yīng)緩存管理策略[J]. 電子與信息學(xué)報(bào), 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. -
計(jì)量
- 文章訪問數(shù): 1384
- HTML全文瀏覽量: 89
- PDF下載量: 439
- 被引次數(shù): 0
下載:
