检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:崔苑茹 李鹏[1,2,3,4] 刘宏 王小明[1,2,3,4] 吴晓军 CUI Yuan-ru;LI Peng;LIU Hong;WANG Xiao-ming;WU Xiao-jun(School of Computer Science,Shaanxi Normal University,Xi’an,Shaanxi 710119,China;Key Laboratory of Folk Song Intelligent Computing and Service Technology,Ministry of Culture and Tourism,Xi’an,Shaanxi 710062,China;Key Laboratory of Modern Teaching Technology,Ministry of Education,Xi’an,Shaanxi 710062,China;Engineering Laboratory of Teaching Information Technology of Shaanxi Province,Xi’an,Shaanxi 710119,China)
机构地区:[1]陕西师范大学计算机科学学院,陕西西安710119 [2]民歌智能计算与服务技术文化和旅游部重点实验室,陕西西安710062 [3]现代教学技术教育部重点实验室,陕西西安710062 [4]陕西省教学信息技术工程实验室,陕西西安710119
出 处:《电子学报》2021年第12期2399-2406,共8页Acta Electronica Sinica
基 金:国家自然科学基金(No.61877037,No.61872228,No.61977044,No.62077035);陕西省重点研发计划项目(No.2020GY-221,No.2019ZDLSF07-01,No.2020ZDLGY10-05);陕西省自然科学基础研究计划项目(No.2020JM-303,No.2020JM-302);西安市科技计划项目(No.2019216914GXRC005CG006-GXYD5.1);中央高校基本科研业务费专项资金项目(No.GK201903090,No.GK201801004,);教育部陕西师范大学基础教育课程研究中心项目No(.2019-JCJY009);教育部高等教育司新工科研究与实践项目(No.E-RGZN20201045)。
摘 要:缓存管理已经成为机会网络的研究热点,目前大多数缓存管理方法都集中在单节点,本文在校园协作学习背景下提出了缓存共享的协作小组资源调度方法.节点活跃度描述了移动节点的缓存空间利用率和节点参与消息转发积极性,消息树描述了消息在网络中的扩散程度.以协作小组为单位建立已送达消息链表,对已成功投递消息所占缓存空间及时进行释放.该方法能有效提升节点空间利用率和消息投递率并且降低了消息的投递延迟.实验结果表明,与已有算法相比,消息投递成功率平均提高了10.53%,为小组缓存的共享利用与资源的高效调度提供方法.Cache management has become a research hotspot in opportunistic networks.At present,most cache man⁃agement 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 effective⁃ly 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.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222