期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Learning-Based Dynamic Connectivity Maintenance for UAV-Assisted D2D Multicast Communication 被引量:2
1
作者 Jingjing Wang Yanjing Sun +3 位作者 Bowen Wang Shenshen Qian Zhijian Tian Xiaolin Wang 《China Communications》 SCIE CSCD 2023年第10期305-322,共18页
Unmanned aerial vehicles(UAVs) enable flexible networking functions in emergency scenarios.However,due to the movement characteristic of ground users(GUs),it is challenging to capture the interactions among GUs.Thus,w... Unmanned aerial vehicles(UAVs) enable flexible networking functions in emergency scenarios.However,due to the movement characteristic of ground users(GUs),it is challenging to capture the interactions among GUs.Thus,we propose a learningbased dynamic connectivity maintenance architecture to reduce the delay for the UAV-assisted device-todevice(D2D) multicast communication.In this paper,each UAV transmits information to a selected GU,and then other GUs receive the information in a multi-hop manner.To minimize the total delay while ensuring that all GUs receive the information,we decouple it into three subproblems according to the time division on the topology:For the cluster-head selection,we adopt the Whale Optimization Algorithm(WOA) to imitate the hunting behavior of whales by abstracting the UAVs and cluster-heads into whales and preys,respectively;For the D2D multi-hop link establishment,we make the best of social relationships between GUs,and propose a node mapping algorithm based on the balanced spanning tree(BST) with reconfiguration to minimize the number of hops;For the dynamic connectivity maintenance,Restricted Q-learning(RQL) is utilized to learn the optimal multicast timeslot.Finally,the simulation results show that our proposed algorithms perfor better than other benchmark algorithms in the dynamic scenario. 展开更多
关键词 cluster-head selection whale optimization algorithm(WOA) balanced spanning tree(bst) multi-hop link establishment dynamic connectivity maintenance
在线阅读 下载PDF
基于二叉排序树的最佳适应算法
2
作者 王安华 黎波 《宜宾学院学报》 2013年第12期77-80,共4页
当前操作系统在管理内存时,常采用最佳适应算法对空闲内存块进行分配,但该算法存在效率不高、时空消耗大的缺点,对此提出基于二叉排序树的最佳适应算法,改变原有的最佳适应算法中把所有空闲分区按容量大小顺序连接成空闲分区链的特点,... 当前操作系统在管理内存时,常采用最佳适应算法对空闲内存块进行分配,但该算法存在效率不高、时空消耗大的缺点,对此提出基于二叉排序树的最佳适应算法,改变原有的最佳适应算法中把所有空闲分区按容量大小顺序连接成空闲分区链的特点,而把所有空闲分区组建成一颗二叉排序树,进程发出请求时,根据二叉排序树的性质依次查找满足条件的空闲分区,并在分配后重组二叉排序树,保证二叉排序树的结构不被破坏,改善现有的最佳适应算法在查找过程中的效率问题. 展开更多
关键词 二叉排序树 最佳适应算法 内存空闲块
在线阅读 下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部