基于多准则的无线网状网路由判据

通过对无线网状网几种现有路由判据的分析比较,提出了一种基于多准则的路由判据LB-WCETT,它综合考虑了链路质量、信道多样性以及信道负载等因素。仿真结果表明,该判据能使无线网状网性能得到较大的提高。     

多信道无线Mesh网络负载均衡路由算法研究

针对无线网状网的网络容量问题,在多信道无线网状网模型的基础上,利用线性规划公式对无线网状网的路由问题进行描述,在此基础上提出了一个负载均衡的路由算法,在对业务请求的路由跳步数进行约束的前提上,通过减少网络链路上的负载,达到提高网络的吞吐量的目的。仿真结果表明,提出的算法能显著提高网络性能。     

多信道无线网状网自适应路由算法

针对无线网状网的网络容量优化问题,通过建立无线网状网容量优化的数学模型,利用线性规划公式对无线网状网的路由问题进行描述,在此基础上提出了一个自适应路由算法。根据网络的拓扑结构和业务请求特点,自适应地改变路由扩张因子和负载均衡率进行优化路由,达到提高无线网状网的网络容量的目的。仿真结果表明,该算法能明显提高网络容量。     

基于综合判据的无线Mesh网路由协议

为用户提供高质量、高性能的通信链路是无线Mesh网路由协议所面临的重要挑战,而当前从Ad Hoc网络沿袭下来的路由协议并不能够满足无线Mesh网的性能要求.文中以OLSR协议为原型,结合跨层优化理论,为基础设施架构的无线Mesh网提出了一种新颖的、基于综合判据的路由协议.该协议通过跨层操作机制综合考虑无线链接的长度及通信效率对链接性能的影响,从而达到优化路由选择的效果.仿真结果表明,所提出的路由协议能够有效地提高网络中分组的递交率,降低端到端的延时,并且能够在一定程度上达到负载均衡的路由效果.     

基于链路状态感知的无线Mesh网优化路由协议

在分析无线Mesh网路由协议所面临的挑战的基础上,结合无线Mesh网络的性能要求,以OLSR协议为原 型,采用跨层设计理论,提出了一种基于链路状态良好程度的路由协议工R-)工SR。该协议引入了认知无线网络中的 环境感知推理思想,通过对节点负载、链路投递率和链路可用性等信息进行感知,并以此为依据对链路质量进行推理, 将其作为路由选择的依据,实现对路由的优化选择,提高网络的吞吐量,达到负载均衡。仿真结果表明,工R-OI_SR能 够在很大程度上提高网络中分组的递交率,降低平均端到端时延,在一定程度上达到负载均衡。     

骨干无线网状网的排队延迟性能研究

对一种基于网状分布的骨干无线网状网的延迟性能进行研究.提出了一种基于均衡负载的最短路径路由协议.在此协议基础上,研究了无线网状网数据包的排队延迟,推导出无线网状网排队延迟与网络的规模、网关和网状路由器的服务能力、数据包到达率的相互关系.此外,还分析排队延迟和网络容量的相互制约关系,并给出了在延迟限制条件下的网络容量.     

无线网状网路由协议的研究与对比

路由协议是网络一个很重要的课题,对无线网状网来说,由于无线网状网的复杂性,无线网状网路由协议的设计比有线网络的路由协议设计更加困难,因此,对无线网状网路由协议进行研究、改进十分必要。主要介绍无线网状网典型的路由协议,通过仿真实验比较它们的性能并展望路由协议发展的方向。     

基于链路状态认知的无线Mesh网路由协议

在分析无线Mesh网路由协议所面临挑战的基础上,结合无线Mesh网络的性能要求,以优化链路状态路由(OLSR)协议为原型,采用跨层设计理论,提出了一种基于链路状态良好程度的路由协议LR-OLSR。该协议引入了认知无线网络中的环境感知推理思想,通过对节点负载、链路投递率和链路可用性等信息进行感知,并以此为依据对链路质量进行推理,获得网络中源节点和目的节点对之间各路径状态良好程度的评价,将其作为路由选择的依据,实现对路由的优化选择,提高网络的吞吐量,达到负载均衡。通过与OLSR及其典型改进协议P-OLSR、SC-OLSR的对比仿真结果表明,LR-OLSR能够提高网络中分组的递交率,降低平均端到端时延,在一定程度上达到负载均衡。     

