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.     

Performance analysis of a threshold based distributed channel allocation algorithm for cellular networks

Rapid advances of the handheld devices and the emergence of the demanding wireless applications require the cellular networks to support the demanding user needs more effectively. The cellular networks are expected to provide these services under a limited bandwidth. Efficient management of the wireless channels by effective channel allocation algorithms is crucial for the performance of any cellular system. To provide a better channel usage performance, dynamic channel allocation schemes have been proposed. Among these schemes, distributed dynamic channel allocation approaches showed good performance results. The two important issues that must be carefully addressed in such algorithms are the efficient co-channel interference avoidance and messaging overhead reduction. In this paper, we focus on our new distributed channel allocation algorithm and evaluate its performance through extensive simulation studies. The performance evaluation results obtained under different traffic load and user mobility conditions, show that the proposed algorithm outperforms other algorithms recently proposed in the literature.     

无线传感器网络的拥塞控制技术

无线传感器网络的多对一通信方式、无线链路的相互干扰、网络的动态变化和资源受限等特性,使得无线传感器网络容易出现拥塞,严重影响网络的QoS传输性能和生存周期,因此拥塞控制成为无线传感器网络服务质量保障机制的关键技术之一.在分析无线传感器网络特点的基础上,说明了拥塞检测和拥塞避免的策略,重点介绍和分析了基于速率控制、流量调度和传输调度等典型的拥塞解除算法,最后对拥塞控制技术的发展趋势进行了展望.     

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.     

How to Effectively Use Multiple Channels in Wireless Mesh Networks

Operating on a frequency band occupying several nonoverlapping channels, IEEE 802.11 is now widely used in wireless mesh networks (WMNs). Many multichannel MAC protocols are proposed to improve the spatial reuse in the network under the assumption that the transmissions on nonoverlapping channels do not interfere with each other. Some joint routing and channel assignment algorithms are also designed to increase the network throughput based on the premise that we can switch between different channels freely. Although simulations show that great improvements on network throughput can be observed in both cases, two fundamental questions remain: 1) Can we really use multiple nonoverlapping channels freely in WMNs? 2) If we can, what will be the cost when we switch channels dynamically and frequently? In this paper, by conducting extensive experiments on our testbed, we attempt to answer these questions. We find that in spite of interference between both overlapping and nonoverlapping channels, we can still use multiple channels in mesh networks under certain conditions but with care. We also show that the channel switching cost is actually very significant in WMNs. We recommend not to switch the channels too frequently when designing the channel assignment algorithms, and those channel assignment algorithms selecting one channel for each packet are not really beneficial.     

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

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

考虑干扰的无线传感器网络拓扑控制问题研究

无线传感器网络的拓扑控制是一个十分重要的技术问题。干扰对传感器网络应用产生了重要的影响,较大的传输干扰将导致信号的碰撞,增大网络延时间。但是,目前的大多数文献没有把干扰作为传感器网络拓扑控制的设计目标和考虑因素之一。本文研究考虑干扰的拓扑控制机制问题,根据传感器网络通信特点,设计了最优的集中式算法和适合合实际应用的次优分布式算法解决该问题。模拟实验结果表明,提出的算法与传统算法相比能有效减少网络干扰、节省能量消耗和减少网络延时,因此是一种新的高效的拓扑控制机制。     

认知无线Mesh网络中基于干扰模型的信道分配策略*

从信道干扰的角度为认知无线Mesh网络提出一种新的信道分配策略。首先对网络进行分层并按层对节点设置不同的层数权值,以此来选择最佳路径,再利用信道干扰模型来选择最佳信道。新策略有效整合了路由和信道分配过程,通过路由的实现来协助节点的信道分配以获得整个网络的最优化性能。仿真结果表明,新算法相比于无线多信道网络中基于链接的信道分配算法,在时延、吞吐量上有明显的优势。     

Interference aware resource allocation for hybrid hierarchical wireless networks

This paper addresses the problem of interference aware resource allocation for OFDMA based hybrid hierarchical wireless networks. We develop two resource allocation algorithms considering the impact of wireless interference constraints using a weighted SINR conflict graph to quantify the interference among the various nodes: (1) interference aware routing using maximum concurrent flow optimization; and (2) rate adaptive joint subcarrier and power allocation algorithm under interference and QoS constraints. We exploit spatial reuse to allocate subcarriers in the network and show that an intelligent reuse of resources can improve throughput while mitigating interference. We provide a sub-optimal heuristic to solve the rate adaptive resource allocation problem. We demonstrate that aggressive spatial reuse and fine tuned-interference modeling garner advantages in terms of throughput, end-to-end delay and power distribution.     

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

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

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.     

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.     

融合网络编码的无线协作中继网络资源分配

综述融合网络编码的无线协作中继网络资源分配的研究进展,总结了已有典型资源分配策略的特点、性能及系统设计要求,分析了网络编码技术(包括数字网络编码和物理层网络编码)的引入对无线协作中继网络资源分配策略设计的影响,给出了一种实用化的系统级跨层优化框架及设计基本原则,并探讨了无线协作中继网络资源分配研究的发展趋势及其走向实用化所亟待解决的关键问题.     

混合共享认知无线网络信道分配算法

