可变频宽无线网络中信道频谱分配与链路调度

考虑信道频宽对链路传输距离和链路间干扰的影响,对可变频宽无线网络现有的累积干扰模型进行了改进,并基于改进的干扰模型对可变频宽无线网络的信道频谱分配和链路调度问题进行了建模分析。设计了一种两层优化算法对信道频谱分配和链路调度问题进行解耦,提出了一种考虑链路负载需求满足程度的链路优先级指标,启发式地构建并发传输信道分配矩阵的方法。仿真结果表明,两层优化算法能够在合理时间内收敛,启发式方法能够高效地构建并发传输信道分配矩阵。     

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

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

异构无线网状网分布式接口和信道联合分配的研究*

研究了无线网状网络中分布式分配信道时,接口异构对网络容量的影响。提出了一种新颖的以射频链路为信道分配对象的接口和信道联合分配ILP模型,给出了一种自适应于网络流量变化的分布式贪婪算法。该算法以射频链路为信道分配对象,基于2-hop干扰模型,以队列长度为权的射频链路吞吐量之和最大为目标,寻找自适应流量变化的分布式分配方案。分析发现,该算法与目前已有的非接口异构的Dist. Greedy算法的时间复杂度相当,仿真结果表明本算法下的网络性能有明显提升。     

干扰约束下的认知无线电传输链路自适应算法

针对干扰约束下的认知无线电传输链路自适应算法开展研究,基于OFDM的认知用户与主用户共存,认知用户在保证对主用户干扰容限的前提下执行子载波与功率分配,以树形分支贪婪算法为基础,引入功率余量因子和干扰余量因子并通过比较余量因子相对大小来选择子载波,通过减小分支数以降低算法复杂度.仿真结果表明,改进的树形分支贪婪算法获得的...     

一种基于最小生成树的无线多跳网络信道分配算法

在无线多跳网络环境下,提出了一种信道分配算法,该算法可优先考虑最小生成树上的可用信道,为每个节点分配信道资源,然后考虑利用生成树外其他可用链路为节点提供信道资源,以提高吞吐量。该算法通过考虑每个用户的通信需求,可充分利用空闲信道资源。仿真结果显示,相比于不考虑最小生成树外链路时,本算法可有效地提高网络整体的吞吐量。     

基于粒子群优化的WDM全光网络的组播路由优化算法

WDM网络中,路由和波长分配是紧密联系的,其中波长分配是设计的难点。该文以瓶颈链路数与可用信道数的比值来反映选择波长对全网状态的影响,设计了一种基于粒子群算法（PSO）的对路由和波长的分配统一进行的优化算法。该算法在给定一组时延受限的组渡请求下,建立满足时延约束的最低代价组播路由树,并使该路由树的瓶颈链路数与可用信道数的比值较小。。计算机仿真表明该算法是有效性。     

城市车辆网络下一种基于道路划分的多信道分配算法

城市车辆网络下多信道分配问题是指在城市车辆网络中,每个节点配置多个网卡,如何调节每个网卡使其在可用的正交信道(如802.11a可用12个正交信道,802.11b/g可用3个正交信道)之间进行切换以充分利用多个信道而达到减少节点之间的干扰和提高网络吞吐量的问题.本文提出了一种适用于网络拓扑具有高度动态性的城市车辆网络的基于道路划分的多信道分配算法(mimc-road).该算法按照道路划分进行多信道分配,将一个二维网络多信道问题简化为以一维空间为主的多信道分配问题,并将基于动态网络链路的信道分配问题转化为基于静态道路的信道划分问题.模拟实验结果表明:对比传统单信道单网卡模式和fix-switch算法,mimc-road算法显著提高了车辆网络的性能.     

相继干扰消除的无线网络中的调度算法

相继干扰消除(successive interference cancellation,简称SIC)是一种多包接收技术,它从冲突信号中解码报文.SIC可有效减轻无线网络中的干扰.SIC的顺序解码特性给链路调度带来了新的挑战.提出并发图以刻画SIC导致的链路相关性.基于并发图,定义链路的干扰数并据此设计有效的调度机制.证明了基于并发图的链路调度是NP-hard的、而最大干扰数提供了极大贪婪算法的性能下界.在讨论了一类基于独立集的贪婪算法之后,结合干扰数对链路排序,给出了一种理论上性能更好的算法.仿真结果表明,仅需略高于现有模型的开销,与IEEE 802.11相比,新调度算法的性能提高可达110％.     

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

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

无线Mesh网络信道分配研究

