WiMAX Mesh网络中一种集中式QoS调度算法

针对WiMAX Mesh网络集中式下资源的调度和分配,分析了现有调度算法的研究进展与优缺点,结合标准对Mesh模式的QoS定义,提出了一种WiMAX Mesh网络集中式下基于分组的QoS调度算法。通过区分数据流的优先级方式对不同业务数据流进行分组,并计算组内流节点的权值,保证同种业务流间高传输要求和低传输节点的公平性。仿真结果表明,与HRF和LRC算法相比,该算法对于分类业务的时延和网络吞吐量具有明显的优势,实现了区分业务的QoS保障。     

扩频因子数目公平分配机制

LoRa网络使用宽带线性调频技术,利用设置不同的扩频因子（SF）来实现不同的传输速率.当网络中节点较多、发生碰撞时,具有高扩频因子的节点由于传输速度低、传输时间长,更易发生碰撞,传输成功率也相对较低.所以当网络中每种扩频因子分配同等数量的节点时,对于低速率的传输不够公平,因为其信道占用时间更长,碰撞概率更大.提出了一种基于扩频因子的分配机制（FSA）.高扩频因子由于更易发生碰撞,传输成功率较低,因此给高扩频因子分配较少的节点、低扩频因子分配较多的节点,这样,不同扩频因子传输成功率相同.该机制有效地解决了碰撞网络中节点扩频因子分配不合理带来的公平性问题,降低了高扩频因子节点重传的概率,网络的稳定性大为提升.     

改进的无线Mesh网路由判据算法及其路由协议

为了改善802.11s无线Mesh网传输过程中因重传次数过大而造成的丢包问题,根据实际无线传输中的网络重传次数特性,提出一种基于最大重传次数的空中传播时间改进路由判据算法.同时为了缓解因单根节点造成的网络拥塞,提高实际场景中边缘节点的传输性能,并保证网络中所有节点使用无线信道资源的公平性,基于树的寻径机制从拓扑结构的角度,提出一种改进的多根节点的混合无线Mesh网路由协议(M-HWMP).理论及仿真结果表明,改进的路由判据算法及路由协议优化了无线Mesh网传输不同数据流时的吞吐量、时延特性,并在一定程度上避免了网络拥塞.     

适用于S-MAC协议的自适应随机退避机制研究

S-MAC协议通过周期性睡眠侦听机制来减少无线传感器网络中节点能量的消耗,但是其在随机退避过程中使用固定竞争窗口,使其在节点碰撞的避免、节点间公平性以及吞吐率上有所欠缺。针对S-MAC的以上不足,基于二进制指数退避算法(BEB)提出自适应指数随机退避算法(AD-BEB)。AD-BEB算法引入了信道竞争能力参数和网络拥挤参数,根据这两个参数对竞争窗口进行调整,并且窗口的调整经过两个阶段来完成。仿真结果表明,AD-BEB算法能够有效地减少节点的碰撞次数,增加网络的吞吐率和节点的公平性。     

带有扩散程度估计的机会网络分组调度机制

根据数据分组扩散程度与投递状态具有直接关系的特点,提出一种带有数据分组扩散程度估计的机会网络分组调度机制。通过机会网传输机制估计每个数据分组的扩散程度,利用动态效用函数估算其效用值。在分组调度时删除效用值小的数据分组,以节点之间的相遇概率作为数据分组优先转发的依据。仿真结果显示,该机制能够提高数据分组的成功投递率,降低网络负载率及数据分组的传输时延。     

基于802.11ah井下监测传感网的RAW重分组研究

现有的ZigBee、超宽带、WiFi等井下无线传感网通信技术或传输距离短,或传输速率较低,或覆盖范围与接入设备数量受限,而IEEE 802.11ah协议满足井下无线传感网对传输范围、功耗、网络容量、传输速率等的要求,可用于井下监测传感网传输周期性监测数据。针对802.11ah协议中MAC层标准限制接入窗口(RAW)机制在进行传感节点分组时不灵活、易导致组间负载不平衡的问题,提出了一种基于时延优化的RAW重分组方法:根据数据包预计传输时间对所有传感节点重新分组,通过3次分组来减少RAW组内节点碰撞、降低传输时延。为实现RAW重分组,提出了关联标识符(AID)分组重分配方法:采用部分传感节点断开关联的方式,按重分组后的RAW组分批次为节点重新分配AID,并将AID与节点MAC映射,从而减小RAW重分组时间开销,避免AID重分配过程中因数据无法传输而导致网络性能下降。仿真结果表明,随着井下监测传感网中传感节点增多,RAW重分组方法较标准RAW机制的网络时延更小、吞吐量更大、丢包率更低,且重分组过程对网络性能影响较小。     

