无线Mesh网络MAC性能的博弈分析及优化

将博弈论用于IEEE802．11无线Mesh网络媒体接入控制协议的性能分析和优化。通过将节点间的信道竞争过程建模为非完全信息动态博弈,求解博弈的纳什均衡,即各节点的最优分组发送概率,并据此提出改进的DCF协议（G-MAC）：各节点首先通过监测信道,对当前博弈状态（竞争信道的节点数）进行估计;然后根据估计到的博弈状态调整其均衡策略（最小竞争窗口）;最后通过有限次动态博弈获得最佳系统性能。同时,提出了一种能准确估计博弈状态的虚拟帧发送机制（VDCF）,使空闲节点在转换为发送状态时可快速调整到均衡策略。仿真研究表明：G-MAC协议可以显著提高无线Mesh网络的系统吞吐量,降低延迟、延迟抖动和丢帧率。     

基于部分可观测马尔可夫决策过程的水声传感器网络介质访问控制协议

针对水声传感器网络低带宽、高延迟特性造成的空时不确定性以及网络状态不能充分观察的问题,提出一种基于部分可观测马尔可夫决策过程(POMDP)的水声传感器网络介质访问控制协议.该协议首先将每个传感器节点的链路质量和剩余能量划分为多个离散等级来表达节点的状态信息.此后,接收节点通过信道状态观测和接入动作的历史信息对信道的占用概率进行预测,从而得出发送节点的信道最优调度策略;发送节点按照该策略中的调度序列在各自所分配的时隙内依次与接收节点进行通信,传输数据包.通信完成后,相关节点根据网络转移概率的统计量估计下一个时隙的状态.仿真实验表明,与传统的水声传感器网络介质访问控制协议相比,基于POMDP的介质访问控制协议可以提高数据包传输成功率和网络吞吐量,并且降低网络的能量消耗.     

基于泊松分布的6LoWPAN网络节点能耗分析

针对6LoWPAN网络能耗优化问题,提出一种数据包到达速率服从泊松分布的信道接入机制:超帧活跃期内若没有数据发送或暂时无法发送的节点进入睡眠期以便节能,然后建立该机制的Markov模型。基于该模型,对节点睡眠态稳态概率、数据包服务时间和节点平均能耗进行数学分析,并研究λ和BO等协议参数对网络性能的影响。数学分析表明,改进模型较好地描述了6LoWPAN网络信道竞争过程,有效地降低了节点平均能耗。     

联合空时需求预留和功率控制的MAC协议

提出了一种应用于移动Ad Hoc网络中的联合空时预留和功率控制MAC协议.它通过对信道时间和空间资源预留更为精确的估计优化了可用的信道资源,提高了信道的空间利用率,降低了碰撞冲突的概率.因为物理层头部采用最低的速率进行传输,把这种时空估计信息嵌在物理层帧头部,可以把信息传播到更多更远的邻节点,减少了碰撞的概率.同时结合功率控制技术对数据包传输功率进行控制,降低了节点的能量消耗.通过仿真与IEEE 802.11 MAC协议进行比较,该协议提高了系统的吞吐量,移动节点功率消耗明显降低,节点的能量利用效率得到提高.     

基于802.11的无线Mesh网络可用带宽估计方法

可用带宽估计方法是提高网络QoS水平的关键技术.通过分析无线Mesh网络的特点与无线信号通信的特征,并建立信号信道容量与发送功率和接收功率在理想通信系统中的数量关系,建立了可用带宽与发送功率和接收功率的数量关系,提出了通过计算无线Mesh网络节点信号容量来估计无线Mesh网络链路可用带宽的方法,从而使得可用带宽估计方法在无线Mesh网络的估计结果更接近真实值.实验结果表明,该方法估计的结果更接近真实的可用带宽,在无线Mesh网络中的精确度要高于APEAB方法,可以为网络管理、流量控制和保证Qos提供参考.     

基于网络状态参数估计的主动队列管理PI改进算法

作为一种重要的主动队列管理手段,PI控制器算法通过积分嚣的引入有效地消除了队列长度控制的稳态误差,在提高网络吞吐的同时缩短了排队时延.但是PI控制器不能根据网络状态变化而自动调整控制参数,故当网络流量变化时PI控制器的收敛速度很慢.基于TCP-AQM系统模型,对经过中间节点的活动连接数、平均往返时间和前向链路容量等3个参数进行估计.通过计算击中概率的倒数,估计出活动流数;通过计算单位时间的数据包数,估计出网络容量;通过往返时延、活动流数、网络容量以及丢包概率在稳态时的关系式,估算出平均往返时延.在此基础上,提出了对网络状态变化自适应调整控制参数改进的快速收敛PI算法——FCPI算法.仿真结果表明,该算法有效提高了算法的收敛速度,并且鲁棒性好,易于实现,适用于未来高速网络的路由器.     

