基于链路负载分级的无线Mesh网信道分配算法

由于无线Mesh网络信道分配算法的性能增益与网络的流量负载特点密切相关,在对多射频多信道无线Mesh网络的流量特点进行分析的基础上,提出一种静态信道分配的启发式算法LPFCA。该算法根据无线链路在网络拓扑中的位置信息来估计无线链路的预期负载情况,并对网络中无线链路的预期负载进行量化分级,利用整数线性规划方法对信道分配进行描述并应用目标函数对信道分配进行优化,使网络总的干扰权重最小化。仿真结果表明,相比于现有的算法,该算法在吞吐量上平均提升了18.9%。     

WMN中的干扰避免部分重叠信道分配算法

针对无线mesh网络(wireless mesh networks,WMN)中存在的信道干扰问题,提出一种基于部分重叠信道(partially overlapping channels,POC)的负载平衡且干扰避免的信道分配算法。通过基于Huffman树的通信接口分配方法连接邻居节点的接口;根据网络干扰情况,对链路进行迭代信道分配,使用静态链路调度保证网络连接;利用启发式算法优先为重要程度较高的链路分配无干扰时隙,对链路调度进行优化。仿真结果表明,在具有混合流量的WMN中,所提算法可以显著提升网络吞吐量,降低网络干扰与平均丢包率,改善网络性能。     

多信道无线Mesh网络的多播信道分配算法

无线Mesh网络可用信道和节点接口的缺乏限制了多播树链路的可用带宽,致使网络吞吐量下降。针对该问题,提出支持多播的多信道多接口信道分配算法——LAMCA。该算法能最小化无线Mesh网络的干扰程度,并最大化网络吞吐量。仿真结果表明,与层次信道分配算法LCA相比,该算法在吞吐量性能方面较优。     

无线Mesh网络中混合信道分配算法研究

根据多射频多信道无线Mesh网络的特点,提出一种基于节点干扰的混合信道分配算法。将节点间的链路分为正向链路和反向链路,通过概率模型分析链路干扰,计算节点间链路的权重,建立带权重的有向网络连接图。根据链路权重为节点固定接口分配信道,减小可切换接口在信道改变过程中引起的网络干扰。扩展的NS2仿真结果表明,该算法能有效降低链路干扰,提高网络吞吐量。     

一种混合信道分配算法的研究与仿真

为了提高无线网状网络的链路容量,提出一种在网络中配置节点多射频多信道的混合信道分配算法.通过配置默认信道并优化默认信道的使用,该算法基于启发式信道分配策略来减小链路干扰提升链路容量.基于网络物理拓扑,该算法生成简化的网络逻辑拓扑,使得信道分配方案能够结合路由优化网络性能.对信道分配的动态调整,确保了网络容量的实时优化.仿真结果显示,本信道分配算法可以有效地提升网络性能.     

一种最小化干扰数目的多无线电信道分配算法

无线Ad hoc网络中要求链路可以随机处于任何位置进行通信.由于链路位置的随机性,可能会造成某些链路都聚集在某个小范围内,同时通信可能会造成链路间相互干扰.因此需要一种机制来保证链路间实际干扰最小.针对此问题,在信道分配中运用了博弈的思想,利用位势博弈特性构建效用函数,对存在潜在干扰的链路分配信道,使实际干扰最小.算法通过不断循环改变链路无线电的信道,最小化实际干扰数目达到纳什均衡.仿真结果表明,算法能够使信道分配策略达到纳什均衡,使链路间通信拥有更高的吞吐量和更好的鲁棒性.     

基于混合干扰模型的多信道Mesh网络调度算法

研究了多信道无线Mesh网络中的调度及信道分配问题,设计了一种综合协议干扰模型与物理干扰模型的混合干扰模型,并在此干扰模型下提出了一种集中式调度算法。该算法在目前普遍使用的协议干扰模型的基础上,考虑了无线链路的物理传输特性：即使存在一定的干扰,也可以成功接收发射端发送的数据。模拟实验表明该算法可以提高Mesh网络中链路的并行性,有效减少总传输时间。     

