共查询到20条相似文献,搜索用时 140 毫秒
1.
基于遗传与蚁群算法融合的选播QoS路由算法 总被引:1,自引:0,他引:1
为有效解决选播通信中的QoS路由问题,提出一种基于遗传算法与蚁群算法融合的选播QoS路由算法.算法初期使用遗传算法在链路上分布信息素,对蚁群算法的控制参数进行编码和优化;然后通过判断函数来判断遗传算法与蚁群算法融合的时机,初始化信息素,并启动混合算法后期的蚁群算法;引入变异算子,对由变异操作得出新路径进行局部信息素更新,更快地引导蚁群算法找到全局最优解.NS2仿真实验结果表明,该算法很好的解决多QoS选播路由问题,性能优于其它算法. 相似文献
2.
在解决QoS(quality of service)单播路由问题上,针对蚁群算法缺点,提出了一种融合量子粒子群算法(QP-SO)思想的多行为蚁群算法.该算法采用QPSO作为前期搜索,根据各粒子历史最优值来初始化路径信息素浓度,后期利用多行为蚁群算法来优化路径.仿真结果表明:该算法寻优能力强,可靠性高,是解决QoS路由问题的有效方法. 相似文献
3.
一种基于蚁群系统原理的QoS单播路由算法 总被引:12,自引:0,他引:12
蚁群算法是一种基于蚁群系统原理的、具有自组织能力的、新型的启发式优化算法。为了研究QoS路由问题,本文利用蚁群算法能寻找最短路径这一特性,提出了一种基于蚁群系统原理、用于解决带宽和时延约束问题的QoS单播路由算法。仿真结果表明了该算法的有效性、自适应性、鲁棒性和可扩展性。 相似文献
4.
5.
Ad Hoc网络中基于双向收敛蚁群算法的QoS路由算法 总被引:1,自引:0,他引:1
蚂蚁算法是一种新型随机优化算法,能有效解决Ad Hoc网络多约束的QoS路由问题,但存在收敛速度慢和易陷入局部最优等缺点.针对于此,在借鉴精英策略的基础上提出了一种基于双向收敛蚁群算法,并将该算法应用于Ad Hoc网络的QoS路由问题中.仿真结果表明,算法可明显提高数据包的投递率,降低端到端的传输时延. 相似文献
6.
7.
8.
9.
本文针对多媒体传感器网络中三类基本服务:异常事件告警服务、信息查询服务以及流媒体查询服务,分析了不同服务的QoS需求,并抽象出多媒体传感器网络QoS路由模型.进而,利用改进的蚁群算法,设计了一个基于蚁群优化的服务感知路由算法ASAR (Ant-colony optimization based Service Aware Routing).本文设计服务感知的路由协议,旨在依据各类媒体数据包不同的QoS需求,选择相应的路由以合理利用全网资源、提高网络性能.最后,我们通过NS2仿真表明了较其他路由算法,本文提出的方法能够为多媒体传感器网络的多种服务提供更好的QoS保障,同时,比传统的蚁群算法具有更好的收敛性. 相似文献
10.
11.
Improved ant colony-based multi-constrained QoS energy-saving routing and throughput optimization in wireless Ad-hoc networks简 总被引:3,自引:0,他引:3
In order to establish a route supporting multi-constrained quality of service(QoS), increase network throughput and reduce network energy consumption, an improved ant colony-based multi-constrained QoS energy-saving routing algorithm(IAMQER) is proposed. The ant colony algorithm, as one of the available heuristic algorithms, is used to find the optimal route from source node to destination node. The proposed IAMQER algorithm, which is based on the analysis of local node information such as node queue length, node forwarding number of data packets and node residual energy, balances the relationship between the network throughput and the energy consumption, thus improving the performance of network in multi-constrained QoS routing. Simulation results show that this IAMQER algorithm can find the QoS route that reduce average energy consumption and improves network packet delivery ratio under the end-to-end delay and packet loss ratio constraints. 相似文献
12.
Baoxian Zhang Changjia Chen Hussein T. Mouftah 《International Journal of Communication Systems》2004,17(5):459-478
QoS Routing is crucial for QoS provisioning in high‐speed networks. In general, QoS routing can be classified into two paradigms: source routing and hop‐by‐hop routing. In source routing, the entire path to the destination node of a communication request is locally computed at the source node based on the global state that it maintains, which does not scale well to large networks. In hop‐by‐hop routing, a path‐selecting process is shared among intermediate nodes between the source node and the destination node, which can largely improve the protocol scalability. In this paper, we present the design of hop‐by‐hop routing with backup route information such that each intermediate node can recursively update the best known feasible path, if possible, by collectively utilizing the routing information gathered thus far and the information that it locally stores. Such a route is kept as a backup route and its path cost is used as a reference to guide the subsequent routing process to search for a lower‐cost constrained path and avoid performance degradation. In this way, the information gathered is maximally utilized for improved performance. We prove the correctness of our presented algorithm and deduce its worst message complexity to be O(∣V∣2), where ∣V∣ is the number of network nodes. Simulation results indicate that, however, the designed algorithm requires much fewer messages on average. Therefore it scales well with respect to the network size. Moreover, simulation results demonstrate that the cost performance of our algorithm is near‐optimal. Copyright © 2004 John Wiley & Sons, Ltd. 相似文献
13.
针对多维矢量计算多约束服务质量路由出现实际传输路径与源节点期望路径并非一致问题,研究提出矢量映射方式的多约束服务质量路由计算方法。通过数学方法和物理概念相结合的方式,从原理上阐述了新算法矢量映射的合理性,并通过算例和仿真实验方式验证,新算法只需一次性计算就可以获得源节点到各节点保持路径一致的路由。 相似文献
14.
15.
Yanjing Sun Jianguang Sun Fangfang Zhao Zhuoxian Hu 《International Journal of Communication Systems》2016,29(1):210-225
According to the disadvantages of real time and continuity for multimedia services in ad hoc networks, a delay constraint multipath routing protocol for wireless multimedia ad hoc networks, which can satisfy quality of service (QoS) requirement (QoS multipath optimized link state routing [MOLSR]), is proposed. The protocol firstly detects and analyzes the link delay among the nodes and collects the delay information as the routing metric by HELLO message and topology control message. Then, through using the improved multipath Dijkstra algorithm for path selection, the protocol can gain the minimum delay path from the source node to the other nodes. Finally, when the route is launched, several node‐disjoint or link‐disjoint multipaths will be built through the route computation. The simulation and test results show that QoS‐MOLSR is suitable for large and dense networks with heavy traffic. It can improve the real time and reliability for multimedia transmission in wireless multimedia ad hoc networks. The average end‐to‐end delay of QoS‐MOLSR is four times less than the optimized link state routing. Copyright © 2014 John Wiley & Sons, Ltd. 相似文献
16.
17.
Liang Xue Xinping Guan Zhixin Liu Bo Yang 《International Journal of Communication Systems》2014,27(3):459-481
As considerable progress has been made in wireless sensor networks (WSNs), we can expect that sensor nodes will be applied in industrial applications. Most available techniques for WSNs can be transplanted to industrial wireless sensor networks (IWSNs). However, there are new requirements of quality of service (QoS), that is, real‐time routing, energy efficiency, and transmission reliability, which are three main performance indices of routing design for IWSNs. As one‐hop neighborhood information is often inadequate to data routing in IWSNs, it is difficult to use the conventional routing methods. In the paper, we propose the routing strategy by taking the real‐time routing performance, transmission reliability, and energy efficiency (TREE, triple R and double E) into considerations. For that, each sensor node should improve the capability of search range in the phase of data route discovery. Because of the increase of available information in the enlarged search range, sensor node can select more suitable relay node per hop. The real‐time data routes with lower energy cost and better transmission reliability will be used in our proposed routing guideline. By comparing with other routing methods through extensive experimental results, our distributed routing proposal can guarantee the diversified QoS requirements in industrial applications. Copyright © 2012 John Wiley & Sons, Ltd. 相似文献
18.
19.
20.
描述了多约束QoS组播路由问题的网络模型,提出了一种解决该问题的改进的蚂蚁算法.该算法对网络进行预处理,生成初始解,并转化为网络的初始信息素分布,利用蚂蚁算法的正反馈特性调整信息量的分配,使之迅速收敛到问题的最优解.仿真表明,算法可以稳定地获得优于现有启发式算法的解,是一种有效的组播路由算法. 相似文献