混合频谱共享是适应认知用户不同地理分布的有效频谱共享模式。信道分配是无线通信网络中关键的问题之一,近年来得到了广泛研究。集中式信道分配算法是最常用的算法形式,但在认知无线电网络这种分布式系统中,集中式算法不易实现。将混合共享认知无线网络的信道分配问题构建为一对一的匹配博弈,提出了分布式用户-信道匹配算法。该算法数学复杂度低,且能够达到稳定匹配。仿真结果表明,算法收敛时间短,稳定匹配状态下的平均传输速率与使用匈牙利算法的最优分配算法所获得传输速率相接近,远优于随机分配算法的传输速率。     

无线传感器网络中一种抗无线局域网干扰的信道分配机制

无线传感器网络(WSN)易受到与其共享信道的无线局域网(Wifi)干扰,造成通信可靠性及吞吐量下降.当具有不同优先级的多个WSN受到Wifi干扰时,如何按优先级分配信道,并兼顾整体通信可靠性及吞吐量是一个重要问题.针对该问题,作者提出了一种抗Wifi干扰的信道分配机制EasiCAP(Channel Allocation for wireless sensor networks with Priority).该机制利用基于干扰强度和活跃比率的干扰特征模型(External Interference Model,EIM)度量WSN中各信道的Wifi干扰;同时,采用以接收端为中心的模型(Internal Interference Model,IIM)度量各WSN之间的干扰.然后,各WSN根据EIM和IIM度量的结果,采用局部化贪婪信道分配算法独立、实时地选择信道,通过保持信道、切换信道及抢占信道操作实现按优先级分配信道,并尽可能降低所有网络所受干扰之和.实际测量和仿真结果表明,EasiCAP可为各WSN提供与其优先级相对应的通信可靠性和吞吐量;而且该机制下的平均通信可靠性及吞吐量也比现有方法高.此外,EasiCAP未带来过大的开销.     

Jointly optimal congestion control, channel allocation and power control in multi-channel wireless multihop networks

In this paper, to increase end-to-end throughput and energy efficiency of the multi-channel wireless multihop networks, a framework of jointly optimize congestion control in the transport layer, channel allocation in the data link layer and power control in the physical layer is proposed. It models the network by a generalized network utility maximization (NUM) problem with elastic link data rate constraints. Through binary linearization and log-transformation, and after relaxing the binary constraints on channel allocation matrix, the NUM problem becomes a convex optimization problem, which can be solved by the gateway centralized through branch and bound algorithm with exponential time complexity. Then, a partially distributed near-optimal jointly congestion control, channel allocation and power control (DCCCAPC) algorithm based on Lagrangian dual decomposition technique is proposed. Performance is assessed through simulations in terms of network utility, energy efficiency and fairness index. Convergence of both centralized and distributed algorithms is proved through theoretic analysis and simulations. As the available network resources increase, the performance gain on network utility increases.     

Price-based congestion control and local channel-link assignment for multi-radio wireless mesh networks

In multi-radio multi-channel wireless mesh networks, engineering the network capacity requires a complex cross-layer design. In this paper, in order to make the complex problem implementable in a distributed manner, we make a decoupling approach that breaks down the entire design space into routing and initial channel assignment, and distributed congestion control and local channel reassignment. We propose a unified priced-based framework for distributed congestion control and localized channel-link assignment algorithms. We demonstrate the convergence of the proposed algorithms with respect to different fairness objectives (i.e., proportional fairness and max–min fairness) via simulation on both grid and random topologies. The proposed algorithms achieve faster convergence with less overhead in the control and forwarding plane than previous multi-path based algorithms.     

基于分组管理的无线mesh网多信道分配算法*

为了合理利用多信道来提高无线网络吞吐量,针对基于802.11标准无线mesh网的业务特点,提出了基于分组管理的分布式多信道分配算法。该算法将节点接口分为回程接口与转发接口,并使回程接口分配到在干扰区域内干扰值尽可能小的信道。仿真实验结果表明,该算法可以减少区域干扰,并可充分利用信道的多样性和得到较高的网络吞吐量。     

一种异构多接口多信道无线网络的信道分配算法

多接口多信道技术是无线网络环境中减少链路干扰、提高网络吞吐量的有效途径,但如何合理有效地进行信道分配已成为多接口多信道无线网络所面临的主要问题之一.针对自私的网络节点,本文使用非合作博弈对异构条件下多接口节点的信道分配问题进行建模分析,其纳什均衡解为解决该问题所需的稳定的信道分配方案.本文首先讨论纳什均衡的存在条件并提出实现纳什均衡的分布式算法.此外,考虑到实际网络中节点仅能感知局部信道信息以及接口工作信道受限等因素,本文进一步改进算法并通过仿真实验对其收敛性进行证明.     

Robust power allocation algorithm for analog network coding with imperfect CSI

Power allocation promises significant benefits in wireless networks. However, these benefits depend on knowledge of the channel state information （CSI）, which is hardly perfect. Therefore, robust algorithms that take into account such CSI uncertainties play an important role in the design of practical systems. In this paper, we formulate the power allocation problem as the maximum individual outage probability minimization subject to total power consumption for analog network coding （ANC） protocol of a two-way relay system. We show that these problems can be cast as convex optimization problems. Non-robust power allocation algorithm is first developed under the ideal assumption of perfect CSI. Then we introduce robust optimization methodology that accounts for the imperfect CSI. We show that ignoring CSI uncertainties in our designs can lead to drastic performance degradation. On the other hand, the proposed robust power allocation provides significant performance gain over non-robust power allocation and uniform power allocation in terms of overall system outage probability over a wide range of channel estimation errors. This work highlights the importance of the proposed robust algorithm in realistic two-way relaying networks.