Ad-hoc网络中提供QoS支持的信道接入机制的改进

在移动Ad—hoc网络研究中，MAC子层是一个关键，受到关注的研究对象，其中研究如何在高负载情况下进一步提高MAC层的QoS性能是研究者关注的焦点。本文在AEDCF机制的基础上，引入新的基于信道条件的ACK率因子，提出了一种改进的动态自适应EDCF（I—AEDCF）机制，在新的机制中，退避时间和竞争窗口的更新依赖于ACK率因子，通过仿真实验可以看到，新的机制在网络负载重的情况下，减少了时延，提高了系统吞吐量，提高了系统的实时性要求。     

应用于航空Ad Hoc网络的高负载优先级均衡MAC协议

针对航空Ad Hoc网络在高负载下的低时延信道接入问题,提出一种优先级与公平性协作的多信道MAC协议(PBLL/HL)。在多信道检测统计基础上加以改进,结合优先级机制,在高负载网络中适时截流低优先级业务,优化网络流量,保证高优先级业务低时延发送;设计公平性优先级阈值与冲突退避窗口算法(PCA),减小低优先级业务接入时延。仿真结果表明,PBLL/HL能够在高负载网络有效控制信道接入,维持良好的网络流量,降低网络平均接入时延(低优先级业务时延过载时降低10%以上),稳定高负载网络吞吐量(最大吞吐量88.1%,过载时吞吐量下滑平缓),解决了航空数据链高业务量带来的高时延和网络拥塞。     

确保无线AdHoc网络服务质量的MAC协议研究

本文针对无线局域网中MAC层Qos支持技术进行了研究，在分析了现有的EDCF退避机制的静态参数设置方法的基础上，提出结合网络负载状况动态调节不同优先级业务的竞争窗口和退避时间，改变不同优先级业务的信道接入方式的方法。仿真结果表明，动态调节法相较于静态参数法在网络吞吐量、时延、碰撞率方面都有更好的表现。     

无线网状网中基于信道预留的多信道媒体接入控制方案

目前多信道无线Mesh网络WMN(Wireless Mesh Network)的MAC(Medium Access Contro)l仍然存在信道利用率低的问题,因此提出了具有控制信道和数据信道的多信道WMN的MAC方案。方案采用数据信道预留机制来提高系统的吞吐量,并降低接入时延。该方案通过减小控制信道上的碰撞概率可以有效降低系统接入时延并提高控制信道的利用率。理论分析和性能估计表明此方案具有高的吞吐量和低的接入时延,性能明显优于现有的公共信道控制方案CCC(Common Control Channel)。     

WLAN中基于效用的呼叫接纳控制策略

 为了在802.11的网络中提供服务质量(QoS)支持,IEEE 802.11 Task Group E提出了EDCF协议.然而EDCF只能提供业务区分服务,并不能提供服务质量(QoS)保证.为了能在重负载下提供QoS保证,在WLAN中加入呼叫接纳控制(CAC)机制是非常必要的.本文首先提出了一个新的3维Markov模型对非饱和状态下EDCF的吞吐量和平均接入时延进行了分析.并在此基础上,提出了一种基于效用函数的CAC策略,它可以使网络的总收益达到最大.最后通过大量仿真验证了所提出的CAC策略的有效性.     

基于LDPC码的多中继HARQ系统研究

根据不同中继节点建立的通信信道衰落特性的不同,利用中继节点可增强无线信道空间分集,提高整个链路的传输性能。纠错码的使用可更有效地提高信道传输效率的特点。文中介绍了基于LDPC码的多中继HARQ系统模型,在不降低传输速率的条件下,可更高效地传输数据。利用Matlab仿真了不同中继个数对系统平均误码率、吞吐量以及平均时延产生的不同影响,仿真结果表明,采用该系统模型可降低系统的平均误码率和平均时延,提高了系统的吞吐量。同时在码长较长的情况下,采用LDPC码的多中继HARQ系统性能优于采用Turbo码的多中继HARQ系统性能。     

太赫兹网络中基于优先级调度的低开销双信道MAC协议

针对现有太赫兹通信网络双信道MAC协议存在控制开销冗余和在竞争信道时缺少优先级调度策略等问题,提出了一种太赫兹网络中基于优先级调度的低开销双信道MAC协议（Low Overhead Dual-channel MAC Protocol Based on Priority Scheduling,LO-PSMAC）,包含通信距离预判、优先级调度策略的CSMA/CA和精简THz频段MAC帧三种机制,可有效提升信道利用率和整体网络吞吐量,同时减小控制开销和降低数据平均时延。仿真结果表明,所提协议与现有太赫兹双信道MAC协议相比,MAC层吞吐量和信道利用率分别提升了7.14%和14.75%,数据平均时延降低了14.21%。     

一种新的基于最大流的无线Mesh网络信道分配算法