针对多接口多信道无线Mesh网络,提出了一种基于链路负载和链路“潜在的”干扰度的权值的分布式静态信道分配算法。给出基于链路负载和链路“潜在的”干扰度的权值的定义和基于权值的链表的构建方法;阐述了算法的设计思想和实现步骤。仿真实验测试结果表明,该算法不但能适应业务流量分布均匀或不均匀的状态,而且能相应地提高网络吞吐量,提升网络性能。     

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网络的带宽容量问题,文章通过使用无线网络干扰协议模型对无线链路的干扰进行量化,利用整数线性规划公式对信道分配问题进行描述,在信道分配的时候,应用目标函数对无线链路的信道分配进行优化,使网络总的干扰权重最小化,在此基础上提出一个信道分配的启发式算法。仿真结果表明,文章提出的算法能提高网络的吞吐量。     

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.     

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.     

Distributed channel assignment algorithms for 802.11n WLANs with heterogeneous clients

As the latest IEEE 802.11 standard, 802.11n applies several new technologies, such as multiple input multiple output (MIMO), channel bonding, and frame aggregation to greatly improve the rate, range and reliability of wireless local area networks (WLANs). In 802.11n WLANs, access points (APs) are often densely deployed to provide satisfactory coverage. Thus nearby APs should operate at non-overlapping channels to avoid mutual interference. It is challenging to assign channels in legacy 802.11a/b/g WLANs due to the limited number of channels. Channel assignment becomes more complex in 802.11n WLANs, as the channel bonding in 802.11n allows WLAN stations (APs and clients) to combine two adjacent, non-overlapping 20MHz channels together for transmission. On the other hand, IEEE 802.11n is backward compatible, such that 802.11n clients will coexist with legacy clients in 802.11n WLANs. Legacy clients may affect the performance of nearby 802.11n clients, and reduce the effectiveness of channel bonding. Based on these observations, in this paper, we study channel assignment in 802.11n WLANs with heterogeneous clients. We first present the network model, interference model, and throughput estimation model to estimate the throughput of each client. We then formulate the channel assignment problem into an optimization problem, with the objective of maximizing overall network throughput. Since the problem is NP-hard, we give a distributed channel assignment algorithm based on the throughput estimation model. We then present another channel assignment algorithm with lower complexity, and aim at minimizing interference experienced by high-rate, 802.11n clients. We have carried out extensive simulations to evaluate the proposed algorithms. Simulation results show that our algorithms can significantly improve the network throughput of 802.11n WLANs, compared with other channel assignment algorithms.     

下含D2D蜂窝网基于有向加权二部图的资源分配

针对蜂窝下含D2D系统最多允许一条蜂窝链路和一条D2D对链路同时共占信道的场景,旨在设计一种低复杂度的资源分配算法。首先将以最大化系统吞吐量为目标的资源分配问题归结为整数规划问题。考虑到干扰是决定两条链路能否共占信道的关键因素,将最优化问题转化为以最小化干扰链路信道增益为目标的问题;该问题可看作一对一双偏好最优匹配问题,为此,首次提出有向加权二部图的相关概念,并用它对最优化问题建模。为了降低寻找最优匹配的难度,提出一种贪婪算法,该算法复杂度仅为O(n)。仿真表明,与加权二部图算法相比,所提算法不仅在复杂度方面下降两个数量级,而且在一定范围内得到的系统吞吐量与容量等性能比加权二部图算法略优。     

Efficiently solving general weapon-target assignment problem by genetic algorithms with greedy eugenics

A general weapon-target assignment (WTA) problem is to find a proper assignment of weapons to targets with the objective of minimizing the expected damage of own-force asset. Genetic algorithms (GAs) are widely used for solving complicated optimization problems, such as WTA problems. In this paper, a novel GA with greedy eugenics is proposed. Eugenics is a process of improving the quality of offspring. The proposed algorithm is to enhance the performance of GAs by introducing a greedy reformation scheme so as to have locally optimal offspring. This algorithm is successfully applied to general WTA problems. From our simulations for those tested problems, the proposed algorithm has the best performance when compared to other existing search algorithms.     

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

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

基于初始化AP的自适应信道分配算法

在高密度AP部署的网络环境中,由于ISM频带只有1、6和11三个正交信道,因此AP的工作信道不可避免的存在重叠,其重叠信道干扰对吞吐量有较大的影响。文中从基于AP上线时为其分配信道的角度出发,提出了一种集中式自适应信道分配算法DNAF（ Densest Nearest Assignment First）。在大量AP刚上线时,通过周期性广播扩展信标帧,建立动态的网络拓扑结构图,并通过AC为其进行优化信道分配。通过对信道分配算法的大量实验及仿真,结果表明,在高密度且AP邻居分布不均匀的网络环境下,与启发式算法NOFA-1及随机信道分配算法相比,该算法能有效地减小邻居间干扰,从而达到提高网络吞吐量的目的。