相关衰落信道下的安全协作系统及中断性能

基于相关的瑞利衰落信道,研究安全协作系统的安全中断性能。假定发送端知道全部信道的信道状态信息,系统中存在单个窃听节点以及多个进行协作的中继节点,某个中继节点被选择作为干扰者来发送干扰信号,合法信道与干扰节点到目的节点的信道相关,窃听信道与干扰节点到窃听节点的信道也相关。在此类协作场景中,分析了信道相关性对安全协作系统安全性能的影响,获得了安全中断概率表达式。数值结果表明信道相关对安全协作系统的安全性能存在显著影响。     

时隙ALOHA系统稳定性分析*

研究了基于非对称多包接收模型的时隙ALOHA随机接入系统的稳定性。引入了非对称多包接收(MPR)模型,计算了媒体接入控制(MAC)容量区域,得到了两用户系统ALOHA稳定区域的详细特征。结果表明,随着MPR容量的提高,稳定区域从凹形区域变化到凸形区域,ALOHA稳定区域与MAC容量区域是一致的,而且当发送概率为1时,系统不需要传输控制,即对于两用户捕获信道而言,发送概率为1的ALOHA系统稳定性是最优的。     

AD hoc网络中的机会分组调度算法

无线多跳Adhoc网络中节点在业务发送过程中需要竞争共享信道,容易发生局部拥塞导致网络性能下降,而且节点内部采用的先入先出（FIFO）队列容易使队头阻塞,影响队列中后续分组的发送。本文提出了一种机会分组调度算法CBOS,发送节点采用多播RTS的方式同时指向多个接收节点,可以支持可变长分组,提高了Adhoc网络的空间重用率,接收节点根据拥塞程度按照一定概率返回CTS,有利于节点网络的拥塞控制。仿真结果表明,该算法提高了网络端到端的饱和吞吐量和信道利用率,并提高了业务流之间的公平性。     

基于竞争请求的CM上行发送缓冲区大小的计算方法

基于HFC(Hybrid Fiher Coax)网络的国际标准DOCSIS规范,分析了其网络接入设备CM(Cable Modem)上行带宽分配的竞争请求机制.首先给出了上行信道带宽竞争请求算法的马尔可夫链模型,以此为基础建立了CM端的上行信道数据帧发送过程的M/M/1/K排队模型,并给出了上行信道数据帧发送缓冲区大小的理论估计方法.通过NS-2仿真工具进行仿真,验证了该方法可以较为准确地估计CM上行发送缓冲区的大小与溢出概率的关系,从而证明该方法能够为上行发送缓冲区的大小设置提供理论参考依据.     

并行处理任务级仿真环境的研究及实现

并行处理仿真为并行系统的建模分析，并行算法的模拟执行以及并行环境的性能评价提供支持，本文利用任务相关仿真时钟和重叠时间片建立了一种支持完全并和用户并发方式的并行多任务模型，并结合对不同调度算法和互连结构的仿真实验，着重分析了任务调度对系统性能的影响以及互连网络技术与通信开销的关系。同时，仿真环境还提供模拟执行的并发度曲线和任务执行踪迹供和户分析调试并行程序。     

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.     

Analytical queue length distributions of GPS systems with long range dependent service capacity

Generalized Processor Sharing (GPS) is an idealized scheduling mechanism with given weights assigned to individual traffic flows for service differentiation. Based on the principle of GPS, a number of variants have been proposed and deployed in real-world communication systems where the service capacity of network channels is usually variable. This paper proposes an analytical performance model for GPS systems with the variable service capacity characterized by Long Range Dependent (LRD) processes. The model is able to accommodate heterogeneous fractional Brownian motion (fBm) and Poisson traffic in multi-service networks. We derive the expressions of the queue length distributions of the GPS system and individual traffic flows. The accuracy of the analytical model is validated through comparison between analytical and simulation results.     

An Analysis of the Effect of Network Parameters on the Performance of Distributed Database Systems

Performance analysis studies of distributed database systems in the past have assumed that the message transmission time between any two nodes of a network is constant. They disregard the effect of communication network parameters such as network traffic, network topology, and capacity of transmission channels. In this paper, an analytical model is used to estimate the delays in transmission channels of the long haul network supporting the distributed database system. The analysis shows that the constant transmission time assumption cannot be justified in many cases, and that the response time is sensitive to the parameters mentioned above. Extensions and performance analysis in the context of interconnection networks are also discussed.     

Complex random matrices and Rician channel capacity

