A smart exponential‐threshold‐linear backoff mechanism for IEEE 802.11 WLANs

Based on the standardized IEEE 802.11 Distributed Coordination Function (DCF) protocol, this paper proposes a new backoff mechanism, called Smart Exponential‐Threshold‐Linear (SETL) Backoff Mechanism, to enhance the system performance of contention‐based wireless networks. In the IEEE 802.11 DCF scheme, the smaller contention window (CW) will increase the collision probability, but the larger CW will delay the transmission. Hence, in the proposed SETL scheme, a threshold is set to determine the behavior of CW after each transmission. When the CW is smaller than the threshold, the CW of a competing station is exponentially adjusted to lower collision probability. Conversely, if the CW is larger than the threshold, the CW size is tuned linearly to prevent large transmission delay. Through extensive simulations, the results show that the proposed SETL scheme provides a better system throughput and lower collision rate in both light and heavy network loads than the related backoff algorithm schemes, including Binary Exponential Backoff (BEB), Exponential Increase Exponential Decrease (EIED) and Linear Increase Linear Decrease (LILD). Copyright © 2011 John Wiley & Sons, Ltd.     

Quasi-FIFO back-off scheme for collision resolution in wireless networks

This paper proposes a quasi-FIFO (QFIFO) back-off scheme for collision resolution in wireless networks. The proposed scheme takes advantage of the central unit (CU) in a wireless network to broadcast a common back-off window size to all the users, significantly alleviating the unfairness of bandwidth utilization in conventional binary exponential back-off (BEB) schemes. Since the maximum throughput is achieved when the back-off window size equals the number of users, the average number of users involved in each collision slot is derived to estimate the number of simultaneously competing users. In the QFIFO scheme, service time is divided into a series of cycles. Packets arrive in the current cycle are guaranteed to be serviced prior to any packet generated in the next cycle and the first-in-first-out (FIFO) principle can thus be semi-accomplished. Simulation results demonstrate that the unfairness of bandwidth utilization in the BEB is significantly mitigated and the throughput can be maintained at 0.368 when the number of users approaches infinity. The capture effect even further improves system performance.     

Fixed collision rate back-off scheme for collision resolution in wireless networks

This investigation proposes a fixed collision rate (FCR) back-off algorithm for wireless networks. The proposed scheme takes advantage of the central unit (CU) in a wireless network to broadcast a common back-off window size to all the users, significantly alleviating the unfairness of bandwidth utilization in conventional binary exponential back-off (BEB) algorithms. It is shown that, when maximum throughput is achieved, collision rate is almost a constant for any traffic load. In the operation of the FCR, the CU dynamically adjusts the back-off window size to keep the collision rate at a constant level for maximum throughput. Simulation results demonstrate that the unfairness of bandwidth utilization in the BEB is significantly lessened and the throughput can be maintained at e^-1≈0.368 when the number of users approaches infinity. The capture effect even further improves system performance.     

Analysis of Enhanced Collision Avoidance Scheme Proposed for IEEE 802.11e-Enhanced Distributed Channel Access Protocol

In enhanced distributed channel access (EDCA) protocol, small contention window (CW) sizes are used for frequent channel access by high-priority traffic (such as voice). But these small CW sizes, which may be suboptimal for a given network scenario, can introduce more packet collisions, and thereby, reduce overall throughput. This paper proposes enhanced collision avoidance (ECA) scheme for AC_VO access category queues present in EDCA protocol. The proposed ECA scheme alleviates intensive collisions between AC_VO queues to improve voice throughput under the same suboptimal yet necessary (small size) CW restrictions. The proposed ECA scheme is studied in detail using Markov chain numerical analysis and simulations carried out in NS-2 network simulator. The performance of ECA scheme is compared with original (legacy) EDCA protocol in both voice and multimedia scenarios. Also mixed scenarios containing legacy EDCA and ECA stations are presented to study their coexistence. Comparisons reveal that ECA scheme improves voice throughput performance without seriously degrading the throughput of other traffic types.     

Model-based admission control for IEEE 802.11e enhanced distributed channel access

