多信道无线Mesh网络的性能研究

在无线Mesh网络中使用多信道可以减少碰撞和干扰,提高系统吞吐量。本文先介绍无线Mesh网络,然后介绍多信道在无线Mesh网络中的应用,分析了几种常用的多信道MAC协议。接着着重阐述了多信道无线Mesh网络所面临的问题与挑战,对信道分配、路由选择和隐蔽终端这3个主要问题进行分析,并对其研究设计方向进行了展望。     

多信道无线Mesh网络的性能研究

在无线Mesh网络中使用多信道可以减少碰撞和干扰,提高系统吞吐量.本文先介绍无线Mesh网络,然后介绍多信道在无线Mesh网络中的应用,分析了几种常用的多信道MAC协议.接着着重阐述了多信道无线Mesh网络所面临的问题与挑战,对信道分配、路由选择和隐蔽终端这3个主要问题进行分析,并对其研究设计方向进行了展望.     

多射频无线Mesh网中的接口分域信道分配

在多射频多信道无线Mesh网中,是无线宽带接入的重要候选技术之一.为了满足无线宽带接入的容量要求,Mesh路由器节点常需要配置多个无线接口并使用多个正交信道.已有的信道分配方法虽能减少干扰和碰撞,但不能完全避免.本文提出一种域内中心式调度的接口分域信道分配(ICCA)方案,旨在完全避免干扰与碰撞以提高网络吞吐量,尤其能...     

无线Mesh网络一种以节点为单位的多信道分配

在无线Mesh网络中,利用无线多信道路由协议可以提高网络的性能,因此信道资源的分配与管理对于无线Mesh网的性能优化起着十分重要的作用。本文介绍了一种以节点为单位进行信道分配的算法。     

一种新的基于最大流的无线Mesh网络信道分配算法

在无线Mesh网络中,为节点配置多接口多信道MAC协议成为提高网络性能、扩大网络容量的有效手段之一。有效的信道分配策略在多信道无线Mesh网络中显得尤为重要。本文提出一种基于最大流的信道分配算法。该算法通过最大流计算网络中可达到的最大吞吐量,以此作为网络负载标准进行信道分配,将降低整个网络的总体干扰作为目标函数进行优化。仿真结果表明,即使在网络负载较重的情况下,算法仍能保持较好的性能。     

无线Mesh网络一种以节点为单位的多信道分配

在无线Mesh网络中,利用无线多信道路由协议可以提高网络的性能,因此信道资源的分配与管理对于无线Mesh网的性能优化起着十分重要的作用.本文介绍了一种以节点为单位进行信道分配的算法.     

智能家居中无线Mesh网络信道分配算法的研究

将无线Mesh网络技术应用于智能家居组网中对实现信息化、网络化智能家居系统具有重要意义。针对现有无线Mesh网络信道分配算法无法满足智能家居系统中网络连接稳定性、灵活性等需求的问题,提出了一种基于信道状态的动态信道分配算法。该算法利用控制信道交互的信息,通过Hello信息的交换、信道协商、数据传输三个主要步骤实现动态分配信道,有效提高了无线Mesh网络的稳定性。     

基于拓扑分割的无线Mesh网络信道分配策略

该文根据无线Mesh网络流量呈现树状拓扑汇聚的特点提出基于拓扑分割的信道分配策略。依据无线干扰对不同链路的影响程度,把无线干扰分类为有确定方向的纵向干扰和横向干扰;提出沿着纵向干扰方向逐跳分割网络拓扑算法;提出最少信道隔离纵向干扰和为吞吐量最小的子拓扑增加信道的子拓扑间信道分配策略;提出横向干扰分块的子拓扑内信道使用方法;理论分析子拓扑内的冲突域及网络性能瓶颈,仿真研究子拓扑的吞吐性能及信道分配顺序。仿真结果表明,隔离纵向干扰和增加信道的分配策略能够有效保证和提升网络吞吐量,横向干扰分块的方法优于802.11s中定义的公共信道框架多信道机制。     

无线Mesh网络可扩展性相关技术

