ATXOP：一种传输机会自适应分配算法

在无线局域网(W LAN)中,由于各个站点竞争信道引起的数据帧冲突严重损害了整个网络的性能。首先分析了目前提高无线局域网性能的算法及存在的问题,在此基础上提出了一种自适应分配传输机会(TXOP)的算法ATXOP。该算法根据当前信道隙利用率,动态地调整连续传输数据帧的数目。不仅减少了由传统竞争算法引起的网络拥塞,而且避免了固定分配传输机会带来的不公平性。算法简单易行。仿真结果表明,在保证公平性的同时,该算法能够有效地提高网络的吞吐量和降低数据帧传输平均延时。     

基于IEEE 802.11高速无线局域网的速率自适应MAC协议研究

目前的IEEE 802.11标准在物理层提供了对多种发送速率的支持,然而在MAC层却没有规定速率自适应的方法。该文研究了高速IEEE 802.11 无线局域网中的速率自适应方案。首先,提出了EACK协议,EACK使用基本速率发送MAC头,并在ACK帧中携带信道信息,因而能够较快速地响应信道的变化,同时具有少的开销;其次,在EACK基础上,提出了一种恒定发送时间(CEACK)的策略,CEACK能够克服传统IEEE 802.11 DCF MAC协议的理论吞吐量上限,并且具有更好的时间公平性能,能够应用于高速的无线局域网。     

一种适用于Ad hoc网络的DCF协议自适应功率控制机制

该文对载波检测无线网络中的冲突干扰问题进行了分析,在此基础上提出了一种适用于Ad hoc网络的DCF协议自适应功率控制机制。该机制能根据各个接收节点的通信状况,自适应的调整接收节点的CTS帧发送功率和收方决定的数据帧发送功率。仿真证明,在DCF协议中引入该机制后,不仅能有效节省节点能耗,延长网络的生存时间,还能同时增大网络的频率空间复用度,提高网络的平均吞吐量。     

一种基于RBAR的高效速率自适应算法

在动态变化的无线信道环境下传输数据时,选择适当的传输速率可以提高数据传输系统的性能,目前已经有多种速率自适应算法被提出。针对RBAR速率自适应算法需多次发送RTS/CTS控制帧浪费网络带宽这一缺点,提出一种改进速率自适应算法。改进后算法兼容IEEE802.11标准,通过监测系统吞吐量的变化,判断是否发送RTS/CTS帧更新传输速率,减少RTS/CTS控制帧的发送次数,提高系统整体性能。对系统吞吐量进行理论推导,通过仿真实验验证改进算法,可以通过减少RTS/CTS控制帧的发送次数提高系统吞吐量。     

太赫兹无线个域网公平高效的MAC层优化机制

针对太赫兹无线个域网双信道媒体访问控制(Medium Access Control, MAC)协议中存在的信道资源分配公平性差、数据帧重传效率低和控制开销较高的问题,提出了一种公平高效的MAC层优化机制。新机制采用基于历史时隙申请信息的信道资源分配策略优化时隙分配公平性,根据信道质量自适应选择数据帧重传机制,控制节点从申请时隙的节点发送的控制帧中的“duration”字段提取时隙申请信息,省略时隙申请帧的发送,从而降低数据帧排队时延和控制开销,提高吞吐量。仿真结果表明,与TAB-MAC和MDP-MAC协议的机制相比,所提机制的数据帧平均排队时延降低了15%,吞吐量提高了5%。     

差错信道下IEEE 802.11 DCF最优帧长分析及信道自适应策略

分析了差错信道下IEEE 802.11 DCF在饱和状态下的吞吐量以及帧长度对吞吐量的影响.研究表明在一定的误码率（BER）下存在最优的帧长使得系统吞吐量最大,并且该最优值与发送节点的数目无关.在此基础上,提出了一种简单的基于BER区间划分的帧长控制的信道自适应发送策略.仿真表明,与固定帧长的发送策略相比较,使用该策略在差错信道下可以有效地提高吞吐量.     

基于网络空间复用与累积干扰的无线Ad Hoc网络性能优化

无线Ad hoc网络中,网络容量主要依赖于网络的空间复用度以及由于节点并发所造成的累积干扰。文章首先分析了网络的空间复用与干扰对于网络容量的影响,将网络容量映射为网络的空间复用以及网络中存在的干扰的相互作用的函数。并进一步基于安全载波监听的概念,提出了一种空间复用提升以及干扰避免的节点数据发送策略。该策略能够根据网络当中存在的干扰动态地调整节点的发送方式,在提高网络空间复用的同时控制网络当中存在的干扰,从而达到网络性能优化的目的。理论分析以及仿真实验都证实了我们的策略能够有效的提高无线Ad Hoc网络的吞吐量,优化网络性能。     

链路层中速率自适应方法研究

速率自适应技术是一种链路自适应方法,它在特定时间内根据信道质量状况选择最佳的数据发送速率。对于支持多速率传输的无线系统来说,采用速率自适应技术之后系统能够在很好地保证服务质量的同时有效地增大网络吞吐量,提高无线链路的利用率,更好地利用时变信道的有限带宽。文章将速率自适应过程划分为信道质量估计和速率选择两个阶段,并对它们分别进行了详细分析,进而得出了速率自适应技术的基本研究方法。     

