# Performance Analysis of Binary Exponential Backoff and Improved Backoff for WPAN

- S. Mehta
^{1}Email author and - K.S. Kwak
^{1}

**2010**:697535

https://doi.org/10.1155/2010/697535

© S. Mehta and K. S. Kwak. 2010

**Received: **1 August 2009

**Accepted: **8 October 2009

**Published: **18 January 2010

## Abstract

The IEEE 802.15.3 medium access control (MAC) is proposed, especially, for wireless personal area network (WPAN) short and high data rates applications, to coordinate the access to the wireless medium among the competing devices. A concept of a geometrically increasing probability distribution for contention process was brought up in the work of Tay et al. (2004). In this paper, we adopt this idea as improved backoff (IB) for contention process of IEEE 802.15.3, where binary exponential backoff (BEB) is originally used. Here, we propose an analytical model for IB and compared both BEB and IB for saturated and nonsaturated traffic conditions. Furthermore, our research results demonstrate that IB provides an edge over BEB in terms of channel efficiency, channel access delay, and energy efficiency.

## Keywords

## 1. Introduction

The IEEE standard 802.15.3 MAC or WPAN MAC layer [1] is based on a centralized, connection oriented topology which divides a large network into several smaller ones termed "piconets." A piconet consists of a Piconet Network Controller (PNC) and DEVs (DEVices). One DEV is required to perform the role of PNC (Piconet Coordinator), which provides the basic timing for the piconet as well as other piconet management functions, such as power management, Quality of Service (QoS) scheduling, and security. The standard also allows for the formation of child piconets and neighbor piconets. In IEEE 802.15.3 MAC protocol, the channel time is divided into superframes, where each superframe beginning with a beacon. The superframe is composed of the three major parts: the beacon, the optional contention access period (CAP), and the channel time allocation period (CTAP) or channel time allocation time (CTA). Wireless channel is usually vulnerable to errors. Hence, error control mechanism is an essential part of any MAC protocol design. In accordance with that, IEEE 802.15.3 standard defines three types of acknowledgment mechanisms for CTAs and CAPs: the No-ACK, Imm-ACK, and Dly-ACK mechanisms [1].

During the CAP time devices request for reservation in CTA and also send data packets if needed. So the time length of CAP is dynamic and it is determined by the PNC. Longer the duration of CAP time is, more the number of devices will send their CTA slot requests and causes less time for CTA slots. Hence, it is important to improve the performance for both data and request packets transmission within limited time frame of CAP. In our previous work [2] we present the detail performance analysis of WPAN MAC and identified some key issues to improve the MAC performance, especially, for CAP duration. In this paper, we limit our research focus on improving the performance of CAP using IB instead of BEB during the contention process, and hence, overall WPAN MAC performance. During the CAP, MAC protocol performs backoff procedure before transmitting any kind of data or request packets. This backoff mechanism is similar to CSMA/CA mechanism of IEEE 802.11 with some different parameters. In WAPN MAC, retry count is limited up to 3 counts (0 to 3) with maximum window size of 64 slots (8, 16, 32, and 64).

### 1.1. Related Work

To the best of our knowledge, there is no work on the performance or channel analysis of IEEE 802.15.3 networks with respect to contention-based scheme during the CAP time.

However, a large amount of literature is available on IEEE 802.15.3 MAC scheduling, optimization of superframe size, and various traffic analyses. Some of the important related works are as follow.

In [3] the authors presented the implementation of IEEE 802.15.3 module in ns-2 and discussed various experimental scenario results including various scheduling techniques. Specially, to investigate the performance of real-time and best-effort traffic with various super frame lengths and different ACK policies. In [4] the authors presented two adaptive Dly-ACK schemes for both TCP and UDP traffic. The first one is to request the Dly-ACK frame adaptively or change the burst size of Dly-ACK according to the transmitter queue status. The second is a retransmission counter to enable the destination DEV to deliver the MAC data frames to upper layer timely and orderly. Similarly, the work presented in [5] also discussed about different acknowledge schemes and optimization of channel capacity. Both papers [4, 5] laid a good foundation in simulation and analytical works of IEEE 802.15.3 MAC protocol. In [6] the authors formulated a throughput optimization problem under error channel condition and derive a closed form solution for the optimal throughput. Similarly, in [2] the authors presented a detailed performance analysis of WPAN with different designing parameters as well as with different ACK policies and aggregation method.