无线移动通信中传输的数据密度持续增长对无线Mesh网络的系统性能提出了挑战。在无线自组织网络中,由于存在随着节点数目的增加而平均节点容量逐步降低的规律,因此无线Mesh网络的大规模组网难以实施。无线Mesh网络可扩展性对于增强无线Mesh网络的自适应组网能力至关重要,因此,文章对在Mesh基站和Mesh移动台上采用的与可扩展性相关的关键技术,如信道分配技术、智能路由技术、多天线技术、节点分类和QoS分级技术、协作传输技术等,进行了探讨。     

基于改进离散蝙蝠算法的无线Mesh网络部分重叠信道分配

针对应急通信背景下无线Mesh网络(WMN)中存在的信道干扰和频谱资源利用不充分的问题,该文提出一种改进的离散蝙蝠算法(IDBA)用于求解最优部分重叠信道(POCs)分配方案。该方法采用K-means聚类算法优化网络拓扑,引入樽海鞘群的链式行为提高局部搜索能力,建立以最小化链路加权干扰为目标的线性规划模型来解决流量汇聚情况可能造成的网络瓶颈链路问题。仿真结果表明,在不同网络规模下,相比于其他基于群智能优化算法的信道分配方法,该方法具有较快的收敛速度和较优的搜索能力。此外,该方法能够在节点密集时显著降低网络干扰并保持网络的稳定性。     

An efficient channel assignment algorithm for multicast wireless mesh networks

Multicast can enhance the performance of wireless mesh networks (WMNs) effectively, which has attracted great attentions in recent years. However, multicast communication in WMNs requires efficient channel assignment strategy to reduce the total network interference and maximize the network throughput. In this paper, the concept of local multicast is proposed to measure interference and solve hidden channel problem in multicast communication. Basing on the concept, we propose a channel assignment algorithm considering the interference of local multicast and forwarding weight of each node (LMFW). The algorithm fully considers partially overlapped channels and orthogonal channels to improve the network performance. Simulations show that the proposed algorithm can reduce interference and improve network capacity of WMNs.     

Power-Efficient Spatial Reusable Channel Assignment Scheme in WLAN Mesh Networks

Interference has strong effect on the available bandwidth of wireless local area network (WLAN) based mesh networks. The channel assignment problem for multi-radio multi-channel multihop WLAN mesh networks is complex NP-hard, and channel assignment, routing and power control are tightly coupled. To mitigate the co-channel interference and improve capacity in multi-channel and multi-interface WLAN mesh networks, a power-efficient spatial reusable channel assignment scheme is proposed, which considers both channel diversity and spatial reusability to reduce co-channel interference by joint adjusting channel, transmission power and routing. In order to assign channel appropriately, an efficient power control scheme and a simple heuristic algorithm is introduced to achieve this objective, which adjust the channel and power level of each radio according to the current channel conditions so as to increase the opportunity of channel spatial reusability. The proposed channel assignment scheme also takes load, capacity and interference of links into consideration. Simulation results show the effectiveness of our approach and demonstrate that the proposed scheme can get better performance than other approaches in terms of throughput, blocking ratio, energy consumption and end-to-end delay.     

Channel Assignment Strategies for Multiradio Wireless Mesh Networks: Issues and Solutions

Next-generation wireless mobile communications will be driven by converged networks that integrate disparate technologies and services. The wireless mesh network is envisaged to be one of the key components in the converged networks of the future, providing flexible high- bandwidth wireless backhaul over large geographical areas. While single radio mesh nodes operating on a single channel suffer from capacity constraints, equipping mesh routers with multiple radios using multiple nonoverlap- ping channels can significantly alleviate the capacity problem and increase the aggregate bandwidth available to the network. However, the assignment of channels to the radio interfaces poses significant challenges. The goal of channel assignment algorithms in multiradio mesh networks is to minimize interference while improving the aggregate network capacity and maintaining the connectivity of the network. In this article we examine the unique constraints of channel assignment in wireless mesh networks and identify the key factors governing assignment schemes, with particular reference to interference, traffic patterns, and multipath connectivity. After presenting a taxonomy of existing channel assignment algorithms for WMNs, we describe a new channel assignment scheme called MesTiC, which incorporates the mesh traffic pattern together with connectivity issues in order to minimize interference in multi- radio mesh networks.     