在无线Mesh网络中,为节点配置多接口多信道MAC协议成为提高网络性能、扩大网络容量的有效手段之一。有效的信道分配策略在多信道无线Mesh网络中显得尤为重要。本文提出一种基于最大流的信道分配算法。该算法通过最大流计算网络中可达到的最大吞吐量,以此作为网络负载标准进行信道分配,将降低整个网络的总体干扰作为目标函数进行优化。仿真结果表明,即使在网络负载较重的情况下,算法仍能保持较好的性能。     

VoWLAN结构的仿真与分析

VoWLAN(voice over wireless local area network)是对有线的VoIP系统的扩展。Adhoc网络作为一种无中心节点自由组网特点的网络非常适合应急通信的要求。在应急通信中,语音通信是最基本也是最为实用的。近些年来VoIP技术迅猛发展,相比于传统语音通信,VoIP技术使用语音压缩编码,带宽利用率高,利用互联网进行传输,因而价格低廉。文中通过研究Ad hoc网络架构和特点,并在OPNET下建立了一个Ad hoc网络的仿真模型,利用该模型完成了对VoIP性能的仿真。通过对协议进行仿真分析,并将仿真结果与DCF进行了比较,EDCF机制稳定后的平均时延处于2ms范围,而DCF机制的平均时延大约是10ms,所以时延方面EDCF机制优于DCF,而通过网络稳定后DCF机制网络吞吐量大于EDCF机制。     

自适应EDCF方法分析

简述了IEEE802.11e的访问控制机制中的增强型分布式协调功能(Enhanced Distributed Coordination Function,EDCF),针对IEEE802.11e QoS机制在高负载情况下业务性能下降的问题,提出了一种新的基于EDCF的自适应方法,并用OPNET软件进行了仿真实现。仿真结果表明,该方法能够有效减少网络传输的延时,显著提高数据吞吐量,极大地改善了QoS的性能。     

Performance analysis of the distributed queuing collision avoidance (DQCA) protocol with link adaptation

DQCA is a near-optimum Medium Access Control (MAC) protocol designed for Wireless Local Access Networks (WLANs). The protocol operates as a random access scheme under low traffic load and switches smoothly and automatically to a reservation scheme as the traffic grows. The inherent feedback mechanism of DQCA facilitates the implementation of a link adaptation algorithm that properly selects the best transmission rate taking into account the state of the wireless channel. This paper presents an analytical model for the evaluation of the performance in terms of throughput and mean message delay in the presence of a time-variant channel response.     

A NOVEL LINK ADAPTATION SCHEME TO ENHANCE PERFORMANCE OF IEEE 802.11G WIRELESS LAN

A novel link adaptation scheme using linear Auto Regressive （AR） model channel estimation algorithm to enhance the performance of auto rate selection mechanism in IEEE 802.11g is proposed. This scheme can overcome the low efficiency caused by time interval between the time when Received Signal Strength （RSS） is measured and the time when rate is selected. The best rate is selected based on data payload length, frame retry count and the estimated RSS, which is estimated from recorded RSSs. Simulation results show that the proposed scheme enhances mean throughput performance up to 7%, in saturation state, and up to 24% in finite load state compared with those non-estimation schemes, performance enhancements in average drop rate and average number of transmission attempts per data frame delivery also validate the effectiveness of the proposed schelne.     

Performance characterisation of the MCNS DOCSIS 1.0 CATV protocolwith prioritised first come first served scheduling

The Multimedia Cable Networks Systems (MCNS) Data Over Cable Service Interface Specifications (DOCSIS) is established as the primary cable network data communications standard. The head-end scheduling algorithm is not defined within the standard but it is the key function for providing the required performance capability. Computer simulation, using the Common Simulation Framework (CSF) 12 version of the CableLabs DOCSIS 1.0 computer model, has been used to predict the upstream system throughput and mean access delay. A prioritised first come first served scheduling algorithm has been considered to provide a baseline reference set of performance statistics against which other algorithms can be compared. The simulations, with theoretical confirmation, have shown that the maximum sustainable system throughput is 1965 kbps for a channel capacity of 2560 kbps and a packet size of 1500 octets, whereas for packet size of 100 octets the maximum sustainable throughput is only 1550 kbps. The mean access delay is found to vary between 10-900 ms depending on the offered load and assuming that the offered load does not exceed the capacity of the channel. Excess offered load causes service starvation according to the assigned priority     

Impact of bursty error rates on the performance of wireless local area network (WLAN)