- (i)
To apply the geometrically increasing distribution as IB to IEEE 802.15.3 MAC.

- (ii)
To introduce Markov Chains for BEB and IB in WPAN MAC.

- (iii)
To model the saturation and nonsaturation traffic conditions.

- (iv)
To present a comparison of BEB and IB for a medium access scheme.

- (v)
To present the detail performance evaluation study in terms of channel efficiency, channel access delay, and energy efficiency to compare BEB and IB.

The rest of the paper is outlined as follows. In Section 2 we describe the BEB and IB medium access schemes. In Section 3, we present the analytical modeling of BEB and IB schemes and in-depth performance analysis in Section 4. Finally, conclusions are drawn in Section 5.

## 2. BEB and IB Schemes

### 2.1. BEB Scheme

BEB-based carrier sense multiple access with collision avoidance (CSMA/CA) is the most basic and widely used mechanism for MAC protocol. In WPAN MAC, if the channel is idle for backoff interframe space (BIFS) or short interframe space (SIFS) the DEV starts executing the BEB scheme. At each packet transmission, the backoff counter is uniformly selected from the given range of [0, CW-1] (in rest of the paper we keep using terms "DEV" and "node" interchangeably). Here, CW is known as contention window and its value depends on the number of failed transmissions for the packet. At the first transmission attempt, CW is set to minimum value of 8 and if transmission attempt fails then its value gets double, and again set to minimum value on successful transmission. In WPAN MAC, the maximum contention window value is set to 64 with the maximum retry limit up to 3 counts. After selecting CW node decrement its value by 1 as long as channel is sensed idle and freeze its value when channel is sensed busy.

- (i)
Traditional backoff takes time for (Contention Window) CW to correctly adapt to the right value when the active population (of nodes) is large(here, traditional backoff procedure means CSMA/CA scheme with binary exponential backoff (BEB), unless and otherwise specified).

- (ii)
The MAC protocol latency performance is high if CW is large.

- (iii)
A station that successfully transmits resets its CW to a small, fixed minimum value of CW. Consequently, the node has to rediscover the correct CW, wasting some precious bandwidth.

- (iv)
Traditional backoff algorithm could not take the advantage of shared learning when number of nodes is increasing.

- (v)
Traditional back-off's success probability degrades with increasing number of nodes.

- (vi)
Traditional back-off is also not suitable for power saving networks' application.

In nutshell, during the CAP, backoff window size and the number of active nodes are the major factors to have impact on the throughput performance. The BEB scheme does not work well when we are interested in the high bandwidth utilization, latency, and energy efficiency. These observations and result lead us to use new medium access scheme for IEEE 802.15.3 MAC. So to improve the channel performance during the CAP time, we use a fixed-size contention window, but a nonuniform, geometrically increasing probability distribution for picking a transmission slot in the contention window interval.

### 2.2. IB Scheme

*P*) for picking a transmission slot in the contention window. Nodes which are executing IB scheme pick a slot in the range of (1, CW) with the probability distribution

*P*. Here, CW is contention window and its value is fixed. More information on CW we will be presenting in the later sections of this paper. Figure 2 shows the probability distribution

*P*. The higher slot numbers have higher probability to get selected by nodes compared to lower slot numbers. In physical meaning we can explain this as follows. At the start node select a higher slot number for its CW by estimating large population of active nodes (

*n*) and keep sensing the channel status. If no nodes transmit in the first or starting slots then each node adjusts its estimation of competing nodes by multiplicatively increasing its transmission probability for the next slot selection cycle. Every node keeps repeating the process of estimation of active nodes in every slot selection cycle and allows the competition to happen at geometrically decreasing values of

