一种基于OLSR的新型层次路由算法*

提出了一种新型的基于OLSR的层次化改进算法HOLSR,旨在提高OLSR的整体效率。该算法通过分层设置洪泛范围和灵活调整各层拓扑控制分组的更新周期,降低路由执行开销;同时采用差值路由补偿技术提高数据分组的传输效率。仿真实验结果表明：HOLSR与OLSR路由算法相比,数据分组成功传输率高,端到端延迟小,路由协议开销少;与DSR、AODV、DSDV等典型路由算法相比,在不同节点移动速度和不同通信负载下,综合性能也有优势,尤其在通信负载较大时（880 kbps）,优势更加明显。     

An efficient joint channel assignment and QoS routing protocol for IEEE 802.11 multi-radio multi-channel wireless mesh networks

With the emerging of video, voice over IP (VoIP) and other real-time multimedia services, more and more people pay attention to quality of service (QoS) issues in terms of the bandwidth, delay and jitter, etc. As one effective way of broadband wireless access, it has become imperative for wireless mesh networks (WMNs) to provide QoS guarantee. Existing works mostly modify QoS architecture dedicated for ad hoc or sensor networks, and focus on single radio and single channel case. Meanwhile, they study the QoS routing or MAC protocol from view of isolated layer. In this paper, we propose a novel cross-layer QoS-aware routing protocol on OLSR (CLQ-OLSR) to support real-time multimedia communication by efficiently exploiting multi-radio and multi-channel method. By constructing multi-layer virtual logical mapping over physical topology, we implement two sets of routing mechanisms, physical modified OLSR protocol (M-OLSR) and logical routing, to accommodate network traffic. The proposed CLQ-OLSR is based on a distributed bandwidth estimation scheme, implemented at each node for estimating the available bandwidth on each associated channel. By piggybacking the bandwidth information in HELLO and topology control (TC) messages, each node disseminates information of topology and available bandwidth to other nodes in the whole network in an efficient way. From topology and bandwidth information, the optimized path can be identified. Finally, we conduct extensive simulation to verify the performance of CLQ-OLSR in different scenarios on QualNet platform. The results demonstrate that our proposed CLQ-OLSR outperforms single radio OLSR, multi-radio OLSR and OLSR with differentiated services (DiffServ) in terms of network aggregate throughput, end-to-end packet delivery ratio, delay and delay jitter with reasonable message overheads and hardware costs. In particular, the network aggregate throughput for CLQ-OLSR can almost be improved by 300% compared with the single radio case.     

Routing Internet traffic in heterogeneous mesh networks: Analysis and algorithms

In practical wireless mesh networks (WMNs), gateways are subject to hard capacity limits on the aggregate number of flows (in terms of bit rate) that they can support. Thus, if traffic is routed in the mesh network without considering those constraints, as well as the traffic distribution, some gateways or intermediate mesh routers may rapidly get overloaded, and the network resources can be unevenly utilized. To address this problem, in this paper we firstly develop a multi-class queuing network model to analyze feasible throughput allocations, as well as average end-to-end delay, in heterogeneous WMNs. Guided by our analysis, we design a Capacity-Aware Route Selection algorithm (CARS), which allocates network paths to downstream and upstream Internet flows so as to ensure a more balanced utilization of wireless network resources and gateways’ fixed connections. Through simulations in a number of different network scenarios we show that the CARS scheme significantly outperforms conventional shortest path routing, as well as an alternative routing method that distributes the traffic load on the gateway nodes to minimize its variance.     

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

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

基于流量模式和网络拓扑的网关部署算法

多并发流所引起的网络负载不均衡是无线网状网(wireless Mesh network,WMN)面临的一个挑战,部署网关是一种能缓解竞争节点负载的可行方案.针对这一问题,提出基于流量模式和网络拓扑的启发式网关部署算法.该算法利用节点在多种流量模式下所承载流量的平均值来估算节点的网络负载,并基于节点的网络负载和位置来选择网关,再根据特定的计算,分配节点给已知网关所管理的簇.实验结果表明,在不同流量模式和网络资源配置下,该算法均能有效地提高网络吞吐量、降低端到端延迟、减少路径长度.     

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

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

一种间歇性连接移动网络自适应路由协议