周期性采样的两步指数退避算法研究

针对二进制指数退避算法（BEB）中退避窗口调整机制的不足以及在各个节点传输数据时公平性差的问题,提出了周期性采样的两步指数退避算法（PTEB）。PTEB算法首先引入了采样周期的概念,在此基础上又引入了信道竞争能力参数[Qc]和网络拥挤参数[Qb]。在采样周期内计算[Qc]与[Qb]的值,并根据这两个参数的值定义了调整竞争窗口的公式。窗口的调整需要经过两个阶段来完成,不同的阶段分别对应不同的公式。仿真结果表明PTEB算法能够有效地减少节点的碰撞次数,增加网络的吞吐率和节点的公平性。     

一种基于WMM规范的QoS实现

Wi-Fi联盟制定的WMM规范提出了一种QoS方案,其核心是赋予不同业务以不同的优先级,并引入TXOP传输机制,从而保障了实时业务的传输质量.根据WMM规范,本文提出了QoS的实现方案,完成了基于Verilog语言的硬件设计,在Synopsy VCS环境下进行了仿真验证.     

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

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

大规模无线传感器网络正六边形覆盖时的传输容量研究

传输容量是无线传感器网络的重要性能指标之一。该文针对监测覆盖效果最佳的正六边形,利用随机几何理论建立无线传感器网络模型,并根据节点分布情况,推导计算节点距离的累计分布函数和概率密度函数。同时,采用功率控制机制,研究CSMA协议下的网络中断概率和网络传输容量。仿真结果表明：正六边形覆盖监测区域内的系统中断概率较低,网络传输容量较大。而且,空间分组密度、网络编码效率、退避次数和重传次数决定了网络传输容量的大小。这为日后研究无线传感器网络的传输性能提供了理论参考依据。     

A QoS Estimation-Based Scheduler for Real-Time Traffic in IEEE 802.11e Mobile Ad hoc Networks

ABSTRACT

For mobile ad hoc networks, the IEEE 802.11e standard specification provides Quality of Service (QoS) facility support in the MAC layer by Enhanced Distribution Channel Access (EDCA), which provides differentiated and distributed access to the wireless medium with four access categories (AC). It works efficiently for constant bit rate (CBR) types of traffic; however, for the case of variable bit rate (VBR) types of traffic, it shows poor performance due to the static nature of computing the number of packets and the time required to transmit these packets. In this paper, we present an EDCA scheduling algorithm that allocates transmission opportunities (TXOP) for fluctuating VBR traffic depending on their queue length estimations for mobile ad hoc networks. We classify the channel state as good or bad based on the channel error conditions. Then the scheduler determines the mean application data rate and estimates the TXOP for the next interval on the same Traffic Stream (TS). By simulation results, we show that the proposed scheduling scheme achieves good throughput and fairness with reduced delay for the VBR traffic class.     

Performance analysis of the TXOP burst transmission scheme in single-hop ad hoc networks with unbalanced stations

Transmission Opportunity (TXOP) is a promising burst transmission scheme defined in the IEEE 802.11e Medium Access Control (MAC) protocol to achieve differentiated Quality-of-Service (QoS) and improve the utilization of the scarce wireless bandwidth. Although performance modelling of the TXOP scheme has attracted tremendous research efforts from both the academia and industry, most existing analytical models have been developed under the unrealistic assumption that stations in wireless networks generate identical traffic loads. However, this assumption fails to capture the behaviour of wireless stations under the realistic working environment. To fill this gap, this paper proposes a new analytical model for the TXOP service differentiation scheme in single-hop ad hoc networks in the presence of unbalanced stations with different traffic loads. The QoS performance metrics including throughput, end-to-end delay, frame dropping probability, and energy consumption are derived. Extensive NS-2 simulation experiments are conducted to validate the accuracy of the developed model. The analytical results demonstrate the efficiency of the TXOP scheme for QoS differentiation and performance enhancement. Moreover, the analytical model is adopted as a cost-effective tool to investigate the impact of the buffer size and the number of stations on the performance of the TXOP scheme. The performance results show that the desirable throughput differentiation for different stations can be achieved by setting the appropriate TXOP limits.     

Providing MAC QoS for multimedia traffic in 802.11e based multi-hop ad hoc wireless networks

