同步无线Mesh网络数据包连发技术研究

现有的基于多方向天线阵列的同步无线Mesh网络在一个数据时隙内只发送一个数据包,这在发送节点采用高调制速率发送数据包时会造成时隙利用率的下降。针对该问题,对该网络下的数据包连发技术进行了研究,给出了最多可连发的数据包个数与计算时机、序列号与确认机制、涉及到的参量、父子节点处理流程的详细设计方案。理论性能对比结果表明,在发送节点采用高调制速率发送数据包时,在该网络下采用数据包连发技术能够大幅度提高时隙利用率,网络性能明显提升。     

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

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

无线Mesh网络集中式信道分配算法设计

以集中式无线Mesh网络(WMN)为基础,分析和研究了传统多信道分配算法,并在此基础上提出了以节点优先级和分组为特点的多接口多信道分配算法(Channel Assignment based on Rank of Node and Link group,CAR-NL),该算法结合节点分级和链路负载预期评估机制,通过节点链路分组按级分配信道。通过仿真实验表明,该算法能有效提高无线Mesh网络多业务流并发执行时系统整体吞吐量,并实现较低的丢包率。     

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

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

无线Mesh网络可用带宽估计方法的研究

提出一个适用于无线Mesh网络的可用带宽估计(MPEAB)方法.该方法根据无线Mesh网络的结构特点,利用信号在传播过程中会发生衰落、导致信号容量减小的特征,建立信道容量与发送功率和接收功率在理想通信系统中的数量关系,估计出无线Mesh网络节点信道容量,从而进一步提高可用带宽估计算法在无线Mesh网络中的精确度.NS2实验结果表明,MPEAB方法估计的结果更接近真实的可用带宽.     

无线 Mesh 网络部分重叠信道分配综述

无线Mesh网络面临的主要挑战是由共信道干扰导致的网络容量下降问题,仔细规划部分重叠信道的使用能减少甚至消除共信道干扰。在介绍部分重叠信道基本概念的基础上,重点从单播和多播2个角度对国内外部分重叠信道分配研究领域的成果进行了分类总结与分析;深入剖析部分重叠信道分配中的难点与挑战,并展望了未来的研究方向,以期促进无线Mesh网络向“最后一公里”接入的理想解决方案演进。     

改进无线Mesh网系统的时间同步技术研究

本文针对面向ITS应用无线Mesh网络分布式多址接入对时间同步的要求,以及实际应用环境对网络同步的制约因素,通过对已有时间同步机制与技术的分析对比,具体研究在缺乏网络外部高精度同步时钟支持条件下,基于物理层参数解析的分布式WMN全网时间同步方法,给出了改进的无线MESH网网络节点时间同步方案,并就方案性能进行了仿真研究。     

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

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

基于穷举搜索的无线Mesh网络分配信道可行性研究

信道分配问题在多天线无线Mesh网络中已被各种文献证明是NP难问题。分析了一般的信道分配问题的复杂性与某些基本和常见的属性。结果表明,不同信道分配数量的复杂度和无线链路的数量呈指数关系。此外,估计了通过穷举搜索确定最优信道分配的理论运行时间,并通过实验验证。实验表明,给予一定的计算能力(如一个现成的笔记本电脑),在小规模和中等规模的商业无线Mesh网络中,对于最优解决信道分配问题是可行的。     

基于无线Mesh网络技术构建无线城市

无线Mesh网络(WMN)可以和多种无线网络系统,如无线局域网(WLAN)、无线城域网(WMAN)等相结合,改善无线网络的性能,提高网络的覆盖范围.以WMN网络技术在IEEE 802系列标准中的发展为基础,提出了一种无线城市的覆盖方案,最底层网络覆盖采用WiFi+wireless Mesh技术,WiMAX网络与WiFi...     

Cross‐layer bandwidth and power allocation for a two‐hop link in wireless mesh network

In this paper, a cross‐layer analytical framework is proposed to analyze the throughput and packet delay of a two‐hop wireless link in wireless mesh network (WMN). It considers the adaptive modulation and coding (AMC) process in physical layer and the traffic queuing process in upper layers, taking into account the traffic distribution changes at the output node of each link due to the AMC process therein. Firstly, we model the wireless fading channel and the corresponding AMC process as a finite state Markov chain (FSMC) serving system. Then, a method is proposed to calculate the steady‐state output traffic of each node. Based on this, we derive a modified queuing FSMC model for the relay to gateway link, which consists of a relayed non‐Poisson traffic and an originated Poisson traffic, thus to evaluate the throughput at the mesh gateway. This analytical framework is verified by numerical simulations, and is easy to extend to multi‐hop links. Furthermore, based on the above proposed cross‐layer framework, we consider the problem of optimal power and bandwidth allocation for QoS‐guaranteed services in a two‐hop wireless link, where the total power and bandwidth resources are both sum‐constrained. Secondly, the practical optimal power allocation algorithm and optimal bandwidth allocation algorithm are presented separately. Then, the problem of joint power and bandwidth allocation is analyzed and an iterative algorithm is proposed to solve the problem in a simple way. Finally, numerical simulations are given to evaluate their performances. Copyright © 2008 John Wiley & Sons, Ltd.     

EPON中一种动态带宽分配算法