为提高间歇性连接移动网络的消息发送效率,提出一种基于移动自组网OLSR协议的自适应路由协议ARPBO。ARPBO在网络连通时通过OLSR协议快速转发消息;在网络中断时对OLSR协议进行扩展,从消息发送节点的局部连通网络中有效选择下一跳节点,然后通过延迟容忍网络的"存储-携带-转发"机制转发消息。实验结果表明,该路由协议能够在网络存在间歇性连接时获得较高的传递成功率和较低的传递时延。     

Local heuristic for the refinement of multi-path routing in wireless mesh networks

We consider wireless mesh networks and the problem of routing end-to-end traffic over multiple paths for the same origin–destination pair with minimal interference. We introduce a heuristic for path determination with two distinguishing characteristics. First, it works by refining an extant set of paths, determined previously by a single- or multi-path routing algorithm. Second, it is totally local, in the sense that it can be run by each of the origins on information that is available no farther than the node’s immediate neighborhood. We have conducted extensive computational experiments with the new heuristic, using AODV and OLSR, as well as their multi-path variants, as underlying routing methods. For two different CSMA settings (as implemented by 802.11) and one TDMA setting running a path-oriented link scheduling algorithm, we have demonstrated that the new heuristic is capable of improving the average throughput network-wide. When working from the paths generated by the multi-path routing algorithms, the heuristic is also capable to provide a more evenly distributed traffic pattern.     

基于树形拓扑的无线Mesh网络路由协议研究

研究和分析了无线Mesh网络路由协议及其特点,提出了无线Mesh网络路由协议设计原则.遵循这些原则,充分利用Mesh网络全相连的优点构建出树形逻辑拓扑结构,该拓扑结构能满足无线Mesh网络业务特点的要求.在该拓扑树基础上设计了一种基于树形拓扑的无线Mesh网络路由协议(TTRP),该协议采用无开销的源地址学习方式构建路由相关表项,快速链路切换和路由重定向机制大大提高了TTRP路由协议的健壮性和网络的抗毁性.网络仿真结果表明了该路由协议的可行性.     

A genetic algorithm-based system for wireless mesh networks: analysis of system data considering different routing protocols and architectures

Wireless mesh networks (WMNs) are attracting a lot of attention from wireless network researchers. Node placement problems have been investigated for a long time in the optimization field due to numerous applications in location science. In our previous work, we evaluated WMN-GA system which is based on genetic algorithms (GAs) to find an optimal location assignment for mesh routers. In this paper, we evaluate the performance of four different distributions of mesh clients for two WMN architectures considering throughput, delay and energy metrics. For simulations, we used ns-3, optimized link state routing (OLSR) and hybrid wireless mesh protocols (HWMP). We compare the performance for Normal, Uniform, Exponential and Weibull distributions of mesh clients by sending multiple constant bit rate flows in the network. The simulation results show that for HWM protocol the throughput of Uniform distribution is higher than other distributions. However, for OLSR protocol, the throughput of Exponential distribution is better than other distributions. For both protocols, the delay and remaining energy are better for Weibull distribution.     

Efficient Multicast Algorithms for Multichannel Wireless Mesh Networks

The wireless mesh network is an emerging technology that provides high quality service to end users as the "last mile” of the Internet. Furthermore, multicast communication is a key technology for wireless mesh networks. Multicast provides efficient data distribution among a group of nodes. However, unlike other wireless networks, such as sensor networks and MANETs, where multicast algorithms are designed to be energy efficient and to achieve optimal route discovery among mobile nodes, wireless mesh networks need to maximize throughput. This paper proposes two multicast algorithms: the Level Channel Assignment (LCA) algorithm and the Multichannel Multicast (MCM) to improve the throughput for multichannel and multi-interface mesh networks. The algorithms build efficient multicast trees by minimizing the number of relay nodes and total hop count distances of the trees. The algorithms use dedicated channel assignment strategies to reduce the interference to improve the network capacity. We also demonstrate that using partially overlapping channels can further diminish the interference. Furthermore, additional interfaces help to increase the bandwidth, and multiple gateways can further shorten the total hop count distance. Simulations show that those algorithms greatly outperform the single-channel multicast algorithm. We also observe that MCM achieves better throughput and shorter delay while LCA can be realized in distributed manner.     

A survey on routing algorithms for wireless Ad-Hoc and mesh networks