改进的WPAN mesh路由协议

为实现网状（mesh）网在无线个人区域网（WPAN）中的应用,设计了一种基于WPAN mesh网络的二层路由协议算法。该算法引入“次优路由”和“二层路由”路由优化策略,进一步给出报文格式、路由协议模型及其模拟实现,并对协议进行性能分析比较。实验结果表明,该算法有效减小了路由的端到端跳数,较好地提高了报文发送比率和端到端通信效率。     

移动自组网多安全等级路由策略的分析与仿真

移动自组网(MANET)因其灵活的组网方式在军事和传感器网络领域得到广泛的应用,但是由于MANET的固有特征,网络节点之间的通信通过无线传输来完成,节点的发射功率、能量以及通信信道均受到限制,使得MANET信息传输的可靠性和安全性难以得到很好的保障.为提高网络通信的稳定性,利用移动自组网路由协议的基础上,针对网络通信可靠性的具体要求,分析了路由策略需要考虑的多种因素,提出基于跨层设计的移动自组网多安全等级路由策略.仿真结果表明,路由策略保证了网络通信可靠性,并比传统单一条件的路由选择策略更合理地利用网络资源,平衡流量负载,减少网络传输延迟,延长网络使用寿命,提高转发效率.     

A mobility management scheme for wireless mesh networks based on a hybrid routing protocol

Recent advances in wireless mesh networks (WMNs) have overcome the drawbacks of traditional wired networks and wireless ad hoc networks. WMNs will play a leading role in the next generation of networks, and the question of how to provide seamless mobility management for WMNs is the driving force behind the research. The inherent characteristics of WMNs, such as relatively static backbones and highly mobile clients, require new mobility management solutions to be designed and implemented.In this paper, a hybrid routing protocol for forwarding packets is proposed: this involves both link layer routing and network layer routing. Based on the hybrid routing protocol, a mobility management scheme for WMNs is presented. Both intra-domain and inter-domain mobility management have been designed to support seamless roaming in WiFi-based WMNs. During intra-domain handoff, gratuitous ARP messages are used to provide new routing information, thus avoiding re-routing and location update. For inter-domain handoff, redundant tunnels are removed in order to minimize forwarding latency. Comprehensive simulation results illustrate that our scheme has low packet latency, low packet loss ratio and short handoff latency. As a result, real-time applications over 802.11 WMNs such as VoIP can be supported.     

Performance evaluation for on-demand routing protocols based on OPNET modules in wireless mesh networks

In wireless networks, users expect to get access to the network securely and seamlessly to share the data flow of access points anytime and anywhere. However, either point-to-point or point-to-multipoint methods in traditional wireless networks make the network bandwidth decrease rapidly, which cannot meet the requirements of users. Recently, a new wireless broadband access network, wireless mesh networks (WMNs), has emerged. As one of the key technologies in WMNs, wireless routing protocols plays an important role in performance optimization of WMNs. Therefore, in this paper, we address the on-demand routing protocols by focusing on dynamic source routing (DSR) protocol and ad hoc on-demand distance vector (AODV) routing protocol in WMNs. Then, we use the OPNET modules to establish the simulation models of DSR and AODV protocols in WMNs. Simulation and results show that, DSR protocol that is based on the dynamic source routing is not suitable for wireless transmission, while AODV routing protocol that is based on the purpose-driven routing is suitable for wireless transmission with rapid change of network topology.     

无线网状网的QoS研究