An optimization framework for multicasting in MCMR wireless mesh network with partially overlapping channels

This paper focuses on the problem of maximizing throughput in multicast routing in Multi-Channel, Multi-Radio (MCMR) wireless mesh network. We propose an optimization framework based on binary integer programming that minimizes interference in multicast communication. Our Multicasting with multiple Gateways and Partially Overlapped Channels (MG-POC) framework utilizes a rational node selection to construct multicast tree that increases network performance. MG-POC is efficient as it (1) constructs the paths between source and receivers with minimal number of data forwarding nodes; (2) employs multiple gateways to substantially reduce interference and usage of resources; (3) benefits from wireless broadcast advantage and partially overlapped channels in channel assignment; (4) solves channel assignment and tree construction problems simultaneously. A weakly decoupled approach is also presented which finds a nearly optimal solution for large network problems in a reasonably short amount of time. Our schemes are proved to offer a connected and loop-free tree; and their performance are well compared to that of several existing methods on different simulation scenarios. The results of our simulations also demonstrate that incorporating multi-gateway and partially overlapping channels has a significant impact on minimizing network interference which, in turn, dramatically enhances network throughput.     

Partially overlapping channel assignment for WLANs using SINR interference model

The use of multiple channels in 802.11 wireless local area networks can improve network performance. Many efforts have been done to better exploit multiple non‐overlapped channels. However, the number of orthogonal channels in the Institute of Electrical and Electronics Engineers 802.11 standards is very much limited. Recent studies indicate that we can improve the full‐range channel utilization and the network throughput by properly utilizing the partially overlapping channels. However, little work was focused on channel assignment for partially overlapping channels. In this paper, we investigate the problem of partially overlapping channel assignment to improve the performance of 802.11 wireless networks based on the Signal to Interference–Noise Ratio interference model. Using the Signal to Interference–Noise Ratio model, we deduce a direct relationship between maximizing system throughput and minimizing total interference when partially overlapping channels are employed. After that, we propose a greedy method to minimize the total interference for throughput maximization. We evaluate our algorithm through extensive simulations and compare its performances with those of the state‐of‐the‐art. Copyright © 2013 John Wiley & Sons, Ltd.     

Network coding for multiple unicast sessions in multi-channel/interface wireless networks

Throughput limitation of wireless networks imposes many practical problems as a result of wireless media broadcast nature. The solutions of the problem are mainly categorized in two groups; the use of multiple orthogonal channels and network coding (NC). The networks with multiple orthogonal channels and possibly multiple interfaces can mitigate co-channel interference among nodes. However, efficient assignment of channels to the available network interfaces is a major problem for network designers. Existing heuristic and theoretical work unanimously focused on joint design of channel assignment with the conventional transport/IP/MAC architecture. Furthermore, NC has been a prominent approach to improve the throughput of unicast traffic in wireless multi-hop networks through opportunistic NC. In this paper we seek a collaboration scheme for NC in multi-channel/interface wireless networks, i.e., the integration of NC, routing and channel assignment problem. First, we extend the NC for multiple unicast sessions to involve both COPE-type and a new proposed scheme named as Star-NC. Then, we propose an analytical framework that jointly optimizes the problem of routing, channel assignment and NC. Our theoretical formulation via a linear programming provides a method for finding source–destination routes and utilizing the best choices of different NC schemes to maximize the aggregate throughput. Through this LP, we propose a novel channel assignment algorithm that is aware of both coding opportunities and co-channel interference. Finally, we evaluate our model for various networks, traffic models, routing and coding strategies over coding-oblivious routing.     

Nodes organization for channel assignment with topology preservation in multi-radio wireless mesh networks