*n*all within the fixed contention window (CW).

In contrast to the probability distribution*P*, in uniform distribution, as shown in Figure 2, all the contending nodes have the same probability of transmitting in a randomly chosen time slot. From Figure 2, in the probability distribution*P,* we can depict that when the population of competing nodes (*n*) is large, most of the nodes will choose medium to higher slot numbers of CW before accessing the channel and a very few nodes will choose low slot numbers, hence, a collision-free transmission will take place in lower slot numbers. When *n* is medium, most nodes will choose higher slot numbers and a collision-free transmission will take place in medium slot numbers. Similarly, when *n* is small, a collision-free transmission will take place in higher slot numbers. Thus for any value of n, and for any fast change in *n*, a collision free transmission can take place. These special characteristics of IB give the advantage over the BEB in terms of different performance metrics. If only one node gets the chance to select the contention slot within the fixed CW, it will transmit in that slot. While other nodes will select new random contention slots for next contention process, to win channel medium, regardless of success or failure of transmission of winner node.

*P*. Then slot define an idle slot if no nodes choose it, and also as a collided slot if more than one node chooses it. A node can get the chance to transmit if it is the only node to choose slot . As we mentioned earlier IB uses a truncated, increasing geometric distribution, as presented in [7], and is given by

where is a distribution parameter. In this range of increases exponentially with , so the later slots have higher probability. Here, it is worth to note that IB scheme does not use timer suspension like in IEEE 802.11 to save energy and reduce latency in case of a collision. The only problem with the IB is fairness, however, for WPAN MAC, especially, during CAP fairness is not an issue as every node do not have request packet for PNC for every time. For the general wireless communication scenario we need fairness mechanism, which we left to our future research investigation.

## 3. Analytical Modeling

