检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:孙养龙 唐余亮[2] 张建鑫 SUN Yanglong;TANG Yuliang;ZHANG Jianxin(School of Navigation Institute,Xiamen University,Xiamen 361005,China;School of Informatics,Xiamen University,Xiamen 361005,China)
机构地区:[1]集美大学航海学院,福建厦门361021 [2]厦门大学信息学院,福建厦门361005
出 处:《移动通信》2022年第11期34-46,共13页Mobile Communications
基 金:国家自然科学基金(61731012,61801409)。
摘 要:针对车联网中海量内容即时交付的需求,研究了车辆协作的无线缓存架构,设计动态内容推送机制,解决高效缓存更新问题;综合车辆分布、内容流行度和文件时效性等要素定义缓存效能,引入非正交多址接入技术实现单时隙多文件推送;以最大化缓存命中率为目标,建立车辆和文件的协同优化问题,提出基于动态规划的交替迭代算法降低求解复杂度。仿真结果表明,所提方案相比传统方案至少降低16.8%的时延。To meet the demand for instant delivery of massive content in Internet of Vehicles(IoV),a wireless cache architecture for vehicle collaboration is investigated,and a dynamic content push mechanism is designed to efficiently solve the cache update problem.Specifically,we define cache efficiency by comprehensively considering such factors as vehicle distribution,content popularity,and file timeliness,and introduce the non-orthogonal multiple access technique to achieve multiple file push at a single slot.In addition,the collaborative optimization problem of vehicles and files is formulated to maximize the cache hit rate,and a lowcomplexity alternative iterative algorithm based on dynamic programming is proposed.The simulation results show that the proposed scheme reduces the delay by at least 16.8%compared with the traditional scheme.
分 类 号:TN925.1[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.62