IEEE 802.11e enhanced distributed channel access (EDCA) is a distributed medium access scheme based on carrier sense multiple access with collision avoidance (CSMA/CA) protocol. In this paper, a model-based admission control (MBAC) scheme that performs real-timely at medium access control (MAC) layer is proposed for the decision of accepting or rejecting requests for adding traffic streams to an IEEE 802.11e EDCA wireless local area network (WLAN). The admission control strategy is implemented in access point (AP), which employs collision probability and access delay measures from active flows to estimate throughput and packet delay of each traffic class by the proposed unsaturation analytical model. Simulation results prove accuracy of the proposed analytical model and effectiveness of MBAC scheme.     

Performance Analysis of the Advanced Infrared (AIr) CSMA/CA MAC Protocol for Wireless LANs

Advanced Infrared (AIr) is a proposed standard of the Infrared Data Association (IrDA) for indoor infrared LANs. AIr Medium Access Control (MAC) employs Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) techniques with Request To Send/Clear To Send (RTS/CTS) frame exchange to address the hidden station problem. A long Collision Avoidance Slot (CAS) duration, that includes the beginning of the CTS frame, is defined to cope with collisions caused from hidden stations. AIr MAC employs linear adjustment of the Contention Window (CW) size to minimize delays emerging from the long CAS duration. This paper provides a simple and accurate analytical model for the linear CW adjustment that calculates AIr throughput assuming a finite number of stations and error free channel transmissions. Validity of the model is verified by comparing analysis with simulation results. By examining the first derivative of the throughput equation, we derive the optimum CW size that maximizes throughput as a function of the network size. In the case of the AIr protocol, where a collision lasts exactly one CAS, different conclusions result for maximum throughput as compared with the corresponding conclusions for the similar IEEE 802.11 protocol. Using the proposed model, we present an extensive AIr throughput performance evaluation. The effectiveness of physical and link layer parameters on throughput performance is explored. The proposed long CAS duration combined with CW linear adjustment are proven quite effective. Linear CW adjustment combined with the long CAS duration offer an efficient collision avoidance scheme that does not suffer from collisions caused from hidden stations.     

High-throughput time group access MCR-SS-CSMA/CA for wireless ad hoc networks with layered-tree topology

Multi-hop packet transmission error due to packet collision is a serious issue for realizing large-scale wireless ad hoc networks. In order to solve the issues, a multicode-reception spread-spectrum (MCR-SS)-CSMA/CA scheme is proposed as multiple access scheme for layered-tree networks. This scheme is further improved by adding a time group access (TGA) technique to gain higher interference reduction between nodes. The proposed TGA scheme divides the layered-tree network into upper subnets group and lower subnets group, thus reducing collision probability among subnets. Network throughput and data delivery ratio for the proposed scheme are analyzed by simulations based on the IEEE 802.15.4/ZigBee specification. Simulation results show that the proposed schemes can improve packet delivery ratio and network throughput remarkably.     

A Beacon-Based Collision-Free Channel Access Scheme for IEEE 802.11 WLANs

In IEEE 802.11 based WLAN standard, distributed coordination function is the fundamental medium access control (MAC) technique. It employs a CSMA/CA with random binary exponential backoff algorithm and provides contention-based distributed channel access for stations to share the wireless medium. However, performance of this mechanism drops dramatically due to random structure of the backoff process, high collision probability and frame errors. That is why development of an efficient MAC protocol, providing both high throughput for data traffic and quality of service (QoS) support for real-time applications, has become a major focus in WLAN research. In this paper, we propose an adaptive beacon-based collision-free MAC adaptation. The proposed scheme makes use of beacon frames sent periodically by access point, lets stations enter the collision-free state and reduces the number of idle slots regardless of the number of stations and their traffic load (saturated or unsaturated) on the medium. Simulation results indicate that the proposed scheme dramatically enhances the overall throughput and supports QoS by reducing the delay, delay variation and dropping probability of frames.     

L-RUBI: An efficient load-based resource utilization algorithm for bi-partite scatternet in wireless personal area networks

