移动机会网络中接触时间感知的协作缓存策略-计算机研究与发展.pdfVIP

计 算 机 研 究 与 发 展 DOI:10.7544/issn1000-1239.2016.******** Journal of Computer Research and Development 卷(期):起止页,年 移动机会网络中接触时间感知的协作缓存策略 郑啸 高汉 王修君 秦锋 （安徽工业大学计算机科学与技术学院安徽马鞍山 243002 ） 1 （xzheng@ ） Contact Duration Aware Cooperative Data Caching in Mobile Opportunistic Networks Zheng Xiao, Gao Han, Wang Xiujun, and Qin Feng （School of Computer Science and Technology, Anhui Univers ity of Technology, Maanshan , Anhui 243002 ） Abstract How to improve the efficiency of data access is always a hot topic in the research area of mobile opportunistic networks. Traditional cooperative caching techniques are commonly used to improve the performance of data access. However, the strongly independent mobility and limited contact duration of the mobile nodes render these traditional caching schemes inefficient. Firstly, a new metric, called as node important degree, is proposed to determine which node is more important to cooperative data caching. Based on this metric, a greedy algorithm is used to select initial cache nodes, and subsequently the cache data will be redistributed among these cache nodes actively as they meet each other. A novel data fragmenting strategy is suggested to adapt to the limited contact duration between nodes with the aim to make our protocol suitable for short-duration contact between cache nodes. In order to solve the coupon collector’s problem in data recovery, a randomly linear network coding method is used to encode the data fragmentations. Moreover, we describe an adaptive caching bound calculation method for each mobile node to limit the amount of data it caches, which is helpful to the rational utilization of cache space. Experimental results show that our suggested cooperat