作为下一代无线通信网络的关键技术,无线网状网能够融合异构网络,满足多类型的业务需求,因此必须提供一定的服务质量(QoS)保证.对目前各种QoS体系结构进行了分析,讨论了无线网状网的QoS体系结构.针对无线网状网网络层以下各层的QoS问题,对近年来国内外在功率控制、无线环境感知、支持QoS的MAC协议、QoS路由以及跨层QoS设计等方向所取得的研究成果进行了全面的概括总结和比较分析.最后对未来的研究发展趋势提出了自己的观点.     

Routing protocols in wireless mesh networks: challenges and design considerations

Wireless Mesh Networks (WMNs) are an emerging technology that could revolutionize the way wireless network access is provided. The interconnection of access points using wireless links exhibits great potential in addressing the “last mile” connectivity issue. To realize this vision, it is imperative to provide efficient resource management. Resource management encompasses a number of different issues, including routing. Although a profusion of routing mechanisms has been proposed for other wireless networks, the unique characteristics of WMNs (e.g., wireless backbone) suggest that WMNs demand a specific solution. To have a clear and precise focus on future research in WMN routing, the characteristics of WMNs that have a strong impact on routing must be identified. Then a set of criteria is defined against which the existing routing protocols from ad hoc, sensor, and WMNs can be evaluated and performance metrics identified. This will serve as the basis for deriving the key design features for routing in wireless mesh networks. Thus, this paper will help to guide and refocus future works in this area.

OLSR-aware channel access scheduling in wireless mesh networks

Wireless mesh networks (WMNs) have emerged as a key technology having various advantages, especially in providing cost-effective coverage and connectivity solutions in both rural and urban areas. WMNs are typically deployed as backbone networks, usually employing spatial TDMA (STDMA)-based access schemes which are suitable for the high traffic demands of WMNs. This paper aims to achieve higher utilization of the network capacity and thereby aims to increase the application layer throughput of STDMA-based WMNs. The central idea is to use optimized link state routing (OLSR)-specific routing layer information in link layer channel access schedule formation. This paper proposes two STDMA-based channel access scheduling schemes (one distributed, one centralized) that exploit OLSR-specific information to improve the application layer throughput without introducing any additional messaging overhead. To justify the contribution of using OLSR-specific information to the throughput, the proposed schemes are compared against one another and against their non-OLSR-aware versions via extensive ns-2 simulations. Our simulation results verify that utilizing OLSR-specific information significantly improves the overall network performance both in distributed and in centralized schemes. The simulation results further show that OLSR-aware scheduling algorithms attain higher end-to-end throughput although their non-OLSR-aware counterparts achieve higher concurrency in slot allocations.     

SafeMesh: A wireless mesh network routing protocol for incident area communications

Reliable broadband communication is becoming increasingly important during disaster recovery and emergency response operations. In situations where infrastructure-based communication is not available or has been disrupted, an Incident Area Network needs to be dynamically deployed, i.e. a temporary network that provides communication services for efficient crisis management at an incident site. Wireless Mesh Networks (WMNs) are multi-hop wireless networks with self-healing and self-configuring capabilities. These features, combined with the ability to provide wireless broadband connectivity at a comparably low cost, make WMNs a promising technology for incident management communications. This paper specifically focuses on hybrid WMNs, which allow both mobile client devices as well as dedicated infrastructure nodes to form the network and provide routing and forwarding functionality. Hybrid WMNs are the most generic and most flexible type of mesh networks and are ideally suited to meet the requirements of incident area communications. However, current wireless mesh and ad-hoc routing protocols do not perform well in hybrid WMN, and are not able to establish stable and high throughput communication paths. One of the key reasons for this is their inability to exploit the typical high degree of heterogeneity in hybrid WMNs. SafeMesh, the routing protocol presented in this paper, addresses the limitations of current mesh and ad-hoc routing protocols in the context of hybrid WMNs. SafeMesh is based on the well-known AODV routing protocol, and implements a number of modifications and extensions that significantly improve its performance in hybrid WMNs. This is demonstrated via an extensive set of simulation results. We further show the practicality of the protocol through a prototype implementation and provide performance results obtained from a small-scale testbed deployment.     