Recently, much of the wireless personal area network (WPAN) research concerns network protocols, scheduling, and security challenges but the major issue of resource utilization has been very rarely investigated. The design of resource sharing in a network gets more attention when the number of users increases. While optimizing performance, resource utilization plays a critical role. In this paper, the numerical performance of a wireless resource utilization algorithm for a bi-partite scatternet is presented. This algorithm is focused to enhance the bandwidth allocation and power utilization of wireless scatternets. Every node can communicate with a single neighbor at a time with minimum resources. Finally, the performances of the RUBI algorithm are shown. This algorithm is compared with the existing algorithms such as the load adaptive scheduling algorithm and pseudorandom coordinated scheduling scheme in terms of various parametric metrics like reliability, throughput, collision probability, transmission probability, and signal-to-noise ratio (SINR). The proposed L-RUBI achieves 93.4% of reliability, 93.6% of transmission probability, 91.4% of throughput, 76.8% of collision performance, and 72.2% SINR.     

An adaptive opportunistic retransmission control scheme environment-aware-based for wireless multimedia Mesh networks

In this paper, we propose an aware-based adaptive opportunistic retransmission control scheme for wireless multimedia Mesh networks. The proposed scheme provides maximum retransmission count optimization based on environment-aware to improve packet relay probability. The scheme discriminates the types of packet loss in wireless link by means of environment information and selects the retransmission count by taking the IEEE 802.11 wireless channel characteristics into consideration. Furthermore, the maximum retransmission count of MAC is adjusted adaptively. Extensive simulations demonstrate that the proposed scheme significantly reduces packet collision probability and packet loss rate, and thus improves network throughput.     

一种环境感知的无线Mesh网络自适应QoS路径选择算法

本文针对如何改善无线多跳Mesh网络的服务质量,满足无线多媒体业务对数据传输的带宽、时延、抖动的要求等问题,研究了一种基于无线信道状态和链路质量统计的MAC层最大重传次数的自适应调整算法。该算法通过对无线Mesh网络的无线信道环境的动态感知,利用分层判断法区分无线分组丢失的主要原因是无线差错还是网络拥塞导致,实时调整MAC层的最佳重传次数,降低无线网络中的分组冲突概率。基于链路状态信息的统计和最大重传策略,提出了一种启发式的基于环境感知的QoS路由优化机制HEAOR。该算法通过动态感知底层链路状态信息,利用灰色关联分析法自适应选择最优路径,在不增加系统复杂度的基础上,减少链路误判概率,提高传输效率。NS2仿真结果表明,HEAOR算法能有效减少重路由次数,降低链路失效概率,提高网络的平均吞吐率。本文提出的方法不仅能够优化MAC层的重传,而且通过发现跨层设计的优化参数实现对路径的优化选择。      

A new scheme to achieve weighted fairness for WLAN supporting multimedia services

This work presents a new scheme which exploits differentiations of both inter frame space (IFS) and contention window (CW) to achieve weighted fairness for two classes of services under enhanced distributed channel access (EDCA) mode in an 802.11e WLAN. Given the arbitration IFSs (AIFSs), the proposed scheme can properly set the corresponding CWs such that the ratio of the two classes' successful transmission probabilities can attain a pre-defined weighted-fairness goal. Additionally, the throughput and delay of the two classes of services are derived. The simulation results compare well with the analytical results. Also, the analytical results illustrate that the proposed scheme can achieve a fairness index very close to 1 and attain a greater aggregate throughput with lower collision probability than the CW differentiation scheme presented in A. Banchs and X. Perez (2002), for a specified weighted-fairness goal.     

Performance Analysis for a New Medium Access Control Protocol in Wireless LANs

One fundamental issue in high-speed wireless local area networks (LANs) is to develop efficient medium access control (MAC) protocols. In this paper, we focus on the performance improvement in both MAC layer and transport layer by using a novel medium access control protocol for high-speed wireless LANs deploying carrier sense multiple access/collision avoidance (CSMA/CA). We first present a recently proposed distributed contention-based MAC protocol utilizing a Fast Collision Resolution (FCR) algorithm and show that the proposed FCR algorithm provides high throughput and low latency while improving the fairness performance. The performance of the FCR algorithm is compared with that of the IEEE 802.11 MAC algorithm via extensive simulation studies on both MAC layer and transport layer. The results show that the FCR algorithm achieves a significantly higher efficiency than the IEEE 802.11 MAC and can significantly improve transport layer performance.     