WMN中基于链路质量的信道分配算法

针对IEEE 802.11多射频多信道无线Mesh网络,提出一种基于链路质量的分布式信道分配算法,通过信道扫描收集所有信道信息,根据链路质量决定工作信道,同时在网络发生变化时对信道进行动态调整。仿真实验结果表明,与常用的集中式信道分配算法相比,该算法更能有效提升网络容量。     

煤矿应急救援中无线Mesh网络多信道分配算法

针对现有的无线Mesh网络多信道分配算法无法解决煤矿应急救援中无线Mesh网络因传输干扰导致的信道分配抖动问题,结合无线Mesh网络连通性以及干扰模型,提出了一种基于拓扑分层和干扰避免的多信道分配算法,即对网络拓扑分层,在确定第1层节点与边的基础上,继续对其他层进行拓扑分配,然后根据干扰情况对各层进行信道分配。设计了仿真模型:无线Mesh节点发射距离为200m,干扰距离为500m,拓扑范围为1 000m×1 000m。随机选取20个节点,在可用信道变化和网关变化2种情况下对该算法进行仿真分析,结果表明该算法较常用的拓扑结构算法提高了网络的吞吐量,降低了信道分配中的传输干扰。     

认知无线mesh网中联合路由的分布式信道分配算法*

多信道技术通过对数据流量进行分流,能够减少链路间干扰,从而提升网络容量。首先针对认知无线mesh网络提出一种有效的联合路由的分布式信道分配策略,该信道分配策略主要宗旨是维持邻域内信道差异。仿真结果表明,新的信道分配算法相比于无线多信道网络中基于链接的信道分配算法,平均吞吐量大约提高了50%,平均时延降低了约50%。在信道约束的情况下,进一步引入了信道合并算法。仿真结果表明,执行信道合并算法后,网络平均吞吐量、时延性能得到了进一步改善。     

Links organization for channel assignment in multi-radio wireless mesh networks

It is one key issue in the wireless mesh networks to provide various scenarios such as multimedia and applications. Links in the network can be organized and assigned to orthogonal channels so as to minimize the co-channel interference. In this paper we focus on the channel assignment problem for links in the mesh networks and aim at minimizing the overall network interference. The problem is proved to be NP-hard. We have first formulated an approach based on the Particle Swarm Optimization (PSO) algorithm which can be used to find the approximate optimized solution in small-size networks and as a baseline that other algorithms can be compared with. We also have proposed a centralized heuristic as well as a distributed heuristic algorithm for the channel assignment problem. Extensive simulation results have demonstrated that our schemes have good performance in both dense and sparse networks compared with related works.     

A topology control approach for utilizing multiple channels in multi-radio wireless mesh networks

We consider the channel assignment problem in a multi-radio wireless mesh network that involves assigning channels to radio interfaces for achieving efficient channel utilization. We present a graph–theoretic formulation of the channel assignment guided by a novel topology control perspective, and show that the resulting optimization problem is NP-complete. We also present an ILP formulation that is used for obtaining a lower bound for the optimum. We then develop a new greedy heuristic channel assignment algorithm (termed CLICA) for finding connected, low interference topologies by utilizing multiple channels. Our evaluations show that the proposed CLICA algorithm exhibits similar behavior and comparable performance relative to the optimum bound with respect to interference and capacity measures. Moreover, our extensive simulation studies show that it can provide a large reduction in interference even with a small number of radios per node, which in turn leads to significant gains in both link layer and multihop performance in 802.11-based multi-radio mesh networks.     

Mesh网络中实用有效的多信道分配方法

多信道多接口可以明显提高Mesh网络的吞吐量,然而已有的多信道分配算法和协议基本上都没有考虑无线信道的隔离度,这样便造成了路径间干扰。提出了一种基于信道隔离度的启发式多信道分配算法（CSCA）,有效地减少了路径间干扰。所构建的森林拓扑一方面方便了信道分配,另一方面也改善了流量均衡。模拟实验结果表明,CSCA算法有效地降低了Mesh网络中的干扰,提高了网络吞吐量。     

无线Mesh网络中路由与信道联合分配研究

