为了支持无线Mesh网络(Wireless Mesh Network,WMN)中多媒体实时应用,必须提供更好的服务质量(Quality of Service,Qo S).为此,提出一种基于差异度蚁群的WM N多约束Qo S路由算法(Improved ACO Routing Algorithm Based on M ulti-Constr...为了支持无线Mesh网络(Wireless Mesh Network,WMN)中多媒体实时应用,必须提供更好的服务质量(Quality of Service,Qo S).为此,提出一种基于差异度蚁群的WM N多约束Qo S路由算法(Improved ACO Routing Algorithm Based on M ulti-Constrained Qo S for Wireless M esh Netw ork,IARQM),该算法利用归一化后的路径Qo S信息和路径差异度调节信息素增量,并用其替代目标函数,在发挥最优路径激励作用的同时提高了算法效率.IARQM根据节点类型对下一跳节点选择进行调整,能充分适应WMN特点,并在链路失效后利用邻居管理提供恢复容错机制,具有很强的健壮性.实验结果表明,与ARMAN、QSS路由算法和AODV路由协议相比,IARQM能更好地支持WM N多约束Qo S路由,并有效提升网络性能.展开更多
保证服务质量的Q_0S路由(Quality of service Routing)是网络中解决Q_0S问题的一项关键技术。本文讨论了Q_0S路由中的基本问题。度量参数选择问题、寻路问题是Q_0S路由中的几个主要研究内容。本文围绕这两个方面,介绍了Q_0S路由中的主...保证服务质量的Q_0S路由(Quality of service Routing)是网络中解决Q_0S问题的一项关键技术。本文讨论了Q_0S路由中的基本问题。度量参数选择问题、寻路问题是Q_0S路由中的几个主要研究内容。本文围绕这两个方面,介绍了Q_0S路由中的主要问题及相关的解决办法。展开更多
为了解决无线传感器网络Qo S(Quality of Service,Qo S)路由在寻找最优路径时要满足时延、抖动、能量等多个约束条件的问题,提出一种新的自适应蚁群优化算法,该算法有两方面的自适应策略。将信息素挥发因子ρ设置为动态自适应,在自适应...为了解决无线传感器网络Qo S(Quality of Service,Qo S)路由在寻找最优路径时要满足时延、抖动、能量等多个约束条件的问题,提出一种新的自适应蚁群优化算法,该算法有两方面的自适应策略。将信息素挥发因子ρ设置为动态自适应,在自适应因子μ作用下动态变化,增强算法的寻优能力,避免算法陷入局部最优;以多约束为条件建立加权的适应度函数,通过适应度函数值与自适应因子μ共同影响路径上的信息素更新,增强算法的收敛速度。通过仿真实验表明,该算法在满足多约束条件方面具有良好的效果。展开更多
To meet the bandwidth requirement for the multicasting data flow in ad hoc networks, a distributed on- demand bandwidth-constrained multicast routing （BCMR） protocol for wireless ad hoc networks is proposed. With th...To meet the bandwidth requirement for the multicasting data flow in ad hoc networks, a distributed on- demand bandwidth-constrained multicast routing （BCMR） protocol for wireless ad hoc networks is proposed. With this protocol, the resource reservation table of each node will record the bandwidth requirements of data flows, which access itself, its neighbor nodes and hidden nodes, and every node calculates the remaining available bandwidth by deducting the bandwidth reserved in the resource reservation table from the total available bandwidth of the node. Moreover, the BCMR searches in a distributed manner for the paths with the shortest delay conditioned by the bandwidth constraint. Simulation results demonstrate the good performance of BCMR in terms of packet delivery reliability and the delay. BCMR can meet the requirements of real time communication and can be used in the multicast applications with low mobility in wireless ad hoc networks.展开更多
文摘为了支持无线Mesh网络(Wireless Mesh Network,WMN)中多媒体实时应用,必须提供更好的服务质量(Quality of Service,Qo S).为此,提出一种基于差异度蚁群的WM N多约束Qo S路由算法(Improved ACO Routing Algorithm Based on M ulti-Constrained Qo S for Wireless M esh Netw ork,IARQM),该算法利用归一化后的路径Qo S信息和路径差异度调节信息素增量,并用其替代目标函数,在发挥最优路径激励作用的同时提高了算法效率.IARQM根据节点类型对下一跳节点选择进行调整,能充分适应WMN特点,并在链路失效后利用邻居管理提供恢复容错机制,具有很强的健壮性.实验结果表明,与ARMAN、QSS路由算法和AODV路由协议相比,IARQM能更好地支持WM N多约束Qo S路由,并有效提升网络性能.
文摘为了解决无线传感器网络Qo S(Quality of Service,Qo S)路由在寻找最优路径时要满足时延、抖动、能量等多个约束条件的问题,提出一种新的自适应蚁群优化算法,该算法有两方面的自适应策略。将信息素挥发因子ρ设置为动态自适应,在自适应因子μ作用下动态变化,增强算法的寻优能力,避免算法陷入局部最优;以多约束为条件建立加权的适应度函数,通过适应度函数值与自适应因子μ共同影响路径上的信息素更新,增强算法的收敛速度。通过仿真实验表明,该算法在满足多约束条件方面具有良好的效果。
基金The Natural Science Foundation of Zhejiang Province(No.Y1090232)
文摘To meet the bandwidth requirement for the multicasting data flow in ad hoc networks, a distributed on- demand bandwidth-constrained multicast routing （BCMR） protocol for wireless ad hoc networks is proposed. With this protocol, the resource reservation table of each node will record the bandwidth requirements of data flows, which access itself, its neighbor nodes and hidden nodes, and every node calculates the remaining available bandwidth by deducting the bandwidth reserved in the resource reservation table from the total available bandwidth of the node. Moreover, the BCMR searches in a distributed manner for the paths with the shortest delay conditioned by the bandwidth constraint. Simulation results demonstrate the good performance of BCMR in terms of packet delivery reliability and the delay. BCMR can meet the requirements of real time communication and can be used in the multicast applications with low mobility in wireless ad hoc networks.