Ad hoc wireless networks with their widespread deployment, now need to support applications that generate multimedia and real-time traffic. Video, audio, real-time voice over IP, and other multimedia applications require the network to provide guarantees on the Quality of Service (QoS) of the connection. The 802.11e Medium Access Control (MAC) protocol was proposed with the aim of providing QoS support at the MAC layer. The 802.11e performs well in wireless LANs due to the presence of Access Points (APs), but in ad hoc networks, especially multi-hop ones, it is still incapable of supporting multimedia traffic.One of the most important QoS parameters for multimedia and real-time traffic is delay. Our primary goal is to reduce the end-to-end delay, thereby improving the Packet Delivery Ratio of multimedia traffic, that is, the proportion of packets that reach the destination within the deadline, in 802.11e based multi-hop ad hoc wireless networks.Our contribution is threefold: first we propose dynamic ReAllocative Priority (ReAP) scheme, wherein the priorities of packets in the MAC queues are not fixed, but keep changing dynamically. We use the laxity and the hop length information to decide the priority of the packet. ReAP improves the PDR by over 28% in comparison with 802.11e, especially under heavy loads. Second, we introduce Adaptive-TXOP (A-TXOP), where transmission opportunity (TXOP) is the time interval during which a node has the right to initiate transmissions. This scheme reduces the delay of video traffic by reducing the number of channel accesses required to transmit large video frames. It involves modifying the TXOP interval dynamically based on the packets in the queue, so that fragments of the same packet are sent in the same TXOP interval. A-TXOP is implemented over ReAP to further improve the performance of video traffic. ReAP with A-TXOP helps in reducing the delay of video traffic by over 27% and further improves the quality of video in comparison with ReAP without A-TXOP. Finally, we have TXOP-sharing, which is aimed at reducing the delay of voice traffic. It involves using the TXOP to transmit to multiple receivers, in order to utilize the TXOP interval fully. It reduces the number of contentions to the channel and thereby reduces the delay of voice traffic by over 14%. A-TXOP is implemented over ReAP to further improve the performance of voice traffic. The three schemes (ReAP, A-TXOP, and TXOP-sharing) work together to improve the performance of multimedia traffic in 802.11e based multi-hop ad hoc wireless networks.     

BT类型P2P网络的位置知晓性数学建模研究

提出一个新的P2P网络研究问题,即BitTorrent类型对等网络(采用了相似的多源文件传输机制的P2P网络)的位置知晓性问题.设计了BT类型网络使用的具有理想位置知晓性的多源文件传输机制,进行了数学建模,分析证明了该机制具有良好的位置知晓性、下载性能、网络公平性和扩展性.     

无线自组网络中TCP流公平性的分析与改进

研究了TCP(transmission control protocol)流在多跳无线自组网络中的公平性问题,发现IEEE802.11DCF协议在此环境下会导致严重的不公平性,即部分节点垄断了网络带宽而其他节点被饿死.首先,通过仿真分析了产生TCP流不公平性的原因,指出其根源在于MAC(media access and control)协议的不公平性,同时,TCP的超时机制加剧了不公平性的产生;然后,利用概率模型定量分析了TCP不公平性与MAC协议参数之间的关系,发现TCP流的公平性与TCP报文长度直接相关,并且增加MAC协议初始竞争窗口的大小能够有效提高公平性.据此,提出了一种根据TCP报文长度动态调节初始回退窗口大小的自适应回退MAC协议改进算法.理论分析和仿真表明,该算法在很大程度上可以有效缓解不公平性问题的产生,并且不会引起网络吞吐量的严重降低.     

一种卫星网络中RTT公平性增强算法

为解决卫星网络中由于链路长时延、网络拓扑动态变化等造成的TCP连接RTT不公平性问题,给出了一个卫星网络中RTT不公平性增强方案TCP Riff。TCP Riff中引入了参考连接RTT的概念,通过一个基准RTT,使得异构RTT的TCP连接窗口的增长,继而传输速率的增长独立于连接的RTT,从而获得了很好的RTT公平性。NS仿真实验表明TCP Riff明显地减少对长RTT连接的性能差异,并且,在出现拥塞和链路差错情况下,相对于TCP标准版本具有明显的吞吐量优势,以及良好的公平性和友好性。值得提出的是TCP Riff没有破坏TCP协议端到端的语义,并且与其他TCP增强方案是兼容的。     

多速率Ad hoc网络MAC层公平性的分析与改进

