无线传感器网络通信性能确定上界研究

无线传感器网络一般具有实时性,其端到端通信性能上界研究具有重要意义.基于确定性网络演算理论,对无线传感器网络为保证实时数据优先的数据转发调度策略进行了性能分析与评价.建立了基于确定性网络演算的端到端通信性能分析模型,经过理论分析得到了无线传感器网络节点的数据队列上界、端到端数据流的延迟上界以及端到端数据流的延迟抖动上界.仿真结果表明基于网络演算理论的无线传感器网络性能上界均在理论计算的上界范围之内.本文的研究使得对无线传感器网络通信性能的研究更符合完备性的要求.     

无线Mesh网络中VOIP的QoS性能分析

针对VoIP(Voice over IP)业务在无线Mesh网上进行传输时存在服务质量(QoS)需求难以保证、带宽利用率低的问题,介绍了VoIP的QoS影响因素,分析了端到端时延、时延抖动和丢包率等几个重要参数,并对VoIP在无线Mesh网中的传输性能进行了论述。提出了基于无线Mesh网络的QoS保证机制,可以为端到端的数据传输公平的分配带宽,并能在保证QoS下实现大规模的实时任务的多跳转发。仿真试验表明能有效降低端到端时延,有着更好的QoS性能。     

基于统计网络演算的融合网络网关节点时延性能研究

为分析融合网络网关节点统计时延性能,根据最小加代数理论中的统计网络演算的相关知识,提出了一种基于改进的GPS调度系统模型,然后利用网络演算理论求解出网关节点统计时延上界。数值结果分析表明,改进的调度模型有效地改善了自相似特性对网关延迟上界所造成的影响,与未改进的模型相比,网关统计延迟上界更具有良好的紧致性,为下一步由单节点扩展到端到端节点延迟上界研究提供了参考。     

基于SP调度策略的簇树型无线传感网络QoS上界研究

为了改善无线传感网络在最坏条件下的网络服务质量（Quality of Service, QoS）,本文将严格优先级（Strict Priority, SP）队列调度引入簇树型无线传感网络中,分析SP队列调度对网络中数据流获得的保证服务的影响,并利用网络演算推导簇树网络中各深度路由节点的时延上界、缓存上界及网络的端到端时延上界。通过实例分析,表明SP队列调度能够有效减小网络的最大端到端时延。     

基于随机网络演算的无线传感器网络延时研究

基于随机网络演算研究了无线传感器网络中延时相关问题,通过随机网络演算建立随机到达曲线和随机服务曲线模型,推导出单个节点和端到端的延时统计界.与节点到节点计算方法的延时界相比,演算方法更为简单.另外,随机延时界比确定性延时界具有更好的包络性,给出了违背界的函数.数值结果表明,运用SNC的卷积公式求得的概率统计型延时边界的结论具有更严格包络性,对无线传感器网络配置和QoS控制具有较强参考意义.     

基于网络编码的无线传感器网络QoS性能分析

针对无线传感器网络中实时网络应用严格的服务质量（QoS）保证要求,本文提出基于网络编码的支持QoS的无线传感器网络模型。该模型将网络编码的特性应用到区分服务(Differented Service,DiffServ)机制中,编码节点将DiffServ分类得到的同类数据流进行编码组合再发送,减少需要转发的数据量,从而提升了网络的性能。利用随机网络演算理论工具分析得到模型的QoS性能,通过数值分析,所提出的模型能够有效提升基于区分服务的无线传感器网络的延时、积压等性能。     

基于网络演算的簇树WSN性能上界分析

为保证WSN的服务质量(QoS),需精确求解其性能上界。对进入WSN节点的数据流进行漏桶管制,节点为数据流提供基于速率-延迟模型的服务保障,在已有簇状拓扑WSN性能模型研究基础上,利用确定性网络演算理论推导簇树WSN节点的有效带宽、缓冲区队列长度上界和数据流端到端延迟上界。     

基于网络演算的无线Mesh网时延上界

无线Mesh网是一种新型宽带接入通信网络，端到端时延上界分析的准确性会直接影响网络的QoS保障。针对无线Mesh网传统时延边界分析方法没有考虑当前节点处理时延对后一个节点到达曲线的影响，造成时延上界计算不紧致的问题，利用(ρ,σ)模型作为数据流到达曲线，延迟-速率函数LR作为数据流服务曲线，同时考虑前一个节点的处理时延对后一个节点到达曲线的影响，推导出无线Mesh网中单节点、单路径和多路径传输时延上界，并利用数值分析方法得到网络服务速率、流量分配方式、多路径数目等因素对时延上界的影响。仿真结果表明，与传统方法相比，以上计算得到的无线Mesh网时延上界更接近实际仿真值。     