无线Mesh网络中路由器使用多射频接口并配备多信道传输能有效增加网络吞吐量及降低干扰。研究路由与信道分配问题的目的就是增加网络容量、减少延迟等。文中针对无线Mesh网络中多接口多信道的路由与信道分配问题做了统一考虑,根据路由约束、信道约束、干扰约束以及宽带约束建立了混合整数线性规划（MILP）模型,并提出了基于迭代搜索的启发式算法很好地解决了此问题。仿真结果表明该算法可以提高网络吞吐量,降低延迟。     

Interference-aware channel assignment in a metropolitan multi-radio wireless mesh network with directional antennas

We investigate the problem of channel assignment in a metropolitan multi-radio wireless mesh network with directional antennas. Our contributions include a new conflict graph model for capturing the interference between links in a mesh network with a known wireless interface communication graph, and a new channel assignment procedure which accounts for interference both between links inside the mesh network, and from external sources. Additionally, we have implemented and evaluated the proposed channel assignment procedure in an actual metropolitan mesh network with 1.6-5 km links. Key components of the channel assignment procedure are the interference model, the link ordering, and the channel selection metric. The experimental results demonstrate how link ordering and the channel selection metric affect performance, in terms of the average packet delay and http latency. The results show that the proposed channel assignment procedure achieves performance very close to a lower bound of the average packet delay, and significantly higher than the performance achieved with a simpler interference-unaware procedure, and a measurement-based scheme that has appeared in the literature, and accounts for interference only from external 802.11 sources. Moreover, we investigate the performance when a different number of channels are available, and the timescales for channel re-assignment.     

Channel allocation in multi-channel wireless mesh networks

In this article, we survey the latest progress in multi-channel wireless mesh networks, focusing on wireless interference models and channel allocation algorithms with the goal of maximizing the network performance. We present the studies of different interference models and illustrate how they could affect the design of channel assignment. We also summarize channel allocation algorithms with different strategies in both omni-directional and directional antenna networks. We conclude that both static and dynamic channel allocation strategies have advantages and disadvantages, and the design of channel allocation algorithms strongly depends on the interference model and the assumption of network traffic.     

Improving densely deployed wireless network performance in unlicensed spectrum through hidden-node aware channel assignment

It is well known that a wireless local area network (WLAN) based on the IEEE 802.11 standard suffers from interference and scalability problems due to the limited number of non-overlapping channels. In order to mitigate the interference problem, channel assignment algorithms has been a popular research topic in recent years. It has been shown that such algorithms can greatly reduce the interference among wireless access points. However, in this paper, we show that previously proposed channel assignment algorithms may lead to an increased number of hidden nodes in dense network deployments. We also show that this can significantly decrease the performance of the network. Furthermore, we present results from experiments showing that the Request to send (RTS)/Clear to send (CTS) mechanism is unable to solve the hidden node problem in infrastructure WLANs, and therefore careful consideration needs to be taken when choosing channel assignment strategies in densely deployed wireless networks. To this end, we propose both a centralized channel assignment algorithm and a distributed channel assignment algorithm. Using a simulation study, we show that the proposed algorithms can outperform traditional channel assignment in densely deployed scenarios, in terms of QoS sensitive VoIP support without compromising the aggregate throughput, and that they are therefore a better performing alternative in such settings.     

Optimization models and methods for planning wireless mesh networks

In this paper novel optimization models are proposed for planning Wireless Mesh Networks (WMNs), where the objective is to minimize the network installation cost while providing full coverage to wireless mesh clients. Our mixed integer linear programming models allow to select the number and positions of mesh routers and access points, while accurately taking into account traffic routing, interference, rate adaptation, and channel assignment. We provide the optimal solutions of three problem formulations for a set of realistic-size instances (with up to 60 mesh devices) and discuss the effect of different parameters on the characteristics of the planned networks. Moreover, we propose and evaluate a relaxation-based heuristic for large-sized network instances which jointly solves the topology/coverage planning and channel assignment problems. Finally, the quality of the planned networks is evaluated under different traffic conditions through detailed system level simulations.     

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.