检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]苏州大学电子信息学院,江苏苏州215021 [2]江苏理工学院电气信息工程学院,江苏常州213000
出 处:《通信学报》2016年第5期106-114,共9页Journal on Communications
基 金:国家自然科学基金资助项目(No.61172056;No.61201215;No.61201213)~~
摘 要:针对认知网络研究一种融合主、次用户多因素优化的局部拓扑控制和路由方法。该方法综合考虑主用户频谱使用情况以及次用户对主用户干扰影响,预测认知链路的稳定性,结合链路功耗,定义一种联合链路代价,提出链路代价最小的局部认知拓扑控制路由(LCTCR)算法,优化网络拓扑,并在优化后的拓扑上进行网络路由的选择。算法分析和仿真实验证明,在进行认知网络路径选择时,链路功耗和链路稳定性均为重要参数,需联合优化以保证选择更优的实际路由。An approach of topology control and routing was proposed according to the characteristics of cognitive radio networks, which considered multi factors optimization with fusion of primary users and secondary users. And the approach took the spectrum utilization of primary users and the interference from secondary users to primary users into account. Then a joint link cost was defined combining the predicted cognitive link stability with the link power consumption. Furthermore, the local cognitive topology control routing(LCTCR) algorithm with minimizing the link cost was presented, which was used to optimize the network topology. Meanwhile, the network path was selected according to the optimized network topology. Theoretical analysis and simulation experiments show that the link power consumption and the link stability are also important parameters and need to be jointly optimized when selecting the network path. Only by doing so can it guarantee that the selected path is optimal.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222