检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:华翔[1,2] 李宝华 姚红娟 王昭 左嘉娴 Hua Xiang;Li Baohua;Yao Hongjuan;Wang Zhao;Zuo Jiaxian(College of Electronic Information Engineering,Xi'an Technological University,Xi'an 710021,China;Northwest Institutes of Advanced Technology,Xi'an Technological University,Xi'an 710021,China)
机构地区:[1]西安工业大学电子信息工程学院,陕西西安710021 [2]西安工业大学西北兵器工业研究院,陕西西安710021
出 处:《系统仿真学报》2021年第7期1514-1525,共12页Journal of System Simulation
基 金:陕西省2020年重点研发计划(2020GY-073)。
摘 要:集群通信网络具有拓扑时变,节点移动性强,链路状态不稳定等特点,难以维持稳定的拓扑结构。网络被分割为互不连通的子群体,为了解决不同群体间的通信问题,将协同中继节点引入,提出一种动态感知的连通恢复方法。搭建协同通信模型,推导出链路质量指标的数学表达;设计多目标链路评价函数,通过多目标连通恢复算法实现最优的中继位置规划。仿真结果表明:在不同信道环境下,该算法能够在2个非连通群体间获得最优中继位置,恢复网络连通。The cluster communication network has the characteristics of time-varying topology, strong node mobility, and unstable link status, etc. It is difficult to maintain a stable topology. The network is divided into disconnected subgroups. In order to solve the communication problem between different groups, the cooperative relay node is introduced and a dynamic-sensing connection recovery method is proposed. A cooperative communication model is built and the mathematical expression of link quality indicators is deduced, which designs a multi-objective link evaluation function and achieves the optimal relay location planning through a multi-objective connectivity recovery algorithm. Simulation results show that the proposed algorithm can obtain optimal relay position between two disconnected groups and restore the network connectivity under different channel environments.
分 类 号:TP393.1[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.7