In this section we present the general frame work to model the backoff algorithms. This frame work basically consists of three steps: finding the attempting probability for a node in backoff, finding the transition probability for a given channel state, and model the stationary probabilities of the channel state for required protocol details. Here we also model channel efficiency, channel access delay, and energy efficiency with these three basic steps (In this paper, we use terms "algorithm," "scheme," and "method" interchangeably.

### 3.1. Approach and Assumptions

Most of the studies on backoff algorithm (BA) are focused on the stability issue rather than performance analysis of backoff algorithm. In this paper our main focus is to analyze and compare the performance of both IB and BEB with respect to network load in steady-state condition. Here, we define network load in terms of the number of nodes that are contending for the access medium. Another approach is to consider total arrival packet rate to the network as an offered load. The main purpose of BA is to reduce the effect of contention among the nodes and try to adopt the population of nodes so the number of nodes contending for medium is a more favorable way to define an offered load for analyzing BA. Here, we assume a fixed number of nodes in saturated and nonsaturated conditions. Saturation conditions mean every node always has a packet to transmit and similarly in nonsaturation case every node receives a packet with probability . More on saturation and nonsaturation will be explained later. The channel is an ideal and introducing no errors to the reception of a packet other than collision. Also, capture effect is not considered.

The BA performed in a time-slotted fashion. A node attempts to attain the access the channel only at the beginning of a slot. Furthermore, all nodes are well synchronized in time slots and propagation delay is negligible compared to the length of an idle slot.

### 3.2. BEB and IB Analytical Modeling

As shown in Figure 3 let *j* denote the backoff stage, where
, 1, 2, 3 (assuming immediate acknowledgement for a data/request packet). So, we have
,
,
, and
. Let
be defined as a random process representing the backoff counter of a node with
representing random process of the back stage
.
is decremented at the start of every idle backoff slot. It is important to note that time scale for
does not represent real time but it observes only backoff slots and its suspended for the duration of all transmissions and interframe spaces (i.e., SIFS). And whenever
reaches zero the station transmits and regardless of the outcome of the transmission, uniformly chooses a new value for
from (
) (i.e., new backoff counter value). Here, we define
as the conditional collision probability and we also assume that it is independent and constant, regardless the number of retransmissions attempted.
also represents the probability of detecting the channel busy. Thus, the two-dimension process,
is a discrete-time Markov Chain. Therefore, the state of each node is described by
, where
stands for the backoff stage, and
stands for the backoff timer value. In addition to normal state diagram we also add 2 extra states to model the nonsaturation traffic condition. A node may now wait in the idle state for a packet from upper layers before going into backoff procedure. This corresponds to a delay in the idle state and it is represented by upper left two sates in the Figure 3. The delay in the idle state is modeled geometric with parameter
. The state transition diagram of the Markov chain model shown in Figure 3 has the following transition probabilities:

The first equation in (2) indicates that at the beginning of each slot time, the backoff counter is decremented if the channel is sensed idle. The second equation shows that the backoff counter is frozen if channel is sensed busy. The third and fourth equations, respectively, indicate that following an unsuccessful transmission, the node backoff stage selects a backoff interval uniformly in the range of (0, ) and when the backoff stage reaches , stays constant. The rest of the equations shows the transition probabilities for two extra sates we added. Here, we take to introduce 2 extra states. These transition probabilities are straightforward to understand, as shown in Figure 3.

*j*represents the backoff stage ( , in IB) and represents the back of timer value ( , in IB). Here, and represent the collision probability and the probability of detecting the channel busy, respectively. Therefore, Figure 4 shows the one-dimension discrete-time Markov Chain for IB at an individual node. In this Markov Chain, the nonnull one step transition probabilities are as follows:

The first equation in (3) indicates the backoff counter which is decremented if the channel is sensed idle. The second equation indicates that the node defers the transmission of a new frame and enters stage 0 of the backoff procedure if it detects a successful transmission of its current frame or finds the channel busy or if it detects that a collision occurred to its current not successfully transmitted frame. The third equation indicates that the node selects a backoff interval nonuniformly in the range of (1, CW) following an unsuccessful transmission.

#### 3.2.1. Channel Efficiency Analysis

In BEB, let be the stationary distribution of the Markov chain [8, 9]. Let be the probability that a node transmits during a generic slot time. A node transmits when its backoff counter reaches zero. Similar to [8, 9] is given by

and as we mentioned earlier and shown in Figure 3, with nonsaturation traffic condition is given by

*n*denote the number of nodes. Equations (4) and (6) are from a nonlinear system with two unknowns and . This nonlinear system can be solved using numerical methods. Figure 5 shows the plot of as a function of with various values of CW and

*n*. This graph is plotted with

*m*, the retry limit equal zero. As shown in Figure 5 the unique intersection of (4) and (6) gives us the value of and for given CW and

*n*. The plot shows and converging to 0.5 and zero, respectively, as the number of nodes increases [10]. Similarly, we can obtain the solution for and when retry limit, , is and traffic condition is nonsaturated (i.e., ) (more information on this is discussed later).

Let define as the probability that there is not a single transmission in a slot and is given by

It is important to note that a collision occurs if there are multiple nodes transmitting in the same time slot. Thus, the probability that a collision will occur in a time slot and is given by (the probability is different from the conditional collision probability ( ). denote the probability that a slot is busy with collision, where denote the probability that a collision is seen by a packet being transmitted on the channel.)

To understand (11) readers are advised to refer Figure 2 where the different values of with different values of are plotted. Now similar to BEB scheme, we can define the probabilities of busy medium, idle medium, and successful transmission in a time slot in IB scheme, respectively, as follows:

Now, the probability of collision in IB is given by

Using aforementioned equations we can define the channel efficiency as the fraction of time that the channel is used for successful transmission. The time that the channel remains empty or busy with collision is wasted. Here, successful transmission includes data/request frame with an acknowledgement. The channel efficiency for BEB scheme is given by

Here, is constant and defined in the standard (of duration ), and are the average time duration of successful transmission and collision, respectively. The duration of successful and collision slots are similar; hence the duration of a collision can be approximated to the duration of a successful slot . and are given by (both are same in case of BEB and IB)

where
is the frame header and *P* is the propagation delay.
is the duration of data packet or request packet. Using this approximation and (7), (8), and (9), we can simplify (14) as

In a same way, simplified channel efficiency for IB is given by

#### 3.2.2. Delay Analysis

Here, medium access delay is defined as the time elapsed between the generation of a frame and its successful reception. Let *D* be the medium access delay and let
indicate its mean value. Then,
is given by

where represents average number of collisions of a frame until its successful reception. represents average backoff delay spent by a node before accessing the medium in busy channel condition and represents the time that a node has to wait before sensing the channel again in case of its frame collision. Now is given by

where is the average backoff value and is the average number of times that a node freezes its counter before reaches state 0. Equation (16) is applicable for both IB and BEB, however in IB it is given by

In IB, backoff counter is not suspended if a node detects transmissions from other nodes before its counter reaches state 0 but it takes new value of backoff counter for next attempt (IB has a fixed contention window range). In case of BEB and IB, *E*[
] is given by

where is the mean number of consecutive idle slot times before a transmission starts. In IB, is calculated simply by mean of geometrically increasing distribution with fixed interval. Finally, the time depends on the access method and is given by

#### 3.2.3. Energy Efficiency Analysis

In this subsection we consider only two power levels, and . We assume that a node consumes power for transmitting and for being idle and listening. Total power consumption to transmit a data/request packet is given by

where , , , and represent energy consumption in backoff stage, over hearing in backoff stage, energy consumption for successful transmission, and energy consumption in collision, respectively. We define the energy efficiency as energy required to successfully transmit one bit of data/request packet and is given by

where*L* is the length of data/request payload. The energy consumption when backoff is decrementing,
, is given by

where slot is the duration of an idle slot (of duration ). The energy consumption when overhearing other nodes' transmission during the backoff procedure is given by

In case of IB method will be different from (22). The energy consumption for successful transmission is given by

The energy consumption due to collision is given by

Energy efficiency model is valid for both BEB and IB methods.

## 4. Performance Evaluation

In this subsection we present the performance analysis of BEB and IBA in terms of channel efficiency, medium access delay, and energy efficiency. For the performance analysis we carried out simulation in Matlab [11]. During CAP time nodes will send only request packets to PNC and PNC will assign them available slots in following CTA cycle. This assumption is reasonable as most of the data packet transmissions carried out in CTA slots. The main parameters for our simulation are based on [12] and listed in Table 1. For calculating the energy consumption in nodes we choose ratio of idle: listen: transmit as , as measured in [13]. For the simulation results we does not consider the technology adopted at the Physical layer; however the physical layer determines some network parameter values such as interframe spaces. Whenever necessary we choose the values of the physical layer dependent parameters by referring to [12]. In our simulation maximum number of nodes is 100. (Here, we choose 100 nodes according to [5] as the maximum possible number of contending nodes during a CAP frame.)

Results shown in Figures 7 and 8 are similar to those in Figure 6 except for CW = 8. In the nonsaturation case, especially for low *n*, competition for cannel access is low so the graph for CW = 8 is initially starting from low value, reaching to maximum, and again it starts decreasing. Form these figures we can also fine the optimum value of CW for given a value of *n*.

In WPAN MAC, due to much smaller minimum contention window and the retry limit , the collision probability could be very high when *n* is large. The request packets are more likely to drop and thus fewer requests can be successfully transmitted. If the request packets are dropped in the cap, the nodes need to reinitiate the request packets in the following superframe, which degrades the network performance due to waste of network resources by retransmission and collision. Accepting IB as backoff scheme can increase the overall performance of WPAN MAC protocol to a large extends as shown in the aforementioned results.

### 4.1. Applicability and Extendibility of the Analytical Model

In this paper, we present the in-depth mathematical analysis of BEB and IB methods for WPAN MAC to evaluate the performance of a WPAN. Form the obtained results we can tune the value of CW if we know the population of n. In case of WPAN MAC where PNC controls the piconet, it is possible to know the number of contenders available in a network. The analysis presented in this paper is an analysis of BEB with an assumption of steady sate. A sudden change of the offered load will cause change of the state; however, IB can easily absorb the new change with stability. So the analytical model of IB presented in the paper is easily applicable to large-scale sensor networks to improve the latency and energy efficiency while maintaining a good throughput. Furthermore, it is also possible to extend our models for erroneous channel conditions and general wireless networks (i.e., IEEE 802.11) with a proper fairness mechanism.

## 5. Conclusions

## Authors’ Affiliations

## References

- P802.15.3/D17 :
*(C/LM) Standard for Telecommunications and Information Exchange Between Systems—LAN/MAN Specific Requirements—Part 15.3: Wireless Medium Access Control (MAC) and Physical Layer (PHY) Specifications for High Rate Wireless Personal Area Networks*. February 2003.Google Scholar - Mehta S, Kwak KS:
*Capacity analysis of IEEE 802.15.3 MAC protocol.*UWB Research Center, South Korea; May-June 2008.Google Scholar - Chin K-W, Lowe D: Simulation study of the IEEE 802.15.3 MAC.
*Proceedings of the Australian Telecommunications and Network Applications Conference (ATNAC '04), 2004, Sydney, Australia*Google Scholar - Chen H, Guo Z, Yao R, Li Y: Improved performance with adaptive Dly-ACK for IEEE 802.15.3 WPAN over UWB PHY.
*IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences*2005, E88-A(9):2364-2372. 10.1093/ietfec/e88-a.9.2364View ArticleGoogle Scholar - Tseng Y-H, Wu EH-K, Chen G-H: Maximum traffic scheduling and capacity analysis for IEEE 802.15.3 high data rate MAC protocol.
*Proceedings of the IEEE Vehicular Technology Conference (VTC '03), October 2003, Orlando, Fla, USA*3: 1678-1682.Google Scholar - Xaio Y, Shen X, Jiang H: Optimal ACK mechanisms of the IEEE 802.15.3 MAC for ultra-wideband systems.
*IEEE Journal on Selected Areas in Communications*2006, 24(4, part 1):836-842.View ArticleGoogle Scholar - Tay YC, Jamieson K, Balakrishnan H: Collision-minimizing CSMA and its applications to wireless sensor networks.
*IEEE Journal on Selected Areas in Communications*2004, 22(6):1048-1057. 10.1109/JSAC.2004.830898View ArticleGoogle Scholar - Bianchi G: Performance analysis of the IEEE 802.11 distributed coordination function.
*IEEE Journal on Selected Areas in Communications*2000, 18(3):535-547. 10.1109/49.840210View ArticleGoogle Scholar - Ergen M, Varaiya P: Throughput analysis and admission control for IEEE 802.11a.
*Mobile Networks and Applications*2005, 10(5):705-716. 10.1007/s11036-005-3364-9View ArticleGoogle Scholar - Kwak BJ, Song NO, Miller LE: Perfoamnce analysis of exponential backoff.
*IEEE/ACM Trasection on Networking*2005, 13(2):343-355.View ArticleGoogle Scholar - http://www.mathworks.com/products/matlab/
- Harada H, et al.: IEEE P802.15 working group for wireless personal area networks (WPANs). IEEE P802.15 Working Group for Wireless Personal Area Networks (WPANs) DOC: IEEE 802.15-07-0761-05-003c, July 2007Google Scholar
- Stemm M, Katz RH: Measuring and reducing energy consumption of network interfaces in hand-held devices.
*IEICE Transactions on Communications*1997, E80-B(8):1125-1131.Google Scholar

## Copyright

This article is published under license to BioMed Central Ltd. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.