无线 Mesh 网络中多路径路由算法的研究

针对无线 Mesh 网络中传统单径路由协议的不足,提出一种基于动态源路由协议(DSR)的多路径路由算法(IDSR).该算法通过在路由发现过程引入带宽和最大转发次数等限制条件,保证了多条路由请求信息的获取;通过在节点不相交的多径选择过程中引入多 QoS 路由代价函数,有效地实现多路径的选择;通过提供多 QoS 保障,使算法具有较高的求解效率,避免了单径路由的不稳定等特点.实验结果表明,IDSR 算法在无线 Mesh 网络的路由中具有更好的 QoS 性能.     

一种改进无线Mesh网络孤岛效应的路由算法研究

针对无线Mesh网络路由协议自身的缺陷而导致的孤岛效应,分析了其形成原因以及对网络的危害,通过对AODV、DSDV、DSR和TORA等典型路由协议的具体分析,提出动态传输距离算法,整理形成了改进的AODV路由协议,仿真结果表明,改进后的协议能够很好地解决Mesh孤岛效应。     

基于改进蚁群优化算法的无线传感器网络路由研究

无线传感器网络能够进行传感器的数据收集和传输,为用户提供多元信息,在不同的领域都具有广阔的应用前景,但无线传感网络的路由研究没有动态的拓扑结构以及全地址机制,并且资源有限,因此需要新的无线传感器路由算法进行支持.本文提出了基于改进蚁群优化算法的无线传感器网络路由算法,将改进的蚁群算法的自组织、动态和多路径等特性结合到无线传感网络路由研究中,用仿真实验进行分析表明该算法在网路平均能耗方面的显著改善,并证明其基本满足无线传感器网络的设计目标.     

基于IEEE 802．11s的无线Mesh网络路由协议研究

基于IEEE802．11s的无线Mesh网络已成为机动宽带接入技术研究领域的一个研究热点。对无线Mesh网络中的关键技术——混合无线Mesh协议（HWMP）进行详细的分析,与传统按需路由机制相比,该协议既具有先验式路由协议的灵活性,亦具备按需路由协议的有效性,同时,对该协议度量机制做出改进,其将在应急通信等特殊应用环境中发挥重要作用。     

多媒体异构Mesh网络体系设计及跨层QoS路由算法研究

 针对无线Mesh网络的异构特性和多媒体业务的QoS要求,研究了一种跨域、跨层、跨节点的无线Mesh网络QoS自适应体系架构.在此基础上,利用双层规划数学模型描述之,并利用改进的蚁群算法来求解该双层规划模型,从而提出了基于双层规划模型的蚁群优化路由算法.仿真结果表明双层规划数学模型充分地考虑并优化了路径的各QoS指标,提出的蚁群优化路由算法能够很好地收敛于双层规划模型的最优解,且具有复杂度低、收敛速度快的特点.     

一种基于跨层的无线Mesh网络路由协议

无线Mesh网络的很多技术特点和优势来自于Mesh多跳路由.因此,路由协议的研究与设计是无线Mesh网络技术的一个重要课题.由于无线Mesh网络有自身负载均衡、路由容错与网络容量等要求,因此运用跨层设计,采用更好的路由参数,使用多径路由等方法已经成为无线Mesh网络路由协议设计的重要思路.根据无线Mesh的网络特点,按照其路由协议的设计要求,分析了路由协议DSR在Mesh网络中的不足,引入跨层设计的方法,提出了采用路由质量路径帧投递率(PFDR)为路由准则,并具有负载平衡、拥塞避免的路由协议CMRP.分析和仿真结果表明,CMRP在保持Mesh网络自身优点的同时,比起DSR在网络性能上有了较大的提升,在吞吐率方面有了很大的提高,相应的时延、抖动参数均有了大幅的下降,更加适用于无线Mesh网络.     

一种改进的蚁群WSN路由算法

针对能量控制和拥塞控制在无线传感器网络路由上的特殊要求,利用蚁群算法(Ant Colony System,ACS)对路由中最短路径加速收敛。为了促使网络节点能量消耗相对均衡,提出一种改进的蚁群路由算法。该算法将多蚁群挥发的信息素与网络节点剩余能量结合成算法控制因子,并且引入了多蚁群竞争机制来避免单一收敛。此算法能有效地控制网络拥塞,并使网络节点能量消耗相对均衡,延长了整个网络的生命周期,实现了高效路由与能量消耗的较优权衡。最后通过Matlab仿真实验验证了该方法的可行性,并给出实验结果。     

无线Mesh网中实时数据业务仿真与分析

