检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]南昌工程学院信息工程学院,南昌330099 [2]哈尔滨工业大学威海校区,山东威海264209 [3]通信网信息传输与分发技术重点实验室,河北石家庄050081
出 处:《小型微型计算机系统》2015年第6期1249-1254,共6页Journal of Chinese Computer Systems
基 金:国家自然科学基金项目(61401189)资助;南昌工程学院青年基金项目(2014KJ016)资助
摘 要:为提高拓扑可靠性要求下的多接口多信道无线Mesh网络传输容量,首先分析了逻辑拓扑结构与最大可分配信道数量之间的关系,然后定义了任意节点间的拓扑可靠性计算公式,并建立了逻辑拓扑设计优化模型,最后提出拓扑可靠性约束下的逻辑拓扑设计方法.该方法以拓扑可靠性及网络路径跳数为约束条件,以最大容量最小干扰为优化目标,把最短路径与最小生成树算法融入到不相交路径计算的过程中,进而得到优化的逻辑拓扑.通过网络仿真验证及与其它算法的对比分析,在两组可靠性要求下,网络吞吐量及平均端到端时延平均性能分别提升25.4%,25.8%及35.9%,26.1%,验证了该逻辑拓扑设计方法的合理性和有效性.In order to improve transmission capacity of multi-radio multi-channel wireless mesh network with the requirement of the to- pology reliability. In this paper,the relationship between logical topology and the maximum number of assigned channels is analyzed and the calculation formula of topology reliability between any two nodes is defined. Meanwhile ,the design method of logical topology with reliability constraint is proposed. This method takes the maximum capacity and minimum interference as optimization objection and defines topology reliability and hops of network path as the condition of constraints. Through integrating the shortest path algo- rithm and the minimum spanning tree algorithm into the process of calculating disjoint paths, the designed logical topology is obtained. By network simulation and compared with other algorithms,the average network performances of our proposed algorithm,throughput and average end-to-end delay, ascend respectively 25.4% ,25.8% and 35.9% ,26.1% in two group reliability requirement. It demon- strates that the proposed method is reasonable and valid.
关 键 词:无线MESH网络 多接口多信道 可靠性约束 逻辑拓扑设计
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.78