通过自适应调整最小竞争窗口最大化IEEE 802.11 DCF的饱和吞吐量

最大化802.11 DCF的饱和吞吐量对充分利用无线局域网宝贵的带宽资源具有重要意义。该文在分析802.11 DCF的饱和吞吐量与最小竞争窗口、最大回退等级、网络中竞争信道的节点数的关系的基础上,推导了根据网络中竞争信道的节点数,计算最小竞争窗口的最佳值的简单公式。给出了估计竞争信道的节点数并据此动态调整最小竞争窗口的最佳值的自适应算法。同时,该文对估计竞争节点数的算法的准确性和计算最小竞争窗口最佳值的公式的准确性进行了仿真分析,并比较了改进后的802.11 DCF的饱和吞吐量与原802.11 DCF的饱和吞吐量的大小。仿真结果证明了上述公式、算法是准确和有效的。     

一种Wi-Mesh网络中混合速率控制算法

基于ARF（Auto Rate Fallback）协议与反向信道估计机制,提出了一种基于IEEE802.11基本机制的Wi-Mesh网络混合速率控制协议HRC（Hybrid Rate Control）。HRC协议避免了节点在信道处于稳定状态时提高数据帧发送速率,通过反向信道估计机制可以实时地调整节点数据帧发送速率匹配信道质量的快速变化,从而达到更好的系统性能。仿真结果表明：HRC协议较ARF协议可以提高数据帧发送成功率,提高无线带宽的利用率。     

车用自组网媒体访问控制机制改进

为提升车用自组网传输音频、视频的服务质量,对基于IEEE802.11p的车用无线接入技术MAC机制进行改进,提出竞争窗口自适应EDCA机制。仿真实验表明,竞争窗口自适应EDCA机制有效地降低了车用自组网中音频、视频流的传输时延、时延抖动和丢包率,保证了车用自组网传输VoIP、视频会议、音视频流媒体等多媒体业务的服务质量。     

On the optimization of the contention resolution mechanism for IEEE 802.16 networks

The IEEE 802.16 standard defines a contention bandwidth request mechanism offering QoS-aware broadband access through a wireless medium. According to the standard, the Base Station (BS) is responsible for granting the requests issued by the Subscriber Stations (SSs). The SSs communicate their requests to the BS by placing their requests into the uplink subframe, using the contention period defined within the subframe for this purpose. The size of contention period, defined in minislots, is fixed by the BS on a frame by frame basis. The remaining part of the uplink subframe is used to carry the data frames. A tradeoff between these two periods of the uplink subframe is required for an effective operation of the system. On the contrary, if the size of the contention is shorten below a certain threshold, the SSs may be unable to place their requests within the time required by the end-user applications. In this paper, we introduce an adaptive mechanism of the contention period size. The proposed mechanism takes into account the varying operation conditions of the system by estimating the number of stations that may be placing a request. Simulation results confirm that our proposal outperforms other mechanisms having recently been reported in the literature.     

一种基于竞争节点估计的改进DCF机制

对于多跳Mesh网络特有的树状拓扑，距离网关不同跳数的路由器所承载的网络流量不尽相同，与周围节点的竞争情况也不一致，由此传统802．11的DCF机制并不适用。提出了一种基于竞争节点估计的竞争窗调整机制，即利用节点分布式地获取各自的条件碰撞概率，并由此估算其竞争节点个数，在此基础上由最优最小竞争窗与竞争节点个数的关系函数，调整竞争窗大小来提高Mesh网络的总体性能。采用OPNET仿真结果表明，优化后的饱和系统吞吐量可提高70～80％，饱和时延可降低50％以上。     

A successive transmission medium access scheme with dynamic contention window for VLC system with saturated traffic

The visible light communication (VLC) network is usually relatively small scale and can provide high-data-rate information transmission, where multiple users get access to the network according to the carrier sense multiple access with collision avoidance (CSMA/CA) mechanism specified by IEEE 802.15.7 standard. In this paper, we propose a novel dynamic contention window with successive transmission (DCW-ST) scheme to improve the performance of this channel access mechanism and to achieve better network throughput without delay performance degradation. Specifically, we propose to adjust the contention window dynamically to adapt to the time-changing network size. Further, we derive the contention window size to achieve trade-off of throughput and delay, and the minimum contention window size required for the throughput enhancement. In addition, in order to further improve the delay performance, we present a successive transmission scheme that allows the nodes which have completed one transmission successfully to get the chance of transmitting information successively according to the network condition. Simulations are performed for the VLC system in saturated traffic and compared with the theoretical performances, which demonstrate that our proposed scheme outperforms the legacy CSMA/CA of IEEE 802.15.7.     

Investigation on group based contention bandwidth request in LTE-A networks under high delay spread environment