无线Mesh网络是一种架构式多跳无线网络,具有结构灵活、快速部署、自组织和自愈合等优点,具有广泛的应用前景。通过采用ns-2仿真软件对基于IEEE 802.11 MAC协议和AODV路由协议的无线Mesh网中实时数据业务的数据传输进行建模与仿真,分析了Mesh网络中数据流经过的传输跳数与吞吐率的关系,以及MAC层RTS/CTS、重传次数以及MAC层和路由层相互作用对无线Mesh网中实时数据业务性能的影响,指出了提高无线Mesh网中实时数据业务性能的所需要的改进方向。     

基于遗传算法和蚁群算法的LEACH改进协议

针对无线传感器网络低功耗自适应集簇分层(Low Energy Adaptive Clustering Hierarchy, LEACH)路由协议因能耗不均衡导致节点过早死亡的问题,提出了一种基于遗传算法和蚁群算法改进的LEACH路由协议。在分簇阶段,通过遗传算法选举合理的簇头节点并根据节点的分布划分簇群;在数据传输阶段,通过蚁群算法使簇头节点尽可能选择能量充足且距离较短的路径进行数据传输。仿真结果表明,与传统的分簇路由协议LEACH和LEACH-C相比,改进算法可以使网络的能量消耗更加均衡,并延长网络的生命周期。     

无线Mesh网络中路由算法的研究

无线Mesh网络(WMN)近年来受到了越来越多的关注,对其路由协议的研究一直是个热点问题。WMN是由移动自组织网络(MANET)发展起来,针对应用在MANET中的DSR、AODV、DSDV、CEDAR等4种路由协议算法,分析并总结它们的优缺点,并对上述4种算法在WMN中应用的可行性进行了分析。     

A Tabu search based routing algorithm for wireless sensor networks

In this paper, a Tabu search based routing algorithm is proposed to efficiently determine an optimal path from a source to a destination in wireless sensor networks (WSNs). There have been several methods proposed for routing algorithms in wireless sensor networks. In this paper, the Tabu search method is exploited for routing in WSNs from a new point of view. In this algorithm (TSRA), a new move and neighborhood search method is designed to integrate energy consumption and hop counts into routing choice. The proposed algorithm is compared with some of the ant colony optimization based routing algorithms, such as traditional ant colony algorithm, ant colony optimization-based location-aware routing for wireless sensor networks, and energy and path aware ant colony algorithm for routing of wireless sensor networks, in term of routing cost, energy consumption and network lifetime. Simulation results, for various random generated networks, demonstrate that the TSRA, obtains more balanced transmission among the node, reduces the energy consumption and cost of the routing, and extends the network lifetime.     

Routing Technology in Wireless Sensor Network Based on Ant Colony Optimization Algorithm

With rapid development of wireless communication, sensor, micro power system and electronic technology, the research on wireless sensor network has attracted more and more attention. The work proposed routing algorithm in wireless sensor network based on ant colony optimization by analyzing routing protocol and utilizing advanced idea. Ant colony optimization algorithm has advantages in implementing local work, supporting multiple paths and integrating link quality into pheromone formation. In routing selection, the work calculated probability that node is selected as the next hop according to pheromone concentration on the path. With characteristics including self-organization, dynamic and multipath, ant colony optimization algorithm is suitable for routing in wireless sensor network. With low routing cost, good adaptability and multipath, the algorithm balanced energy consumption to prolong network lifetime. In terms of simulation and experiments, ant colony algorithm was proved to be suitable for finding optimal routing in wireless sensor network, thus achieving design goal of routing algorithm.     

An ant colony optimization based routing algorithm for extending network lifetime in wireless sensor networks

Reducing the energy consumption of network nodes is one of the most important problems for routing in wireless sensor networks because of the battery limitation in each sensor. This paper presents a new ant colony optimization based routing algorithm that uses special parameters in its competency function for reducing energy consumption of network nodes. In this new proposed algorithm called life time aware routing algorithm for wireless sensor networks (LTAWSN), a new pheromone update operator was designed to integrate energy consumption and hops into routing choice. Finally, with the results of the multiple simulations we were able to show that LTAWSN, in comparison with the previous ant colony based routing algorithm, energy aware ant colony routing algorithms for the routing of wireless sensor networks, ant colony optimization-based location-aware routing algorithm for wireless sensor networks and traditional ant colony algorithm, increase the efficiency of the system, obtains more balanced transmission among the nodes and reduce the energy consumption of the routing and extends the network lifetime.     

A new ant colony-based routing algorithm with unidirectional link in UV mesh communication wireless network