在多速率Ad hoc网络中,利用自适应速率调整算法,网络节点可以根据信道质量选择不同的传输速率,从而提高网络的总体通信能力。对多速率Ad hoc网络MAC层公平性进行了仿真和分析,实验结果表明基于IEEE 802.11的多速率Ad hoc网络中存在严重的公平性问题。通过对吞吐率公平和时间公平的讨论,指出在多速率Ad hoc网络中进行MAC层公平性研究,时间公平性标准是较优的选择。另外提出一种针对多速率Ad hoc网络的改进公平回退（EFB）算法,仿真实验的结果表明该算法能够明显提高多速率Ad hoc网络的MAC层公平性。     

Data traffic scheduling algorithm for multiuser OFDM system with adaptive modulation considering fairness among users

Orthogonal frequency division multiplexing (OFDM) is regarded as a very promising digital modulation technique for achieving high rate transmission. However, the increasing number of wireless data users and the deployment of broadband wireless networks have brought about issues of fairness among users and system throughput. In this paper, we propose an efficient scheduling algorithm to maximize system throughput while providing a level of fairness among users for non-real-time data traffic in the downlink of a multiuser OFDM system. We establish a practical scheduling procedure to implement our scheme considering fairness among users and also formulate the resource allocation problem for rate, power, and subcarrier allocation as an integer program that maximizes system throughput. Next, we present a computationally efficient heuristic algorithm for a problem based on the Lagrangian relaxation procedure. Through the computing simulation, we show that the proposed scheme performs better than other schemes in terms of both system throughput and fairness among users.     

Self-coexistence among interference-aware IEEE 802.22 networks with enhanced air-interface

IEEE 802.22 is a cognitive radio-based Wireless Regional Area Network (WRAN) standard that allows opportunistic access to idle or underutilized sub-900 MHz TV bands by unlicensed (secondary) networks. Though most of the standard has been laid out, there is still no consensus on the channel access policies for the uncoordinated secondary networks. Hence, the possibility of interference always exists. Moreover, in the absence of any control channel, the problem of establishing a connection becomes even more challenging, more so in the presence of hidden incumbents.In this paper, we address the above-mentioned self-coexistence problem among the IEEE 802.22 networks and provide novel solutions to improve the IEEE 802.22 air-interface. We use an interference-aware graph-theoretic technique and propose Utility Graph Coloring (UGC) for allocating spectrum to different IEEE 802.22 base stations such that they can coexist with the least interference, thereby maximizing the system spectrum utilization. We also consider allocation fairness among the networks in terms of minimal fairness, proportional fairness, and complete fairness. With the spectrum allocated to the IEEE 802.22 networks, we propose enhancements to the IEEE 802.22 MAC layer to maximize spectrum usage efficiency. In particular, we make use of aggregation and fragmentation of channel carriers, dynamic multiple broadcast messages, and aggressive contention resolution. Through simulation experiments, we show how the proposed techniques can increase the spectral efficiency and spectrum utilization, and still maintain fairness. We show that the spectral efficiency obtained with UGC is more than three times compared to the existing standard. The average number of collisions among the IEEE 802.22 enabled devices is significantly reduced, resulting in low connection setup delay, enhanced system performance, and higher spectrum allocation for data transmissions.     

Can high-speed networks survive with DropTail queues management?

It has been observed that TCP connections that go through multiple congested links (MCL) have a smaller transmission rate than the other connections. Such TCP behavior is a result of two components (i) the cumulative packet losses that a flow experiences at each router along its path; (ii) the longer round trip times (RTTs) suffered by such flows due to non-negligible queueing delays at congested routers. This double “bias” against connections with MCLs has been shown to approximate the so-called minimum potential delay fairness principle in the current Internet. Despite the recent proliferation of new congestion control proposals for TCP in high-speed networks, it is still unclear what kind of fairness principle could be achieved with such newly proposed congestion control protocols in high-speed networks with large-delays. Studies already show that some high-speed TCP variants may cause surprisingly severe RTT unfairness in high-speed networks with DropTail routers.This paper studies the problem of unfairness in high-speed networks with some well-known high-speed TCP variants in presence of multiple congested links and highlights the severity of such unfairness when DropTail queue management is adopted.Through a simple synchronized loss model analysis, we show how synchronized losses with DropTail in high-speed networks could lead to severe RTT unfairness and drop probability (DP) unfairness; while random marking AQM schemes, which break the packet loss synchrony mitigate such unfairness dramatically by ensuring that the packet loss probability of a flow is the sum of the loss probabilities on the congested routers it crosses.Extensive simulations are carried out and the results support our findings.