Wireless networking technology is evolving as an inexpensive alternative for building federated and community networks (relative to the traditional wired networking approach). Besides its cost-effectiveness, a wireless network brings operational efficiencies, namely mobility and untethered convenience to the end user. A wireless network can operate in both the “Ad-Hoc” mode, where users are self-managed, and the “Infrastructure” mode, where an authority manages the network with some Infrastructure such as fixed wireless routers, base stations, access points, etc. An Ad-Hoc network generally supports multi-hopping, where a data packet may travel over multiple hops to reach its destination. Among the Infrastructure-based networks, a Wireless Mesh Network (with a set of wireless routers located at strategic points to provide overall network connectivity) also provides the flexibility of multi-hopping. Therefore, how to route packets efficiently in wireless networks is a very important problem.A variety of wireless routing solutions have been proposed in the literature. This paper presents a survey of the routing algorithms proposed for wireless networks. Unlike routing in a wired network, wireless routing introduces new paradigms and challenges such as interference from other transmissions, varying channel characteristics, etc. In a wireless network, routing algorithms are classified into various categories such as Geographical, Geo-casting, Hierarchical, Multi-path, Power-aware, and Hybrid routing algorithms. Due to the large number of surveys that study different routing-algorithm categories, we select a limited but representative number of these surveys to be reviewed in our work. This survey offers a comprehensive review of these categories of routing algorithms.In the early stages of development of wireless networks, basic routing algorithms, such as Dynamic Source Routing (DSR) and Ad-Hoc On-demand Distance Vector (AODV) routing, were designed to control traffic on the network. However, it was found that applying these basic routing algorithms directly on wireless networks could lead to some issues such as large area of flooding, Greedy Forwarding empty set of neighbors, flat addressing, widely-distributed information, large power consumption, interference, and load-balancing problems. Therefore, a number of routing algorithms have been proposed as extensions to these basic routing algorithms to enhance their performance in wireless networks. Hence, we study the features of routing algorithms, which are compatible with the wireless environment and which can overcome these problems.     

Interference-aware multicast and broadcast routing in wireless mesh networks using both rate and channel diversity

This paper deals with the problem of load-balanced routing in multi-radio multi-rate multi-channel wireless mesh networks. Our analysis relies on the multicast and broadcast sessions, where each session has a specific bandwidth requirement. We show that using both rate and channel diversity significantly improves the network performance. Toward this goal, we propose two cross-layer algorithms named the “Interference- and Rate-aware Multicast Tree (IRMT)” and the “Interference- and Rate-aware Broadcast Tree (IRBT)”. The proposed algorithms jointly address the problems of routing tree construction, transmission channel selection, transmission rate selection, and call admission control. As an advantage, the IRMT and the IRBT algorithms consider both inter-flow and intra-flow interference. These schemes not only improve the utilization of the network resources, but also balance the traffic load over the network. Numerical results demonstrate the efficiency of the proposed algorithms in terms of the number of transmissions, the load-balancing, and the network throughput.     

Performance evaluation of mesh-based NoCs: Implementation of a new architecture and routing algorithm

This paper presents the result of experiments conducted in mesh networks on different routing algorithms, traffic generation schemes and switching schemes. A new network on chip (NoC) topology based on partial interconnection of mesh network is proposed and a routing algorithm supporting the proposed architecture is developed. The proposed architecture is similar to standard mesh networks, where four extra bidirectional channels are added which remove the congestion and hotspots compared to standard mesh networks with fewer channels. Significant improvement in delay (60% reduction) and throughput (60% increase) was observed using the proposed network and routing when compared with the ideal mesh networks. An increase in number of channels makes the switches expensive and could increase the area and power consumption. However, the proposed network can be useful in high speed applications with some compromise on area and power.     

RBC-OLSR: Reputation-based clustering OLSR protocol for wireless ad hoc networks

We consider the problem of assuring the trustworthiness (i.e. reliability and robustness) and prolonging the lifetime of wireless ad hoc networks, using the OLSR routing protocol, in the presence of selfish nodes. Assuring the trustworthiness of these networks can be achieved by selecting the most trusted paths, while prolonging the lifetime can be achieved by (1) reducing the number of relay nodes (MPR) propagating the topology control (TC) messages and (2) considering the residual energy levels of these relay nodes in the selection process. In this paper, we propose a novel clustering algorithm and a relay node selection algorithm based on the residual energy level and connectivity index of the nodes. This hybrid model is referred to as H-OLSR. The OLSR messages are adapted to handle the cluster heads election and the MPR nodes selection algorithms. These algorithms are designed to cope with selfish nodes that are getting benefits from others without cooperating with them. Hence, we propose an incentive compatible mechanism that motivates nodes to behave truthfully during the selection and election processes. Incentive retributions increase the reputation of the nodes. Since network services are granted according to nodes’ accumulated reputation, the nodes should cooperate. Finally, based on nodes’ reputation, the most trusted forwarding paths are determined. This reputation-based hybrid model is referred to as RH-OLSR. Simulation results show that the novel H-OLSR model based on energy and connectivity can efficiently prolong the network lifetime, while the RH-OLSR model improves the trustworthiness of the network through the selection of the most trusted paths based on nodes’ reputations. These are the two different processes used to define the reputation-based clustering OLSR (RBC-OLSR) routing protocol.     