Multicast routing protocols in wireless mesh networks: a survey

Wireless mesh networks (WMNs) introduce a new type of network that has been applied over the last few years. One of the most important developing issues in WMNs is multicast routing, which is a key technology that provides dissemination of data to a group of members in an efficient way. In this article, after an introduction about the structure of a WMN, multicast routing algorithms and protocols in WMNs are surveyed in a detailed and efficient manner. Moreover, effort is made to scale the study into one of the important potential capabilities of multicast routing mechanisms in WMNs, which is taking advantage of using different channels and radios association. While nodes in a single-radio mesh network operating on single-channel have restrictions for capacity, equipping mesh routers with multiple radios using multiple channels can decrease the intention of capacity problem as well as increase the aggregate bandwidth available to the network and improving the throughput. Hence, the purpose of channel assignment is to decrease the interferences while increasing the network capacity and keeping the connectivity of the network. Therefore, this article investigates the multicast protocols considering a definition of three types of WMNs, based on channel-radio association including SRSC, SRMC and MRMC. In its follow, a classification for multicast routing algorithms regarding the achieved optimal solutions will be presented. Finally, a study of MRMC and its relevant problems will be offered, considering the joint channel assignment and the multicast tree construction problem.     

无线Mesh网络中多信道生成树路由算法

无线Mesh网络是一种特殊的AdHoc网络。它易于部署、安装,能有效地构建无线骨干网,通常被用作宽带Internet接入和扩展无线LAN的覆盖范围。针对无线Mesh网络的特点,提出了一种不同于一般MANET路由协议的路由算法。该算法基于网络拓扑生成树,使用多个无重叠信道;在解决信道分配问题的同时,兼顾信道多样性和信道重用,更好地利用无线频谱资源,支持链路并行传输。     

Coordinated opportunistic routing protocol for wireless mesh networks

Opportunistic routing is an emerging research area in Wireless Mesh Networks (WMNs), that exploits the broadcast nature of wireless networks to find the optimal routing solution that maximizes throughput and minimizes packet loss. Opportunistic routing protocols mainly suffer from computational overheads, as most of the protocols try to find the best next forwarding node. In this paper we address the key issue of computational overhead by designing new routing technique without using pre-selected list of potential forwarders. We propose a novel opportunistic routing technique named, Coordinated Opportunistic Routing Protocol for WMNs (CORP-M). We compare CORP-M with well-known protocols, such as AODV, OLSR, and ROMER based on throughput, delivery ratio, and average end-to-end delay. Simulation results show that CORP-M, gives average throughput increase upto 32%, and increase in delivery ratio (from 10% to 20%). We also analyze the performance of CORP-M and ROMER based on various parameters, such as duplicate transmissions and network collisions, by analysis depicts that CORP-M reduces duplicate transmissions upto 70% and network collisions upto 30%.     

A cross-layer optimization framework for joint channel assignment and multicast routing in multi-channel multi-radio wireless mesh networks

Existing literature on multicast routing protocols in wireless mesh networks (WMNs) from the view point of the links involved in routing are divided into two categories: schemes are aimed at multicast construction with minimal interference which is known as NP hard problem. In contrast, other methods develop network-coding-based solutions with the main objective of throughput maximization, which can effectively reduce the complexity of finding the optimal routing solution from exponential to polynomial time. The proposed framework in this paper is placed in the second category. In multi-channel multi-radio WMNs (MCMR WMNs), each node is equipped with multiple radios, each tuned on a different channel. In this paper, for the first time, we propose a cross-layer convex optimization framework for joint channel assignment and multicast throughput maximization in MCMR WMNs. The proposed method is composed of two phases: in the first phase, using cellular learning automata, channels are assigned to the links established between the radios of the nodes in a distributed fashion such that the minimal interference coefficient for each link is provided. Then, the resultant channel assignment scheme is utilized in the second phase for throughput maximization within an iterative optimization framework based on Lagrange relaxation and primal problem decomposition. We have conducted many experiments to contrast the performance of our solution against many representative approaches.