基于蚁群算法和BP神经网络的信道分配策略的研究

研究无线传感器网络信道分配策略的主要目标是提高网络吞吐量和容量,减小网络的传输时延,最大限度的利用有限的网络带宽资源。多信道MAC协议的应用,可以有效地提高网络通信的可靠性和吞吐量,以及解决由于信道受干扰而造成的网络瘫痪等问题。根据无线传感器网络多信道的特点提出了一种基于蚁群算法的动态反馈负载均衡信道分配策略。本策略首先应用BP神经网络对信道负载情况进行预测,然后通过基于蚁群算法的负载均衡算法对信道进行筛选,最后利用最大离散化算法进行信道分配。在NS2平台下对所设计的协议进行了仿真实现,并与应用最为广泛的多信道MMAC协议以及SMAC进行了对比分析。根据仿真结果可知,本文设计的MAC协议在网络吞吐量、网络传输时延等性能方面比MMAC协议及SMAC都有了很大程度的提升。可以有效减小网络传输时延,提高网络吞吐量和抗干扰能力。     

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

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

无线Mesh网络中一种分布式路由方案

在多射频多信道无线Mesh网络中,链路负载和节点位置的变化将导致网络性能的下降。针对此问题,在混合无线网状路由协议反应式路由基础上,设计了一种新的混合信道分配的分布式路由算法。该算法在路由建立的同时可实现以数据流为单位的最优信道分配,且能避免因单节点失效导致整个网络崩溃的危险。仿真结果表明,提出的RHCA算法较传统算法在网络吞吐量和端到端平均时延方面均有显著优势。另外,在节点移动场景下,所提出的分布式路由算法较其他方法能获得更高的吞吐量和更好的稳健性。     

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

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

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

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

基于容量与干扰的CogWMN信道分配和路由算法

为解决认知无线mesh网络中的信道干扰问题,提出了一种基于容量与干扰的分布式信道分配和路由算法.首先根据路由度量有效地选择最低累积代价路由,再根据信道干扰容量比最小化来选择信道.仿真结果表明:所提算法与基于干扰、基于链接的算法相比,能够显著改善平均吞吐量和时延等网络参数性能.     

一种改进的基于最少信道切换的路由算法

在Ad Hoc网络中,如何基于多信道有效地利用网络中的频谱资源,提高网络的性能,已经成为近几年来研究的热点。在DSDV路由协议的基础上,提出了一种基于减少网络中的信道切换的路由算法——OLCH-DSDV,该算法采用最小切换时延的信道分配策略,尽量减少信道切换产生的时延,从而降低了网络时延,提高了吞吐量。该算法要求源节点通过自身维护的路由和信道使用信息,选择到达目的节点的最优路径,也就是需要最少信道切换的路径。仿真结果表明该路由改进算法在有效提高系统吞吐量的同时,也有效地减少了网络中的传输时延。     

无线Mesh网络联合信道分配和路由协议研究

设计合理的联合信道分配和路由协议对多信道无线Mesh网络的性能至关重要。在分析多网卡多信道无线Mesh网络中联合信道分配和路由协议特点和研究现状的基础上,提出了一种与按需路由协议结合的联合信道分配算法,通过选择最小干扰信道来优化信道分配;同时采用了一种适应多信道多网卡网络的路由判据方法,该方法考虑了信道干扰、接口切换以及路径跳数三个关键因素。仿真结果表明,文中所采用的协议能较为明显地提高网络吞吐量及减小分组的端到端时延。     

Multi-Radio Multi-Channel无线传感器网络中信道分配和路由策略

针对无线传感器网络中传输时延长、传输冲突大和吞吐量低等问题,提出了一种在Multi-Radio Multi-Channel无线传感器网络中信道分配和路由策略.该策略动态地建立k元n立方体拓扑结构,使用优化的静态信道分配算法提高节点的吞吐量,使用维序寻径的路由算法减少传输冲突.该方法适用于网络节点稠密、节点相互之间通信冲突大的情况,并且在单跳和多跳的网络环境下均适用.实验结果表明,基于k元n立方体这一拓扑结构的信道分配和路由策略与传统方法相比,有效地减少了端到端时延,降低了网络冲突,减少了节点能量消耗,延长了网络寿命,提高了网络吞吐量.     

基于CSM优先级的CogWMN联合路由与信道分配策略

认知无线Mesh网络(CogWMN)中的节点可以自主切换通信频率。当节点寻找路由和分配信道时,容易出现信道分配的不均衡化。为了提高非授权频段的利用率,发挥多信道并行传输的优势,提出一种在没有全局控制信道条件下的基于信道统计度量(CSM)优先级的联合路由与信道分配策略,以解决信道分配不均衡化问题,使网络内节点能以较少的跳数接入AP。仿真结果表明,所提策略能提高网络吞吐量和减少网络时延。     

5G动态异构场景下无线回程优化算法

为解决面向5G动态异构场景的无线回程问题,提出一种考虑时延抖动的无线回程优化算法。对5G动态异构场景下的时延和时延抖动问题进行了系统的分析,建立了优化指标,进一步构建了基本回程模型。在此基础上,考虑时延优化需求,引入时延约束构建改进模型1;考虑网络超载情况,松弛信道个数分配变量构建改进模型2,进而提出相应分层算法进行快速求解。仿真结果表明,与三类已有无线回程优化算法相比,所提算法具有更优的时延抖动性能。     

一种基于信源信道联合的最优速率分配算法