Exploiting the channel using uninterrupted collision‐free MAC adaptation over IEEE 802.11 WLANs

IEEE 802.11 wireless local area networks (WLANs) have reached an important stage and become a common technology for wireless access due to its low cost, ease of deployment, and mobility support. In parallel with the extensive growth of WLANs, the development of an efficient medium access control protocol that provides both high throughput performance for data traffic and quality of service support for real‐time applications has become a major focus in WLAN research. The IEEE 802.11 Distributed Coordination Functions (DCF/EDCA) provide contention‐based distributed channel access mechanisms for stations to share the wireless medium. However, performance of these mechanisms may drop dramatically because of high collision probabilities as the number of active stations increases. In this paper, we propose an adaptive collision‐free MAC adaptation. The proposed scheme prevents collisions and allows stations to enter the collision‐free state regardless of the traffic load (saturated or unsaturated) and the number of stations on the medium. Simulation results show that the proposed scheme dramatically enhances the overall throughput and supports quality of service for real‐time services over 802.11‐based WLANs. Copyright © 2013 John Wiley & Sons, Ltd.     

一种自适应的无线射频识别系统中的防冲突算法(英文)

A novel anti-collision algorithm in RFID wireless network is proposed.As it is put forward on the basis of collision tree(CT)and improved collision tree(lCT) anti-collision protocols,we call it adaptive collision tree protocol(ACT).The main novelty of this paper is that the AD strategy is introduced and used in ACT to decrease collisions and improve the tag system throughput.AD strategy means that query strings will divide into two or four branches adaptively according to the label quantity.This scheme can decrease both depth of query and collision timeslots,and avoid producing too much idle timeslots at the same time.Both theoretical analysis and simulation results indicate that the novel proposed anticollision protocol ACT outperforms the previous CT and ICT protocols in term of time complexity,system throughput,and communication complexity.     

Throughput and Delay Analysis of IEEE 802.11 DCF in the Presence of Hidden Nodes for Multi-hop Wireless Networks

Hidden node collision in a contention-based medium access control protocol contributes to poor wireless network performance. This paper extended the Bianchi’s study and introduces a mathematical model that can be used to calculate throughput and delay for the IEEE 802.11 distributed coordination function of a multihop wireless network infrastructure assuming the presence of hidden node collision. This research investigates three essential parameters of multi-hop wireless networks. More specifically, this paper aims to analyze the effect of hidden nodes, network size, and maximum backoff stage on the overall system throughput and packet delay. Results clearly reveal the effect of large wireless network size, maximum backoff stage, and collision probability on throughput and packet delay. On one hand, throughput does not depend on the maximum backoff stage (m) for a small network size (e.g., n \(=\) 10). On the other hand, throughput does not strongly depend on the number of nodes when the backoff stage values are high. Comparing our proposed model in case single-hop with the Bianchi model, the analysis results indicate that the throughput values in our model when the numbers of nodes are 10, 50, and 100 are 0.6031, 0.4172 and 0.3433 respectively; whereas the throughput values are respectively 0.8370, 0.8317 and 0.8255 at the same number of nodes for the Bianchi model. The difference can be attributed to several assumptions made in our proposed model that were not considered in the Bianchi model.     

Throughput Maximization in Cognitive Radio System with Transmission Probability Scheduling and Traffic Pattern Prediction