以太无源光网络(EPON)被认为是下一代宽带接入的最有效的解决方案。文章提出了一种新的基于EOPN提供多种服务的动态带宽分配算法。为了能够应用这种算法还给出了协助带宽分配多点控制协议(MPCP)的控制消息的格式。     

Layered bandwidth allocation algorithm for multi-service in orthogonal frequency division multiplexing passive optical network

Due to the superiority in large bandwidth capacity and flexible resource allocation,orthogonal frequency division multiplexing passive optical network (OFDM-PON) has been recognized as one of the promising candidates for the next generation PON.There are many research works on the system architecture design of OFDM-PON.However,most of these works focused on the techniques of physical structure and signal transmission and less addressed the bandwidth allocation algorithms supporting the new types of system architecture.The bandwidth allocation in OFDM-PON,which is one of the key techniques to enable the access of multi-service,refers to the joint optimization of multi-dimensional resources in time domain,frequency domain and bits.A layered bandwidth allocation algorithm was proposed for multi-service in the enhanced system architecture of OFDM-PON,aiming at the efficient bandwidth resource utilization.Simulation results prove that the proposed bandwidth allocation algorithm outperforms the conventional algorithms without layered transmission significantly in terms of resource utilization and packet delay.     

一种公平的EPON动态带宽分配算法

提出一种EPON上行链路动态带宽分配算法一周期比例DBA。ONU基于多门限周期地上报带宽请求，OLT根据ONU的带宽请求及其合约带宽进行动态带宽分配。当多个ONU竞争系统带宽时，OLT按照ONU合约带宽的比例进行带宽分配。仿真结果表明：周期比例DBA算法在实现高带宽利用率的同时又具有良好的公平性。     

EPON中节能动态带宽分配算法

结合光网络单元(ONU)休眠控制和动态带宽分配机制,提出一种节能的双向DBA算法。该算法根据上/下行业务量为每个ONU分配合适的上/下行授权带宽,保证每个ONU在上/下行方向都具有较低的传输时延,同时尽可能增加ONU的休眠时间来降低网络能耗。仿真结果表明,与已有算法相比,该算法具有较低的上/下行平均时延,并能减少ONU的能耗。     

支持QoS的多链路最少变换动态带宽分配算法

提出一种支持QoS的多链路最少变换动态带宽分配方法（MCDBA）,该方法实现了支持不同的QoS等级,量化了带宽分配的大小,在满足一定QoS限制的条件下最小化带宽分配变换次数。仿真结果验证了MCDBA能有效地减少数据分组的时延和提高系统的带宽利用率,MCDBA可用于解决大规模网络链路接入的复杂QoS控制的实际问题。     

A survey of dynamic bandwidth allocation algorithms for Ethernet Passive Optical Networks

Ethernet Passive Optical Network (EPON) has been widely considered as a promising technology for implementing the FTTx solutions to the “last mile” bandwidth bottleneck problem. Bandwidth allocation is one of the critical issues in the design of EPON systems. In an EPON system, multiple optical network units (ONUs) share a common upstream channel for data transmission. To efficiently utilize the limited bandwidth of the upstream channel, an EPON system must dynamically allocate the upstream bandwidth among multiple ONUs based on the instantaneous bandwidth demands and quality of service requirements of end users. This paper introduces the fundamental concepts on EPONs, discusses the major issues related to bandwidth allocation in EPON systems, and presents a survey of the state-of-the-art dynamic bandwidth allocation (DBA) algorithms for EPONs.     

宽带接入控制中弹性业务的带宽资源分配研究

文章在宽带接入的范畴之内研究了宽带接入控制中弹性业务的一种带宽资源分布式分配方法,将网络运营商和用户建立为一个斯坦克尔伯格博弈模型(Stackelberg Game),网络运营商(Leader)设置带宽价格,用户(Follower)通过控制流量大小来对价格进行反映.文章论述了这种分布式决策与系统最优决策重合的理论依据,采用应用数学编程语言(AMPL)进行了仿真举例并分析了仿真结果.     

基于业务认知的多用户带宽分配方法

无线局域网的MAC协议难以兼顾多用户差别的业务需求和网络吞吐量的有效性。建立具有超帧结构的带宽分配模型和具有惩罚函数的优化目标,计算满足单用户QoS需求的最小带宽,进而提出基于业务认知的多用户带宽分配算法(TCBAA)。该算法优先满足用户QoS要求,其次最大化系统的吞吐量。理论和仿真实验显示:相比于固定分配机制和最大吞吐量分配机制,TCBAA能够在有限带宽下满足更多用户的QoS需求。     

Stackelberg game theoretic pricing algorithm for bandwidth allocation in cooperative access

Cooperative access among user devices by sharing wireless access bandwidth opens a new paradigm in heterogeneous networks.However,how to stimulate cooperative relay nodes forwarding service data for others and allocating corresponding bandwidth to support it are two key issues in the cooperative access.This paper proposes a Stackelberg game based framework which is benefit participants including relay nodes and client nodes.This framework generalizes the pricing based bandwidth allocation algorithm by the Stackelberg game model,which optimizes the profit of the cooperative relay nodes while guaranteeing the bandwidth requirements of client nodes.We transform the profit maximization problem into a convex problem and solve it using the convex optimization method.The simulation results demonstrate that the proposed framework and corresponding algorithms outperform the bidding weight proportional fairness and fixed value bandwidth allocation ones significantly.