一种有效的无线Mesh网络流量整形模型

流量整形对QoS(quality of service)控制有着重要的影响.研究并分析发现,无线Mesh网络具有自相似性,其自相似性对网路的QoS性能具有较大的影响.总结并优化了最近几年发展起来的能够深刻透视计算机网络业务流控制问题的网络演算技术,分析发现统计网络演算可以用来计算性能的概率或统计边界问题,适合于无线Mesh网络.运用统计网络演算建立了无线Mesh网络自相似业务流的贪婪分形整形器的数学模型;推导了贪婪分形整形器的统计性能模型.包括整形器的输出特性、队列长度与延迟等性能;数据分析证明贪婪分形整形器对无线Mesh网络自相似业务进行整形不会增加网络端到端延迟和缓冲区容量需求.     

基于指数上鞅的统计端到端时延分析

借助有效的端到端时延分析可实现大规模网络的QoS控制,运用统计网络演算理论中最小加代数的卷积运算规则计算端到端时延界日益引起人们的重视.随着网络规模的不断扩大,统计端到端时延界应同时具有良好的可扩展性和一定的紧致性,而目前满足这一要求的理论成果还比较少.通过结合最小加代数的卷积运算规则和Doob不等式,并采用矩母函数(Moment Generating Function,MGF)对到达曲线和服务曲线进行描述,文中给出了一种基于指数上鞅的端到端时延界表达式.该时延界不仅可以线性扩展,而且数值分析结果表明,在相同假设条件下,该时延界比现有的线性时延界具有更好的紧致性.     

多媒体无线Mesh网基于机会路由的网络编码

采用机会路由下无线Mesh网络的链路吞吐量模型,利用确定性网络演算工具,得到无线Mesh网络节点数据积压的上界以及端到端数据流延迟和抖动的上界;然后设计满足多媒体服务质量的确定性网络编码（DNC）,提出ETC作为确定机会路由中编码节点的指标,在节点数据积压未达到上界时,编码节点采用线性网络编码,提高网络的性能;提出ETP作为机会路由中选择候选节点的指标,主要考虑端到端的延迟和延迟抖动确定接收数据的候选集。仿真结果表明可以达到较好的效果。     

Video streaming application over WEAC protocol in MANET

Performance of wireless networks under video traffic is subjected to two main issues: power minimization and other QoS requirements such as delay jitter. Mobile Ad Hoc Networks (MANETs) are more sensitive to these issues where each mobile device acts like a router. Thus, routing delay adds significantly to overall end-to-end delay. This paper analyzes the performance of the Warning Energy Aware Clusterhead/Virtual Base Station-On demand (WEAC/VBS-O) protocol in terms of average delay, multi-hop communication and power minimization aspects that are subject to video traffic. H.263 and H.264 standards are utilized to model the simulated network. HCB model is also utilized to minimize the power consumption. The simulation results are demonstrated on a single hop and multi-hop settings. This includes the power consumption and the effect of sudden demise of cluster heads in the Warning Energy Aware Cluster head (WEAC) protocol.     

End-to-end delay estimation for multi-hop wireless networks with random access policy

End-to-end delay analysis is an important element of network performance analysis in multi-hop wireless networks.In this paper,we propose an analytical model for estimating the end-to-end delay performance of wireless networks employing a random access policy for managing node’transmissions on shared channels with time-varying capacity.To obtain the closed form expression,a new concept of residual effective capacity is presented using the definitions of effective bandwidth theory and effective capacity theory.This allows us to calculate the cumulative distribution function of the queuing delay.Based on this concept,we derive a formula to calculate the average end-to-end delay for multi-hop wireless networks,with the result including the effect of a random access protocol,which has not previously been considered.Finally,we validate our analysis through simulations and provide an example application for our results.     

无线多跳网络的延迟性能分析

多跳无线网络技术具有广阔的应用前景。研究如何精确地分析、预知和保证多跳无线通信路线的端到端延迟性能非常重要。通过引入一个延迟违约概率的下限,扩展链路层等效带宽模型,并在不同的信道服务速率和无线信道条件下进行模拟。分析和仿真发现,与信道服务速率相比,最大多普勒频移对多跳延迟性能的影响更大。     

Providing traffic smoothness and service guarantees within ATM networks through a rate-controlled service discipline