Aiming at the unidirectional links coming from nodes with different transmitting power and the obstacle blocking in UV mesh wireless communication network and the traditional ant colony algorithm only supporting bidirectional links, a new ant colony based routing algorithm with unidirectional link in UV mesh communication wireless network is proposed. The simulation results show that the proposed algorithm can improve the overall network connectivity and the survivability by supporting the combination of unidirectional link and bidirectional link.     

一种基于改进蚁群算法的选播路由算法

为了在网络负载较大的情况下实现多目标多路径的选播路由,该文根据蚂蚁寻径与选播路由的相似性,提出了一种基于改进蚁群算法的选播路由算法。在运用数据包传输的历史信息来模拟路径信息素的基础上,增加了目标地址泛洪负载信息来模拟食物气味散发的过程,使得各个节点可以获得服务器和链路的最新信息。节点根据路径上的信息素、食物的气味以及链路的可见度等综合生成概率表,作为后继蚂蚁路径选择的依据。运用NS-2对该算法进行仿真,测试结果表明它可以减少传输时延,降低服务器负载的波动幅度,实现链路的负载均衡,增加网络的容量,提高选播服务的可扩展性。     

WMN多路径路由算法安全性分析与仿真

高效、安全的路由机制是保证无线网状网络(WMN)正常工作的一个重要因素。对WMN中的多径路由(MPR)算法进行了研究。由于MPR算法存在路由分离性约束,提出了一种基于转移概率的随机路由(SR)算法,并对这两种算法进行了仿真。仿真结果表明:在节点转发次数的标准方差和最高截获率两个性能指标方面,SR算法均优于MPR算法,这说明与MPR算法相比,所提算法进一步增强了WMN网络的路由安全性。     

Cluster‐based mobility management algorithms for wireless mesh networks

Wireless mesh networks (WMNs) have been the recent advancements and attracting more academicians and industrialists for their seamless connectivity to the internet. Radio resource is one among the prime resources in wireless networks, which is expected to use in an efficient way especially when the mobile nodes are on move. However, providing guaranteed quality of service to the mobile nodes in the network is a challenging issue. To accomplish this, we propose 2 clustering algorithms, namely, static clustering algorithm for WMNs and dynamic clustering algorithm for WMNs. In these algorithms, we propose a new weight‐based cluster head and cluster member selection process for the formation of clusters. The weight of the nodes in WMN is computed considering the parameters include the bandwidth of the node, the degree of node connectivity, and node cooperation factor. Further, we also propose enhanced quality of service enabled routing protocol for WMNs considering the delay, bandwidth, hopcount, and expected transmission count are the routing metrics. The performance of the proposed clustering algorithms and routing protocol are analyzed, and results show high throughput, high packet delivery ratio, and low communication cost compared with the existing baseline mobility management algorithms and routing protocols.     

车载自组织网中基于蚁群算法的延迟感知路由协议

针对城市道路环境下车载自组织网( VANETs)中通信性能下降以及数据传输失败的问题,提出了一种基于蚁群算法的延迟感知路由( ACDR)协议。首先,建立双向车道的数学延迟模型;然后,根据提出的端点十字路口( EI)的概念,ACDR利用蚁群优化( ACO)寻找最佳路线,其中前向蚂蚁根据本地路段延迟以及当前十字路口与目的节点的端点十字路口之间的全局时延来选择路径,后向蚂蚁则负责在返回路径时更新信息素,同时,相邻十字路口之间利用贪婪转发算法进行数据包的传递。最后仿真比较了ACDR协议与连通性感知路由( CAR)协议的性能,结果表明提出的ACDR协议的数据包的传输延迟小,丢包率低,通信性能好。     

End-to-end throughput improvement for single radio multi-channel multi-path wireless mesh networks: a cross layer design

The distinguished feature of fixed backbone nodes in the wireless mesh networks (WMNs) can be utilized to design an efficient cross layer which cooperates routing and scheduling schemes for increasing end-to-end throughput. With only single radio nodes, by well designing the scheduling and routing schemes for multiple paths, we show that WMN can gain more throughput and reduce communication interference. Much of recent work has focused on those issues applied for “multi-channel, multi-path” environment using multi-radios that is costly and much more complex for implementation. Also, almost all of the proposals work on layer 2 or layer 3 separately that cannot support each other in performing efficiently. Instead, our paper introduces a cross-layer design with new routing algorithm that can balance the numbers of multi-paths and the needed transmission data in each communication session. We also propose a new channel scheduling and queuing models in MAC layer compatible with routing scheme and define a threshold with an effective algorithm to choose the optimal number of disjoint paths for routing scheme. The simulation results show that our multi-path routing scheme performs better than previous proposals in term of throughput improvement which can directly reduce the time of each communication session, especially in case of big size data transmission.