With an increasing popularity of DCF based wireless LAN, the modeling of 802.11 distributed coordination function (DCF) has attracted lots of research attention. Existing analysis of 802.11 DCF has been focused on the determination of the throughput and the packet delay under saturated traffic and ideal channel conditions. Although some recent papers address the saturated performance under a simple uniform error model, they can hardly capture the impact of bursty characteristics of wireless fading on the performance of 802.11 DCF. This paper presents exact formulae for the throughput and the delay in DCF for various traffic conditions when either saturated or unsaturated traffic load is present. A two-state Markov channel model is incorporated to present the bursty characteristics of channel errors. With our analysis, the impact of bursty channel error on unsuccessful transmission probability and the DCF performance can be determined. The results of our analytical framework reveal that the four-way handshaking scheme does not improve throughput substantially for light traffic load. However, for heavy traffic load, the four-way handshaking scheme is advantageous as compared to the basic access scheme. Also, extensive simulation is done to substantiate the accuracy of our analytical model.     

Bounded-Mean-Delay Throughput and Nonstarvation Conditions in Aloha Network

Prior investigations on the Aloha network have primarily focused on its system throughput. Good system throughput, however, does not automatically translate to good delay performance for the end users. Neither is fairness guaranteed: Some users may starve, while others hog the system. This paper establishes the conditions for bounded mean queuing delay and nonstarved operation of the slotted Aloha network. We focus on the performance when collisions of packets are resolved using an exponential backoff protocol. For a nonsaturated network, we find that bounded mean delay and nonstarved operation can be guaranteed only if the offered load is limited to below a quantity called "safe bounded mean-delay (SBMD) throughput." The SBMD throughput can be much lower than the saturation system throughput if the backoff factor r in the exponential backoff algorithm is not properly set. For example, it is well known that the maximum throughput of the Aloha network is e ^-1 = 0.3679. However, for r = 2, a value assumed in many prior investigations, the SBMD throughput is only 0.2158, a drastic penalty of 41% relative to 0.3679. Fortunately, using r = 1.3757 allows us to obtain an SBMD throughput of 0.3545, less than 4% away from 0.3679. A general conclusion is that the system parameters can significantly affect the delay and fairness performance of the Aloha network. This paper provides the analytical framework and expressions for tuning r and other system parameters to achieve good delay and nonstarved operation.     

一种基于固定TDMA的无冲突动态时隙分配算法

本文提出了一种适用于Adhoc网络的动态时隙分配TDMA算法——IP-TDMA算法,该算法以一种新颖的方式在固定TDMA的基础上叠加了优先级竞争机制,既有最差性能保障,又有较高信道利用率。通过采用一种特殊的帧结构,P-TDMA算法还可以避免信令分组的碰撞,是一种有效而又可靠的广播动态时隙分配TDMA算法。仿真结果表明,无论在吞吐量还是迟延方面,P-TDMA算法都比固定TDMA表现出更好的性能。     

Performance of LAN token passing protocol under asymmetric traffic loads

The nature of the traffic offered to a token passing LAN is shown to be a significant factor affecting the mean delay against traffic throughput performance. A novel asymmetric traffic model with an exponential load distribution is presented, and its effects on the LAN performance are investigated using computer simulation.<>     

A novel fair random access scheme with throughput optimization using fuzzy controller for wireless systems

Good backoff algorithms should be able to achieve high channel throughput while maintaining fairness among active nodes. In this paper, we propose a novel backoff algorithm to improve the fairness of random access channels, while maximizing channel throughput. The mechanism of the proposed backoff algorithm uses backoff delay (retransmission delay) and channel‐offered traffic to dynamically control the backoff interval, so that each active node increases its backoff interval in the case of collision by a factor which exponentially decreases as the backoff delay increases, and decreases its backoff interval in the case of successful transmission by a factor which exponentially decreases as the backoff delay of previous retransmission attempts increases. Also, the backoff interval is controlled according to the channel offered, traffic using a fuzzy controller to maximize channel throughput. Furthermore, the operation of the proposed backoff algorithm does not depend on knowledge of the number of active nodes. A computer simulation is developed using MATLAB to evaluate the performance of the proposed backoff algorithm and compare it with the binary exponential backoff (BEB) scheme, which is widely used owing to its high channel throughput, while its fairness is relatively poor. It is shown that the proposed backoff algorithm significantly outperforms the BEB scheme in terms of improving the performance of fairness, and converges to the ideal performance as the minimum backoff interval increases, while achieving high channel throughput. Copyright © 2008 John Wiley & Sons, Ltd.     

一种采用两级缓冲调度区分业务的帧聚合策略

帧聚合是改善无线MAC(Media Access Control)协议信道利用率,提高频谱效率的有效手段之一。该文针对多业务场景,采用两级缓冲区调度策略,按照不同聚合权重因子对各队列轮询聚合。根据各个队列的包超时紧迫因子动态调整各队列的聚合权重,以满足各QoS等级业务的时延限制。该文还将排队论模型引入到帧聚合策略的性能分析中,建立了系统的数学分析模型,定量分析了主要性能参数与系统负载的关系。通过与IEEE 802.11n标准中定义的两层帧聚合策略比较表明,该文提出的帧聚合策略的性能优于IEEE 802.11n两层帧聚合策略。