Eigenvalue densities of complex noncentral Wishart matrices are investigated to study an open problem in information theory. Specifically, the largest, smallest, and joint eigenvalue densities of complex noncentral Wishart matrices are derived. These densities are expressed in terms of complex zonal polynomials and invariant polynomials. A connection between the complex Wishart matrix theory and information theory is given. This facilitates evaluation of the most important information-theoretic measure, the so-called ergodic channel capacity. In particular, the capacity of multiple-input multiple-output (MIMO) Rician distributed channels is investigated. We consider both spatially correlated and uncorrelated MIMO Rician channels and derive exact and easily computable tight upper bound formulas for ergodic capacities. Numerical results are also given, which show how the channel correlation degrades the capacity of the communication system.Translated from Problemy Peredachi Informatsii, No. 1, 2005, pp. 3–27.Original Russian Text Copyright © 2005 by Ratnarajah, Vaillancourt, Alvo.This work was partially supported by the Natural Sciences and Engineering Research Council of Canada.     

A review on queueing network models with finite capacity queues for software architectures performance prediction

A review is carried out on how queueing network models with blocking have been applied so far into the performance evaluation and prediction of Software Architectures (SA). Queueing network models with finite capacity queues and blocking have recently been introduced and applied as more realistic models of systems with finite capacity resources and population constraints. Queueing network models have been often adopted as models for the evaluation of software performance. Starting from our own experience, we observe the need of a more accurate definition of the performance models of SA to capture some features of the communication systems. We consider queueing networks with finite capacity and blocking after service (BAS) to represent some synchronization constraints that cannot be easily modeled with queueing network models with infinite capacity queues. We investigate the use of queueing networks with blocking as performance models of SA with concurrent components and synchronous communication. Queueing theoretic analysis is used to solve the queueing network model and study the synchronous communication and performance of concurrent software components. Our experience is supported by other approaches that also propose the use of queueing networks with blocking. Directions for future research work in the field are included.     

Modelling priority queuing systems with varying service capacity

Many studies have been conducted to investigate the performance of priority queuing (PQ) systems with constant service capacity. However, due to the time-varying nature of wireless channels in wireless communication networks, the service capacity of queuing systemsmay vary over time. Therefore, it is necessary to investigate the performance of PQ systems in the presence of varying service capacity. In addition, self-similar traffic has been discovered to be a ubiquitous phenomenon in various communication networks, which poses great challenges to performance modelling of scheduling systems due to its fractal-like nature. Therefore, this paper develops a flow-decomposition based approach to performance modelling of PQ systems subject to self-similar traffic and varying service capacity. It specifically proposes an analytical model to investigate queue length distributions of individual traffic flows. The validity and accuracy of the model is demonstrated via extensive simulation experiments.     

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

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

Alleviating consumption channel bottleneck in wormhole routed k-aryn-cube systems

This paper identifies performance degradation in wormhole routed k-ary n-cube networks due to limited number of router-to-processor consumption channels at each node. Many recent research in wormhole routing have advocated the advantages of adaptive routing and virtual channel flow control schemes to deliver better network performance. This paper indicates that the advantages associated with these schemes cannot be realized with limited consumption capacity. To alleviate such performance bottlenecks, a new network interface design using multiple consumption channels is proposed. To match virtual multiplexing on network channels, we also propose each consumption channel to support multiple virtual consumption channels. The impact of message arrival rate at a node on the required number of consumption channels is studied analytically. It is shown that wormhole networks with higher routing adaptivity, dimensionality, degree of hot-spot traffic, and number of virtual lanes have to take advantage of multiple consumption channels to deliver better performance. The interplay between system topology, routing algorithm, number of virtual lanes, messaging overheads, and communication traffic is studied through simulation to derive the effective number of consumption channels required in a system. Using the ongoing technological trend, it is shown that wormhole-routed systems can use up to two-four consumption channels per node to deliver better system performance     

基于渗流理论的三维无线传感网络的渗流密度与覆盖节点密度研究

为保证无线传感器网络的覆盖与连通,探索通信半径和感知半径的比值对三维无线传感网络覆盖与连通的影响,基于渗流理论,得到三维无线传感器网络中协作传输路径的重叠体积函数。考虑到通信半径和感知半径的比值与重叠体积函数的关系,得到重叠体积函数与通信半径和感知半径的比值对三维无线传感器网络渗流密度的影响。在此基础上,当通信半径和感知半径相等时,将得到的渗流密度与覆盖的节点密度结合,得到指定的覆盖率与覆盖的节点密度的关系。仿真实验证明,在三维无线传感器网络中,重叠体积与渗流密度成正比;通信半径和感知半径的比值与渗流密度成反比;随着指定的覆盖率的增加,所得到的覆盖的节点密度也随着增加。