In this paper, we propose a novel transmission probability scheduling (TPS) scheme for the opportunistic spectrum access based cognitive radio system (OSA-based CRS), in which the secondary user (SU) optimally schedules its transmission probabilities in the idle period of the primary user (PU), to maximize the throughput of the SU over a single channel when the collision probability perceived by the PU is constrained under a required threshold. Particularly, we first study the maximum achievable throughput of the SU when the proposed TPS scheme is employed under the assumption that the distribution of the PU idle period is known and the spectrum sensing is perfect. When the spectrum sensing at the SU is imperfect, we thoroughly quantify the impact of sensing errors on the SU performance with the proposed TPS scheme. Furthermore, in the situation that the traffic pattern of the PU and its parameters are unknown and the spectrum sensing is imperfect, we propose a predictor based on hidden Markov model (HMM) for the proposed TPS scheme to predict the future PU state. Extensive simulations are conducted and show that the proposed TPS scheme with the HMM-based predictor can achieve a reasonably high SU throughput under the PU collision probability constraint even when the sensing errors are severe.     

IEEE 802.11无线网络的两步指数退避算法

IEEE 802.11标准引入二进制指数退避(Binary Exponential Backoff, BEB) 算法以降低节点发送数据包碰撞的概率。然而,BEB存在着不足之处,当数据包碰撞概率较大时,节点的竞争窗口长度会出现振荡,即节点每次发送数据包之前,需要多次加倍扩大竞争窗口长度,而在发送成功之后又把竞争窗口长度缩小到最小值,这个过程反复出现。为了克服竞争窗口振荡问题以增加吞吐量,该文提出两步指数退避(Two-step BEB, TBEB)算法,利用2维马尔可夫链进行建模,导出TBEB算法中节点的退避状态概率分布、平均竞争窗口长度、平均退避次数、每发送一个数据帧所耗时间以及吞吐量等指标,并通过仿真进行验证。通过求解一个简单的优化问题,TBEB可以获得最优竞争窗口长度复位值,使吞吐量达到最优。     

An Efficient Backoff Algorithm for IEEE 802.15.4 Wireless Sensor Networks

IEEE 802.15.4 is one of the most prominent MAC protocol standard designed to achieve low-power, low-cost, and low-rate wireless personal area networks. The contention access period of IEEE 802.15.4 employs carrier sense multiple access with collision avoidance (CSMA/CA) algorithm. A long random backoff time causes longer average delay, while a small one gives a high collision rate. In this paper, we propose an efficient backoff algorithm, called EBA-15.4MAC that enhances the performance of slotted CSMA/CA algorithm. EBA-15.4MAC is designed based on two new techniques; firstly, it updates the contention window size based on the probability of collision parameter. Secondly, EBA-15.4MAC resolves the problem of access collision via the deployment of a novel Temporary Backoff (TB) and Next Temporary Backoff (NTB). In this case, the nodes not choose backoff exponent randomly as mentioned in the standard but they select TB and NTB values which can be 10–50 % of the actual backoff delay selected by the node randomly. By using these two new methods, EBA-15.4MAC minimizes the level of collision since the probability of two nodes selecting the same backoff period will be low. To evaluate the performance of EBA-15.4MAC mechanism, the network simulator has been conducted. Simulation results demonstrate that the proposed scheme significantly improves the throughput, delivery ratio, power consumption and average delay.     

Design and performance analysis on adaptive reservation-assisted collision resolution protocol for WLANs

In conventional IEEE 802.11 medium access control protocol, the distributed coordination function is designed for the wireless stations (WSs) to perform channel contention within the wireless local area networks (WLANs). Packet collision is considered one of the major issues within this type of contention-based scheme, which can severely degrade network performance for the WLANs. Research work has been conducted to modify the random backoff mechanism in order to alleviate the packet collision problem while the WSs are contending for channel access. However, most of the existing work can only provide limited throughput enhancement under specific number of WSs within the network. In this paper, an adaptive reservation-assisted collision resolution (ARCR) protocol is proposed to improve packet collision resulting from the random access schemes. With its adaptable reservation period, the contention-based channel access can be adaptively transformed into a reservation-based system if there are pending packets required to be transmitted between the WSs and the access point. Analytical model is derived for the proposed ARCR scheme in order to evaluate and validate its throughput performance. It can be observed from both analytical and simulation results that the proposed protocol outperforms existing schemes with enhanced channel utilization and network throughput.