In this paper, contention bandwidth request has been investigated for long term evolution-advanced (LTE-A) networks under extended typical urban based multipath fading channel that displays high delay spread environment. As the choice of preambles has to provide high detection probability under such environments, at the outset, this paper examines various group based preamble selection mechanisms, namely, Type I, Type II and Type III preamble sets. With suitable type of group based preamble, the challenge during contention bandwidth request is the appropriate choice of contention window during contention resolution. The contention window in this paper is chosen based on the indicators of various failure events, namely, probability of collision due to contention, probability of unavailability of bandwidth, probability of channel error and probability of improper detection of Zadoff–Chu sequences. After suggesting a scheme to account the possible failure events, an analytical model for contention-based bandwidth request has been developed for LTE-A networks. In addition, two backoff mechanisms are proposed to resolve contention among user equipment’s effectively and these mechanisms are compared to the existing techniques, namely, binary exponential backoff and uniform backoff. Further, the contention mechanism has been substantiated for varying depth of channel errors. With Type I grouping, the backoff with optimized contention window improves the efficiency by 13.95 %, reduces the access delay by 18.71 % and decreases the dropping probability by 59.33 % than the existing uniform backoff mechanism.     

WiMAX中的多业务接入性能分析

针对IEEE802.16媒体接入机制,研究了WiMAX(微波存取全球互通)系统中多业务场景下的吞吐量、接入延时和丢包率性能,考察了帧结构、最小竞争窗和延时约束对不同优先级业务性能的影响。仿真结果表明,选择最优的帧结构并为有不同QoS(服务质量)需求的业务选择接入参数,能够增加系统吞吐量,减小业务接入延时和丢包率。     

Joint optimization and threshold structure dynamic programming with enhanced priority scheme for adaptive VANET MAC

Nodes in vehicular ad-hoc network (VANET) are highly mobile, traversing in unpredictable and varying environment. Therefore, contention window size and transmission power should adapt according to the high mobility transmission environment. In this paper, we propose an adaptive VANET medium access control (MAC) layer with joint optimization for VANET (MACVS) which aims at minimizing average delay and maximizing packet success rate. An adaptive joint optimization with proposed threshold structure dynamic programming, with closed loop feedback control system, is designed to optimize contention window size and transmission power. Adaptive optimization is done based on road traffic conditions and transmission reliable distance range (depicted by interference and noise), by monitoring the continuous change and threshold of received signal strength to interference and noise ratio. Mathematical expressions have been developed for the MACVS optimization framework, and the produced analytical results show good agreement with the simulation results. Simulations with different arrival rates and urban map of city center show that the proposed MACVS with low complexity joint optimization effectively reduces end-to-end delay while achieving high packet success rate under various network traffic condition.     

Wireless Adaptive Framed Pseudo-Bayesian Aloha (AFPBA) Algorithm with Priorities

In this paper, we propose a new priority algorithm to control the access to the wireless ATM MAC uplink frame, for multimedia traffic like wireless ATM, similar to the Pseudo-Bayesian algorithm presented in [1]. The adaptive framed Pseudo-Bayesian Aloha (AFPBA) algorithm ensures minimum access delay for high priority traffic classes with small delay degradation to low priority traffic classes. Control packets are transmitted in each slot according to transmission probabilities based on the history of the channel and in contention with other packets of the same priority class. The number of contention slots assigned for each priority class, on a given frame, changes adaptively according to its priority index and the estimated arrival rate on each frame using an adaptive slot assignment mechanism. Finally, the throughput analysis of the algorithm is presented and the delay performance is evaluated by simulation on a wireless channel in the presence of shadowing, Rayleigh fading and capture. Results show that the wireless channel offers significant delay improvements to all priority packets, especially in the presence of fast fading.     

Efficient Back-off Mechanism for Multimedia Support in 802.11e EDCA Wireless Ad-Hoc Networks

This paper presents an effective back-off mechanism to improve quality of service (QoS) for multimedia applications over the IEEE 802.11e enhanced distribution channel access (EDCA) standard. It can be done with proposed algorithm called dynamic fast adaptation for contention-based EDCA (DFA-EDCA) mechanism. The main concept of proposed DFA-EDCA mechanism is to use the exponential functions to adaptively tune the back-off parameters in IEEE 802.11e EDCA according to the changes on a network load within a short period. In this proposed mechanism an intra-access category (intra-AC) differentiation mechanism is provided to increase its back-off time randomly and achieve discrimination of same priority traffic on different stations. The performance evaluations have been conducted by using Network Simulator (NS-2). The simulation results show that the proposed DFA-EDCA mechanism has greatly outperformed the previous mechanisms such as non-linear dynamic adaptation scheme of the minimum contention window (CW_min-HA), dynamic adaptation algorithm of the maximum contention window (CW_max-adaptation), adaptive enhanced distributed coordination function and the conventional EDCA in terms of goodput, gain of goodput, packet delay, collision rate and channel utilization ratio (CUR). It has significantly reduced both packet delay and collision rate simultaneously together with an obviously increment in both goodput and CUR, which lead to the improvement in QoS for multimedia applications.