检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:刘军[1] 孙茜[1] 王英梅[2] 叶宁[1] 沙明博[3]
机构地区:[1]东北大学信息科学与工程学院,辽宁沈阳110819 [2]北方交大计算所,北京100029 [3]奥维通信股份有限公司,辽宁沈阳110179
出 处:《通信学报》2013年第5期136-142,共7页Journal on Communications
基 金:国家自然科学基金资助项目(61151002;60939002);中央高校基本科研业务费专项资金资助项目(N110404033)~~
摘 要:对认知无线自组网中有限的带宽进行研究,提出支持网络编码的拓扑控制算法。算法分为3个阶段:初始拓扑构建阶段,利用最短路径算法为单播业务构建拓扑,利用基于网络编码的最短路径算法为多播业务构建K冗余拓扑;拓扑优化阶段,通过逐条删除满足一定条件的链路优化拓扑;拓扑恢复阶段,针对关键点失效,利用与失效链路不在同一路径簇且开销最小的链路恢复网络连通。仿真结果表明,算法能够提高无线资源复用率,增强网络抗毁性。In order to study the limited bandwidth resource in cognitive wireless ad hoc network, a topology control algo- rithm backing for network coding was proposed. The algorithm was mainly composed of three phases. In the stage of ini- tial topology construction, the algorithm used the shortest path algorithm to construct topology for unicast services, used the shortest path algorithm based on network coding to construct topology for multicast services. In the stage of topology optimization, the algorithm deleted links which met certain conditions one by one to optimize the topology. In the stage of topology recovery, the algorithm used the least cost links which were not in the path cluster including failed links to recover network connectivity. Simulation results show that the proposed algorithm can improve the spatial reuse of radio resource and enhance network invulnerability.
关 键 词:认知无线自组网 网络编码 拓扑控制 业务 关键点
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.239