With the introduction of diverse rate requirements under a variety of statistical multiplexing schemes, traffic burstiness behavior of a source stream and its quality-of-service (QoS) performances within the ATM networks become difficult to model and analyze. In this paper, we address this issue and propose a rate-controlled service discipline that provides control of the traffic burstiness while maintaining QoS guarantees for traffic flows with various rate requirements. According to our analysis, traffic streams from different connections can be well regulated at the output of each network node based on their rate requirements. Traffic envelope and the associated burstiness behavior inside the network can thus be effectively characterized. In addition, by assuming a leaky-bucket constrained input source, we prove that the proposed scheme can provide end-to-end delay and jitter bounds for each connection passing through a multi-hop network. Further, due to the low traffic burstiness, only a small buffer space is required at the internal switches for guaranteeing QoS requirements.     

Resource allocation and admission control for the provisioning of quality of service in networks of static priority schedulers

This paper, proposes an analytical method for the resource allocation and admission control of traffic flows with statistical Quality-of-Service (QoS) guarantees in a Static Priority service discipline, in the case of both isolated nodes and end-to-end paths comprising multiple schedulers. The statistical QoS targets for each service class are expressed in terms of a delay bound and delay violation probability. Moreover, we assume that traffic admits a linear variance envelope; therefore, the method accounts for Leaky-Bucket-regulated traffic, for general Markov-Modulated Poisson Process sources and Markov-Modulated Fluid Process sources and, in general, to the wide class of sources for which the variance of the cumulative generated traffic can be upper bounded by a linear function of time. Under these assumptions, the resource allocation problem is solved analytically by deriving the closed-form expression of the minimum capacity to be allocated in the network in order to guarantee concurrently the QoS of all traffic flows across all service priorities. Moreover, the closed-form analytical solution of the admission control problem is obtained by deriving the expression of the maximum number of flows that is possible to accept, in all priority levels, knowing the link capacity, with differentiated statistical QoS constraints on delay for each priority level. Furthermore, by exploiting the bounded-variance network calculus, a novel framework for the calculation of statistical end-to-end delay bounds, we iterate our formulas, derived for the isolated node, to multi-node paths and, in turn, we provide analytical closed forms for the performance evaluation of end-to-end delay.     

LTE-A飞蜂窝网络自相似业务流的端到端时延边界分析

LTE-A是一种4G移动通信标准,可满足移动数据业务对传输带宽的要求。为解决移动通信网络中室内信号质量较差的问题,LTE-A标准采用飞蜂窝技术作为室内无线接入解决方案。针对LTE-A飞蜂窝网络的时延边界问题,运用随机网络演算方法分析业务流的自相似性质和MIMO信道的时变特性,构建了LTE-A飞蜂窝网络中自相似业务流的随机到达与随机服务模型。围绕所构建的到达与服务模型,运用有效带宽理论和chernoff界方法,给出了自相似业务流的端到端时延边界。NS3仿真验证表明,在信道带宽和业务流优先级等指标不同的情形下,所给出的理论端到端时延边界与仿真时延的偏差在2ms以内,较为准确有效,可为确保LTE-A飞蜂窝网络的服务质量提供依据。     

Analysis of total average queue length in multi-hop wireless networks

In upcoming communication environments, multi-hop networking is expected to be pervasive in wireless access and backbone networks because it promises large coverage and increased capacity. Many studies have been devoted to the throughput of multi-hop wireless networks, but the delay performance is not clearly investigated yet. In this Letter, we analyze a multi-hop wireless network to obtain a lower bound of the total average queue length since it is closely related to the delay. We first consider a network with single hop sessions only, and its total average queue length is characterized as a solution of a linear program. Then we present a novel idea of translating a network with multi-hop sessions into a network with single hop sessions only, thereby the linear programming approach can be applied again. Simulation results show that the lower bound is very close to the achievable value of our reference link scheduler. Hence, our bound is tight.     

存在隐藏终端的IEEE 802.11e多跳无线网络模型分析*

首次将802.11e的接入机制放入多跳环境中进行仿真分析和定量研究。提出一种新的多跳环境下802.11e网络模型,结合M/G/1/K排队模型,定量分析在隐藏终端影响下802.11e网络的MAC层吞吐率、MAC时延和帧丢失率,研究802.11e在多跳环境下性能表现的内在原因。经过仿真实验结果与数值分析结果的对比,验证了分析模型的准确性;通过有（无）隐藏终端影响下MAC层性能的对比分析,指出了802.11e在多跳无线网络中支持QoS的局限性：受隐藏终端的影响,802.11e对不同接入等级的业务提供QoS区分的性能明显降级。因而有必要研究隐藏终端问题的解决方案,提高802.11e在多跳环境下的性能。