The wireless mesh network is a new emerging broadband technology providing the last-mile Internet access for mobile users by exploiting the advantage of multiple radios and multiple channels. The throughput improvement of the network relies heavily on the utilizing the orthogonal channels. However, an improper channel assignment scheme may lead to network partition or links failure. In this paper we consider the assignment strategy with topology preservation by organizing the mesh nodes with available channels, and aim at minimizing the co-channel interference in the network. The channel assignment with the topology preservation is proved to be NP-hard and to find the optimized solution in polynomial time is impossible. We have formulated a channel assignment algorithm named as DPSO-CA which is based on the discrete particle swarm optimization and can be used to find the approximate optimized solution. We have shown that our algorithm can be easily extended to the case with uneven traffic load in the network. The impact of radio utilization during the channel assignment process is discussed too. Extensive simulation results have demonstrated that our algorithm has good performance in both dense and sparse networks compared with related works.     

Joint Channel Assignment and Routing for Throughput Optimization in Multiradio Wireless Mesh Networks

Multihop infrastructure wireless mesh networks offer increased reliability, coverage, and reduced equipment costs over their single-hop counterpart, wireless local area networks. Equipping wireless routers with multiple radios further improves the capacity by transmitting over multiple radios simultaneously using orthogonal channels. Efficient channel assignment and routing is essential for throughput optimization of mesh clients. Efficient channel assignment schemes can greatly relieve the interference effect of close-by transmissions; effective routing schemes can alleviate potential congestion on any gateways to the Internet, thereby improving per-client throughput. Unlike previous heuristic approaches, we mathematically formulate the joint channel assignment and routing problem, taking into account the interference constraints, the number of channels in the network, and the number of radios available at each mesh router. We then use this formulation to develop a solution for our problem that optimizes the overall network throughput subject to fairness constraints on allocation of scarce wireless capacity among mobile clients. We show that the performance of our algorithms is within a constant factor of that of any optimal algorithm for the joint channel assignment and routing problem. Our evaluation demonstrates that our algorithm can effectively exploit the increased number of channels and radios, and it performs much better than the theoretical worst case bounds     

Graph coloring based channel assignment framework for rural wireless mesh networks

IEEE 802.11 based wireless mesh networks with directional antennas are expected to be a new promising technology and an economic approach for providing wireless broadband services in rural areas. In this paper, we discuss interference models and address how they can affect the design of channel assignment in rural mesh networks. We present a new channel assignment framework based on graph coloring for rural wireless mesh networks. The goal of the framework is to allow synchronously transmitting or receiving data from multiple neighbor links at the same time, and continuously doing full-duplex data transfer on every link, creating an efficient rural mesh network without interference. Channel assignment is shown to be NP-hard. We frame this channel allocation problem in terms of Adjacent Vertex Distinguishing Edge Coloring （AVDEC）. Detailed assignment results on grid topology are presented and discussed. Furthermore, we design an algorithm. Finally, we evaluate the perform- ance of the proposed algorithm through extensive simulations and show the algorithm is effective to the regular grid topologies, and the number of colors used by the algorithm is upper bounded by A ~ 1. Hence the algorithm guarantees that the number of channels available in standards such as IEEE 802.11a is sufficient to have a valid AVDEC for many grid topologies. We also evaluate the proposed algorithm for arbitrary graphs. The algorithm provides a lower upper bound on the minimum number of channels to the AVDEC index channel assignment problem.     

Distributed spectrum assignment for cognitive networks with heterogeneous spectrum opportunities

This paper presents a distributed and localized interference‐aware channel assignment framework for multi‐radio wireless mesh networks in a cognitive network environment. The availability of multiple interfaces and channels in wireless devices is expected to enhance network throughput in wireless mesh networks. A notable design issue in such networks is how to dynamically assign available channels to multiple radio interfaces for maximizing effective network throughput by minimizing interference. The proposed framework uses a novel interference estimation method by utilizing distributed conflict graphs on a per‐interface basis. Presented results obtained via simulation studies in 802.11 based multi‐radio mesh networks indicate that for both homogeneous and heterogeneous primary networks, the proposed protocol can facilitate a large increase in network throughput in comparison with a Common Channel Assignment mechanism that is used as a benchmark in the literature. Copyright © 2010 John Wiley & Sons, Ltd.