针对视频数据在无线信道上可靠传输问题,提出了一种基于信源信道联合的最优速率分配算法。该算法在网络带宽一定的情况下,从信源、信道及差错弹性能力权衡考虑,引入了信源解码器的抗误码性能指标,根据不同的信道状态确定信源信道编码的最优速率分配方案,从而获得最大的可解码长度,并最终获取最佳重建视频质量。仿真结果表明,该方案与传统的联合信源信道速率分配算法相比可获得更高的性能增益,适合于视频数据在无线网络上传输。     

Congestion-aware channel assignment for multi-channel wireless mesh networks

In this paper, we propose a distributed congestion-aware channel assignment (DCACA) algorithm for multi-channel wireless mesh networks (MC–WMNs). The frequency channels are assigned according to the congestion measures which indicate the congestion status at each link. Depending on the selected congestion measure (e.g., queueing delay, packet loss probability, and differential backlog), various design objectives can be achieved. Our proposed distributed algorithm is simple to implement as it only requires each node to perform a local search. Unlike most of the previous channel assignment schemes, our proposed algorithm assigns not only the non-overlapped (i.e., orthogonal) frequency channels, but also the partially-overlapped channels. In this regard, we introduce the channel overlapping and mutual interference matrices which model the frequency overlapping among different channels. Simulation results show that in the presence of elastic traffic (e.g., TCP Vegas or TCP Reno) sources, our proposed DCACA algorithm increases the aggregate throughput and also decreases the average packet round-trip compared with the previously proposed Load-Aware channel assignment algorithm. Furthermore, in a congested IEEE 802.11b network setting, compared with the use of three non-overlapped channels, the aggregate network throughput can further be increased by 25% and the average round-trip time can be reduced by more than one half when all the 11 partially-overlapped channels are used.     

超密集网络中基于多基站博弈均衡的分布式无线资源管理算法

移动边缘计算和超密集网络技术在扩大移动设备计算能力和增加网络容量方面有明显的优势.然而,在两者融合的场景下,如何有效降低基站之间的同信道干扰,减少任务传输的时延和能耗是一个重要研究课题.本文设计了一个基于多基站博弈均衡的分布式无线资源管理算法.将小基站之间的无线资源管理问题转化为博弈问题,提出一种基于奖励驱动的策略选择算法.基站通过迭代不断更新其策略的选择概率,最终优化子信道分配和发射功率的调控.仿真结果表明,我们的算法在提高信道利用率和降低任务处理的时延和能耗方面具有优势.     

认知无线Mesh 网络中QoS 约束的组播路由算法

对认知无线Mesh网络中满足QoS约束的联合组播路由及频谱分配问题进行研究,提出了一个针对该问题的求解框架,包括问题描述、解决方案的表示、适应度函数以及频谱分配算法.基于两种具有代表性的智能计算方法:遗传算法、模拟退火,提出了两种满足端到端延迟约束的组播路由及频谱分配算法GA-MRSA和SA-MRSA.这两种算法追求的目标是最小化组播树信道冲突总数,并且在获得较低的信道冲突数的情况下,还能占用较少的信道.仿真结果表明,所提出的两种算法能够达到预期目标,获得较低的信道冲突总数.     

On the end-to-end flow allocation and channel assignment in multi-channel multi-radio wireless mesh networks with partially overlapped channels

The performance of wireless mesh networks (WMNs) can be improved significantly with the increase in number of channels and radios. Despite the availability of multiple channels in several of the current wireless standards, only a small fraction of them are non-overlapping and many channels are partially overlapped. In this paper, we formulate the joint channel assignment and flow allocation problem for multi-channel multi-radio WMNs as a Mixed Integer Linear Program (MILP). Unlike most of the previous studies, we consider the case when both non-overlapped and partially overlapped channels are being used. We consider an objective of maximizing aggregate end-to-end throughput and minimizing queueing delay in the network, instead of the sum of link capacities, since the traffic characteristics of a multi-hop WMN are quite different from a single hop wireless network. Our static channel assignment algorithm incorporates network traffic information, i.e., it is load aware. Our formulation takes into consideration several important network parameters such as the transmission power of each node, path loss information, the signal to interference plus noise ratio at a node, and the frequency response of the filters used in the transmitter and receiver. We show by simulations that our MILP formulation makes efficient use of the spectrum, by providing superior channel assignments and flow allocations with the addition of partially overlapped channels, without the use of any additional spectrum. We also justify the need to consider alternative objective functions such as, minimizing average queueing in the network. We also propose a polynomially bounded heuristic algorithm to scale the proposed algorithm to bigger network topologies.     

A hybrid channel allocation algorithm with priority to handoff calls in mobile cellular networks

This paper proposes and investigates a novel analytical model of a hybrid channel allocation algorithm within wireless cellular networks. Each cell of the network consists of a predesigned fixed number of channels and the network may approve the request for extra channels for both new and handoff calls if all predesigned channels are occupied. This approval depends on the types of new and handoff calls, as well as the number of approved additional channels in the cell. If a request is denied for the arriving new call, this call will be blocked and cleared from the system. However, if a request is denied for an arriving handoff call, this call will not be blocked immediately but rather put on hold in a buffer with finite space. The implication behind this is to give priority to handoff calls. For this proposed hybrid channel allocation scheme, we first obtain the stationary distribution of each cell when there are i calls connecting to the system and j calls holding on in the buffer. We then derive new and handoff call blocking probabilities, the average number of borrowed channels, and the average delay period of handoff calls. The numerical results show that the proposed hybrid algorithm is more efficient than other approaches, specifically, in comparison with methods without a borrowing capability for new calls and those without a reserved buffer priority for handoff calls. The idea and results presented in this paper are expected to provide guidelines for field data processing within current wireless and mobile network design and performance evaluation.