Load-aware routing in mesh networks: Models, algorithms and experimentation

In this paper we consider wireless mesh networks (WMNs) used to share the Internet connectivity of sparsely deployed fixed lines with heterogeneous capacity, ranging from ISP-owned high-speed links to subscriber-owned low-speed connections. If traffic is routed in the mesh without considering the load distribution and the bandwidth of Internet connections, some gateways may rapidly get overloaded because they are selected by too many mesh nodes. This may cause a significant reduction of the overall network capacity. To address this issue, in this paper we first develop a queuing network model that predicts the residual capacity of network paths, and identifies network bottlenecks. By taking advantage of this model, we design a novel Load-Aware Route Selection algorithm, named LARS, which improves the network capacity by allocating network paths to upstream Internet flows so as to ensure a more balanced utilization of wireless network resources and gateways’ Internet connections. Using simulations and a prototype implementation, we show that the LARS scheme significantly outperforms the shortest-path first routing protocol using a contention-aware routing metric, providing up to 240% throughput improvement in some network scenarios.     

无线Mesh网中一种基于MPR当选频度的OLSR扩展路由协议

在研究无线Mesh网拓扑结构和业务模式的基础上,深度剖析适合其特性的路由协议类型,得出先验式的逐跳路由最适合无线Mesh网的结论.在此基础上,以典型的先验式逐跳路由协议OLSR(Optimized Link State Routing)为原型,对其中的邻居表结构和MPR(Multipoint Relay)选择算法进行了改进,通过引入"MPR当选频度"的概念,克服了OLSR协议在无线Mesh网环境中资源利用不充分的缺陷.仿真实验的结果也验证了所提出的EOLSR协议对网络性能确实有较大程度的提升,能够在基本不增加协议开销的前提下,有效地增加网络吞吐量,降低端到端的平均延时.     

Zero-Degree algorithm for Internet GateWay placement in backbone wireless mesh networks

Internet GateWays (IGWs) are responsible for connecting the backbone wireless mesh networks (BWMNs) to the Internet/wired backbone. An IGW has more capabilities than a simple wireless mesh router (WMR) but is more expensive. Strategically placing the IGWs in a BWMN is critical to the Wireless Mesh Network (WMN) architecture. In order to solve the problem of IGWs placement in BWMNs, a novel algorithm is proposed in this paper. The new algorithm is involved in placing a minimum number of IGWs so that the Quality of Service (QoS) requirements are satisfied. Different from existing algorithms, this new algorithm incrementally identifies IGWs and prioritively assigns wireless mesh routers (WMRs) based on the computed degree of WMRs to identified IGWs. Performance evaluation results show that proposed algorithm outperforms other alternative algorithms by comparing the number of gateways placed in different scenarios. Furthermore, having control of the distribution of IGWs in order to locate them closest to available Internet/wired network connection points is an added advantage of this algorithm.     

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

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

无线Mesh网络中基于最小权有限支配集的网关部署算法研究

无线Mesh网络中网关是网络性能的瓶颈,网关部署至关重要。本文对无线Mesh网络中网关QoS性能进行分析,提出基于最小权有限支配集,以部署费用为贪心策略的贪婪算法(Greedy_LDSC),该算法用贪心法提高了网关的性价比。同时,提出了基于最小权有限支配集改进的贪婪算法(Greedy_LDSI),以降低网关的部署费用。仿真实验表明,从网关性价比方面来看,Greedy_LDSC算法的网关性价比之和比基于最小权有限支配集的网关部署算法(GREEDY_LDS)要高;从网关部署费用方面来看,Greedy_LDSI算法的网关部署费用比GREEDY_LDS算法会低。