# The Performance Evaluation of an IEEE 802.11 Network Containing Misbehavior Nodes under Different Backoff Algorithms

Authors: Trong-Minh Hoang; Van-Kien Bui; Thanh-Tra Nguyen
Journal: Security and Communication Networks
 (2017)

---

## Abstract

Security of any wireless network is always an important issue due to its serious impacts on network performance. Practically, the IEEE 802.11 medium access control can be violated by several native or smart attacks that result in downgrading network performance. In recent years, there are several studies using analytical model to analyze medium access control (MAC) layer misbehavior issue to explore this problem but they have focused on binary exponential backoff only. Moreover, a practical condition such as the freezing backoff issue is not included in the previous models. Hence, this paper presents a novel analytical model of the IEEE 802.11 MAC to thoroughly understand impacts of misbehaving node on network throughput and delay parameters. Particularly, the model can express detailed backoff algorithms so that the evaluation of the network performance under some typical attacks through numerical simulation results would be easy.


---

## Body

## 1. Introduction

IEEE 802.11 based wireless networks are presented as one of the most widely deployed wireless technologies in the world to provide many applications for both special and commercial domains nowadays. The original IEEE 802.11 MAC layer employs the carrier sense multiple access/collision avoidance (CSMA/CA) protocol with binary exponential backoff algorithm to get fair multiple access [1]. To enhance the performance, several alternative backoff algorithms were proposed in recent years. Among them, the Exponential Increase Exponential Decrease (EIED) backoff algorithm can be substituted for BEB in some scenarios due to its good performance [2, 3].Likely characteristics of common wireless networks, network performance of the IEEE 802.11 based network can be violated by several native or smart attacks from both inside or outside aspects. Particularly, the backoff procedure in a node can be affected by attacks that make a normal node become a malicious node, in which, backoff freezing problem comes to the serious issue while stopping backoff process of several nodes around the malicious node. However, to the best of our knowledge, previous analytical models did not consider the backoff freezing problem and EIED simultaneously. Furthermore, the performance of different backoff algorithms in IEEE 802.11 MAC layer misbehavior has been never compared in literature.This paper proposes a novel analytical model to analyze and validate a saturated IEEE 802.11 wireless network employing BEB or EIED backoff algorithm in case of existing misbehavior nodes. Particularly, the numerical results of network performance for both BEB and EIED backoff algorithms are presented to compare in main parameters. The paper is organized as follows: In Section2 we briefly review the state of the art of related studies. Section 3 presents our proposed analytical model. We adopt some main simulation results with our analysis in Section 4 and our conclusions and future works are drawn in Section 5.


## 2. Related Work

Network performance of IEEE 802.11 MAC is the interesting aim of recent studies because it is a base step to evaluate and improve the standard in varying application environments. To approach this, using analytical model is a traditional method due to its clarity. However, the accuracy and complexity of a model strongly depend on precise assumptions. Hence, the simple and accurate model proposed by Bianchi [4] has been initiated to number of papers which enhance more conditions for compensating accuracy such as the backoff freezing issue that has been fully considered in [5–7]. However, the previous proposals are focused to analyze the binary exponential backoff algorithm only.An Exponential Increase Exponential Decrease backoff algorithm was proposed in [2] which has got several interesting characteristics. Numerical results in [2, 3] show that throughput improvement of IEEE 802.11 saturated network with EIED backoff algorithm overcame BEB backoff algorithm in the same conditions. Unfortunately, backoff freezing phenomenon in these studies has not been mentioned.IEEE 802.11 MAC layer misbehavior can be caused by naive attack or smart attack in [8] and several attacks modify the backoff algorithm as declared in [9]. To the best of our knowledge, several proposals are based on the Markov chain [4] to validate network performance parameter for the case of having misbehavior nodes [10–12]. However, these models ignored the backoff freezing issue and investigated the BEB algorithm only. Hence, our analytical model is proposed to compensate a lack of previous studies for evaluating influenced performance under common attacks in terms of throughput and delay parameters.


## 3. The Proposed Analytical Model

### 3.1. The Backoff Algorithm State Model

Consider a single-hop IEEE 802.11 wireless network in saturated traffic condition. The network contains two kinds of node as normal node and misbehavior node, which contained cheating backoff rules. The number of nodes in the network isn, and the number of misbehavior nodes is l. The IEEE MAC layer is employed by BEB or EIED backoff algorithm in all normal nodes. Let τ1,p1,τ2,p2 be transmission probability and collision probability for two kinds of node, respectively. Note that any formula without notation (BEB) or (EIED) indicates that it is used for both cases of network using BEB and EIED algorithm. Denote by τ1(BEB) the transmission probability of normal node when it employed BEB backoff algorithm and τ1(EIED) for a normal node employing EIED backoff algorithm. Assume all channel in the network is no prone error and there is no hidden terminal problem.The backoff state of a node employing BEB algorithm is modelled by a 2-dimension Markov chain [5]. Two stochastic processes are presented to backoff stages(t) and backoff time counter value b(t). For convenience, let Wmin, Wmax, Wj denote CWmin+1, CWmax+1, and CWj+1 in thejth retry/retransmission, m is the maximum backoff stage, and R is the maximum retry limit. The contention window size of BEB algorithm is illustrated as follows:(1)Wj=2jW0=2jWmin,j∈0,m-1,R>m2mW0=2mWmin,j∈m,R,R>m2jW0=2jWmin,j∈0,R,R≤m,in whichm=log2Wmax/Wmin and Wmin=W0. The transmission probability of a normal node using BEB algorithm is given by(2)τ1BEB=1-p1R+11-p12∑i=0Rp1i2iW0+1-1-p1R+1.The EIED backoff algorithm was introduced in [2], where the contention window size is doubled after every unsuccessful transmission and is halved after each successful transmission. Whenever the retry counter reaches the limit value, the CW is kept and not reset to zero. It can be described as follows.After a successful transmission, the contention window decreases as a constant valuerD:(3)CW=maxCW+1rD,CWmin+1-1.After an unsuccessful transmission, the contention window increases as a constant valuerI:(4)CW=minrI×CW+1,CWmax+1-1.In this paper, we focus on a special case of EIED algorithm, whererI=rD=2. A backoff state model of a node based on two-dimension Markov chain is illustrated in Figure 2. The state (i+,k) indicates that a node has a successful transmission, and the state (i-,k) indicates that a node stays in backoff process when a transmission is failed. Due to the anomalous slots, we can consider a window Wi+=Wi-1 to include the first idle backoff slot after a successful transmission [5].Denote bybj,k=limt→∞⁡Prs(t)=j,b(t)=k the stationary probability of backoff state (j, k). The probability that a node transmits during a generic slot time is equal to the sum of all stationary states with k=0. The transition probabilities of the Markov model are given as follows:(5)Pi+,k∣i+,k+1=1,k∈0,Wi-3,i∈0,m-1Pi-,k∣i-,k+1=1,k∈0,Wi-2,i∈1,mPi+,k∣i+1+,0=1-pWi-1,k∈0,Wi-3,i∈0,m-2Pi+,k∣i+1-,0=1-pWi-1,k∈0,Wi-3,i∈0,m-1Pi+1-,k∣i-,0=pWi,k∈0,Wi-2,i∈1,m-1Pi+1-,k∣i+,0=pWi,k∈0,Wi-2,i∈0,m-1.The first and second lines of (5) demonstrate that the backoff counter is decreased by 1 in duration times t and t+1. Four remaining equations in (5) show that the backoff stage is reduced by1 after a successful transmission and increased by1 after an unsuccessful transmission. Owing to the chain regularities, there is a simple relation between all states belonging to the same row (corresponding to the same stage i):(6)bi+,k=Wi-k-1Wi-1bi+,0;bi-,k=Wi-kWibi-,0.The equations in (7) and in (8) modelled the horizontal relation between all states that backoff counter is equal to zero:(7)bi-,0=bi-1+,0+bi-1-,0×p1,2≤i≤m-1bi+,0=bi+1+,0+bi+1-,0×1-p1,1≤i≤m-2.At the first and the last stage, we have(8)b0+,0=b0+,0+b1+,0+b1-,0×1-p,bm-1+,0=bm-,0×1-p,b1-,0=b0+,0×p,bm-,0=bm-1-,0+bm-1+,0+bm-,0×p.By using an inductive method for this calculation, we obtain that(9)bi+,0=p1i+11-p1ib0+,0,bi-,0=p1i1-p1i-1b0+,0.Denotex=p1/1-p1. Since all the states can be expressed as a function of the probabilities, by imposing the normalization condition, we can solve the Markov chain:(10)1=∑i=0m-1∑k=0Wi-2bi+,k+∑i=1m∑k=0Wi-1bi-,k=∑i=0m-1bi+,0Wi2+∑i=1mbi-,0Wi+12=b0+,02W0+p∑i=1m-1xiWi+b0-,021-p∑i=1m-1xiWi+1+xmWm+1.The transmission probability of a normal node when using EIED algorithm is(11)τ1EIED=∑i=0m-1bi+,0+∑i=1mbi-,0=1-xm+11-xb0+,0.Given the transmission probability of normal nodeτ1 and misbehavior node τ2, we can express a conditional collision probability of a normal node through a probability that a tagged node gets a transmission, which is originated by at least one of the contending nodes: (12)p1=1-1-τ1n-l-11-τ2l.In common case, a misbehavior node always has an initiated backoff window smaller than in normal node. When misbehavior node has a fixed contention window mechanism, the contention window size is not changed in every backoff stage. LetW∗ be equal to the contention window size of misbehavior node plus 1. The backoff counter of a selfish node is chosen randomly fromzero to W∗-1. The transmission probability of a misbehavior node can be reduced from (1) as(13)τ2=2W∗+1-1-p2=2W∗+p2.The collision probability of misbehavior node is(14)p2=1-1-τ2n-l1-τ2l-1.Then, we can solve τ1,p1,τ2,p2 by using numerical method based on (8), (11), (12), (13), and (14) in the case of EIED algorithm.


### 3.2. Channel State Model

To model the IEEE 802.11 MAC in wireless multihop fashion, we clarify states around of a node by a channel state model. A backoff freezing process is modelled by a channel state model based on Markov chain in Figure1. The four states areWait, Success 1, Success 2, andContention.Wait state is channel state in idle state;Success 1 is channel state which presents a successful transmission of a normal node; Success 2 is channel state which presents a successful transmission of a misbehavior node; andContention is a channel state which presents a channel in collision process.Figure 1
The backoff state model of a node employing EIED algorithm.Figure 2
Channel state model.The transition probabilities are explained as follows.Wait to Wait. It is the transition probability from state Wait to itself, and we have(15)pW-W=1-τ1n-l1-τ2l.Wait to Success 1.The channel is sensed busy because of a successful transmission of a normal node.(16)pW-S1=n-l×τ11-τ1n-l-11-τ2l.Wait to Success 2. A misbehavior node accesses the channel and initiates a successful transmission.(17)pW-S2=l×τ21-τ1n-l1-τ2l-1.Wait to Contention. The channel experiences a collision due to some concurrent transmissions. Thus, the transition probability fromWait state toContention state is(18)pW-C=1-pW-W-pW-S1-pW-S2.Success 1 to Success 1. It is the event when a normal node transmits multiple consecutive packets. This event indicates the influence of DCF freezing/resumption process of the backoff counter. A normal node employing BEB algorithms always starts a transmission at the first backoff stage; hence(19)pS1-S1BEB=1W0.In case of using EIED algorithm, the probability that a node extracts a new zero backoff counter depends on the current backoff stage of this node. Denote bydi the probability that a node transmits a new packet at backoff stage i. We have d0=b0+,0, d1=b1+,0,…,dm-1=b(m-1)+,0, and dm=bm-,0-∑i=0m-1dip1m-i. A node can start a new transmission with zero backoff value if and only if its current state belongs to 0+,0,1+,0,…,m-1+,0. Therefore, this transition probability can be computed as(20)pS1-S1EIED=∑0m-1di×1/Wi∑0m-1di.Success 2 to Success 2. The probability that a misbehavior node extracts new zero backoff counter is(21)pS2-S2=1W∗.The steady-state probabilities of Markov chain are determined as follows:(22)πW=11+pW-C+pW-S1/1-pS1-S1+pW-S2/1-pS2-S2πC=πW×pW-C;πS1=πW×pW-S11-pS1-S1;πS2=πW×pW-S21-pS2-S2.The average length of stationary state of channel model is calculated as(23)ET=πWTW+πCTC+πS1+πS2TS.Here,Ts is the time the channel is sensed busy because of a successful transmission, Tc is the time the channel is sensed busy by each station during a collision, and Tw is the duration of an empty slot time.From the view of a node, the average slot duration in the backoff countdown process is greater thanE[T] because of the freezing backoff issue. Hence,(24)Eslot=ETπW.


### 3.3. Performance Parameters

In this section, we derive throughput, packet drop rate, and delay performance metrics as follows.(a) Throughput Analysis. The saturation throughput of network is defined as the fraction of channel occupied and successfully transmitted payload bits:(25)Th=πS1+πS2×EPET.The normalized throughput of a normal node and a misbehavior node can be expressed as follows:(26)Th1=πS1n-l×EPET,Th2=πS2l×EPET.(b) Packet Drop Probability. The packet drop probability is defined as the probability that a packet is dropped when the retry limit is reached and it is equal to(27)Pdrop1=p1R+1,Pdrop2=p2R+1.(c) Access Delay Analysis. The average packet delay for a successfully transmitted packet is defined to be the time interval from the time the packet is at the head of its MAC queue ready to be transmitted, until an acknowledgement for this packet is received. The packet delay of a normal node employing BEB algorithm is calculated similar to study in [13], in which E[Tdrop] is the average number of slot times required for a packet to experience R+1 collisions in the (0,1,…,R) retry stages. Thus, Tdelay(BEB)=E[Tdrop]×E[slot].(28)Tdelay1BEB=∑j=0RWj+12×p1j-p1R+11-p1R+1×Eslot.The packet delay of a normal node using EIED algorithm is(29)Tdelay1EIED=∑i=0mTi×di∑i=0mdi,where Ti is the average delay when a normal node starts at the ith stage in the backoff process, with the probability density function being equal to di. For each i, Ti is calculated as follows:(30)Ti=∑j=0RWmini+j,m+12×p1j-p1R+11-p1R+1×Eslot.Similarly, the packet delay of misbehavior node is given by(31)Tdelay2=∑j=0RW∗+12×p2j-p2R+11-p2R+1×Eslot.


## 3.1. The Backoff Algorithm State Model

Consider a single-hop IEEE 802.11 wireless network in saturated traffic condition. The network contains two kinds of node as normal node and misbehavior node, which contained cheating backoff rules. The number of nodes in the network isn, and the number of misbehavior nodes is l. The IEEE MAC layer is employed by BEB or EIED backoff algorithm in all normal nodes. Let τ1,p1,τ2,p2 be transmission probability and collision probability for two kinds of node, respectively. Note that any formula without notation (BEB) or (EIED) indicates that it is used for both cases of network using BEB and EIED algorithm. Denote by τ1(BEB) the transmission probability of normal node when it employed BEB backoff algorithm and τ1(EIED) for a normal node employing EIED backoff algorithm. Assume all channel in the network is no prone error and there is no hidden terminal problem.The backoff state of a node employing BEB algorithm is modelled by a 2-dimension Markov chain [5]. Two stochastic processes are presented to backoff stages(t) and backoff time counter value b(t). For convenience, let Wmin, Wmax, Wj denote CWmin+1, CWmax+1, and CWj+1 in thejth retry/retransmission, m is the maximum backoff stage, and R is the maximum retry limit. The contention window size of BEB algorithm is illustrated as follows:(1)Wj=2jW0=2jWmin,j∈0,m-1,R>m2mW0=2mWmin,j∈m,R,R>m2jW0=2jWmin,j∈0,R,R≤m,in whichm=log2Wmax/Wmin and Wmin=W0. The transmission probability of a normal node using BEB algorithm is given by(2)τ1BEB=1-p1R+11-p12∑i=0Rp1i2iW0+1-1-p1R+1.The EIED backoff algorithm was introduced in [2], where the contention window size is doubled after every unsuccessful transmission and is halved after each successful transmission. Whenever the retry counter reaches the limit value, the CW is kept and not reset to zero. It can be described as follows.After a successful transmission, the contention window decreases as a constant valuerD:(3)CW=maxCW+1rD,CWmin+1-1.After an unsuccessful transmission, the contention window increases as a constant valuerI:(4)CW=minrI×CW+1,CWmax+1-1.In this paper, we focus on a special case of EIED algorithm, whererI=rD=2. A backoff state model of a node based on two-dimension Markov chain is illustrated in Figure 2. The state (i+,k) indicates that a node has a successful transmission, and the state (i-,k) indicates that a node stays in backoff process when a transmission is failed. Due to the anomalous slots, we can consider a window Wi+=Wi-1 to include the first idle backoff slot after a successful transmission [5].Denote bybj,k=limt→∞⁡Prs(t)=j,b(t)=k the stationary probability of backoff state (j, k). The probability that a node transmits during a generic slot time is equal to the sum of all stationary states with k=0. The transition probabilities of the Markov model are given as follows:(5)Pi+,k∣i+,k+1=1,k∈0,Wi-3,i∈0,m-1Pi-,k∣i-,k+1=1,k∈0,Wi-2,i∈1,mPi+,k∣i+1+,0=1-pWi-1,k∈0,Wi-3,i∈0,m-2Pi+,k∣i+1-,0=1-pWi-1,k∈0,Wi-3,i∈0,m-1Pi+1-,k∣i-,0=pWi,k∈0,Wi-2,i∈1,m-1Pi+1-,k∣i+,0=pWi,k∈0,Wi-2,i∈0,m-1.The first and second lines of (5) demonstrate that the backoff counter is decreased by 1 in duration times t and t+1. Four remaining equations in (5) show that the backoff stage is reduced by1 after a successful transmission and increased by1 after an unsuccessful transmission. Owing to the chain regularities, there is a simple relation between all states belonging to the same row (corresponding to the same stage i):(6)bi+,k=Wi-k-1Wi-1bi+,0;bi-,k=Wi-kWibi-,0.The equations in (7) and in (8) modelled the horizontal relation between all states that backoff counter is equal to zero:(7)bi-,0=bi-1+,0+bi-1-,0×p1,2≤i≤m-1bi+,0=bi+1+,0+bi+1-,0×1-p1,1≤i≤m-2.At the first and the last stage, we have(8)b0+,0=b0+,0+b1+,0+b1-,0×1-p,bm-1+,0=bm-,0×1-p,b1-,0=b0+,0×p,bm-,0=bm-1-,0+bm-1+,0+bm-,0×p.By using an inductive method for this calculation, we obtain that(9)bi+,0=p1i+11-p1ib0+,0,bi-,0=p1i1-p1i-1b0+,0.Denotex=p1/1-p1. Since all the states can be expressed as a function of the probabilities, by imposing the normalization condition, we can solve the Markov chain:(10)1=∑i=0m-1∑k=0Wi-2bi+,k+∑i=1m∑k=0Wi-1bi-,k=∑i=0m-1bi+,0Wi2+∑i=1mbi-,0Wi+12=b0+,02W0+p∑i=1m-1xiWi+b0-,021-p∑i=1m-1xiWi+1+xmWm+1.The transmission probability of a normal node when using EIED algorithm is(11)τ1EIED=∑i=0m-1bi+,0+∑i=1mbi-,0=1-xm+11-xb0+,0.Given the transmission probability of normal nodeτ1 and misbehavior node τ2, we can express a conditional collision probability of a normal node through a probability that a tagged node gets a transmission, which is originated by at least one of the contending nodes: (12)p1=1-1-τ1n-l-11-τ2l.In common case, a misbehavior node always has an initiated backoff window smaller than in normal node. When misbehavior node has a fixed contention window mechanism, the contention window size is not changed in every backoff stage. LetW∗ be equal to the contention window size of misbehavior node plus 1. The backoff counter of a selfish node is chosen randomly fromzero to W∗-1. The transmission probability of a misbehavior node can be reduced from (1) as(13)τ2=2W∗+1-1-p2=2W∗+p2.The collision probability of misbehavior node is(14)p2=1-1-τ2n-l1-τ2l-1.Then, we can solve τ1,p1,τ2,p2 by using numerical method based on (8), (11), (12), (13), and (14) in the case of EIED algorithm.


## 3.2. Channel State Model

To model the IEEE 802.11 MAC in wireless multihop fashion, we clarify states around of a node by a channel state model. A backoff freezing process is modelled by a channel state model based on Markov chain in Figure1. The four states areWait, Success 1, Success 2, andContention.Wait state is channel state in idle state;Success 1 is channel state which presents a successful transmission of a normal node; Success 2 is channel state which presents a successful transmission of a misbehavior node; andContention is a channel state which presents a channel in collision process.Figure 1
The backoff state model of a node employing EIED algorithm.Figure 2
Channel state model.The transition probabilities are explained as follows.Wait to Wait. It is the transition probability from state Wait to itself, and we have(15)pW-W=1-τ1n-l1-τ2l.Wait to Success 1.The channel is sensed busy because of a successful transmission of a normal node.(16)pW-S1=n-l×τ11-τ1n-l-11-τ2l.Wait to Success 2. A misbehavior node accesses the channel and initiates a successful transmission.(17)pW-S2=l×τ21-τ1n-l1-τ2l-1.Wait to Contention. The channel experiences a collision due to some concurrent transmissions. Thus, the transition probability fromWait state toContention state is(18)pW-C=1-pW-W-pW-S1-pW-S2.Success 1 to Success 1. It is the event when a normal node transmits multiple consecutive packets. This event indicates the influence of DCF freezing/resumption process of the backoff counter. A normal node employing BEB algorithms always starts a transmission at the first backoff stage; hence(19)pS1-S1BEB=1W0.In case of using EIED algorithm, the probability that a node extracts a new zero backoff counter depends on the current backoff stage of this node. Denote bydi the probability that a node transmits a new packet at backoff stage i. We have d0=b0+,0, d1=b1+,0,…,dm-1=b(m-1)+,0, and dm=bm-,0-∑i=0m-1dip1m-i. A node can start a new transmission with zero backoff value if and only if its current state belongs to 0+,0,1+,0,…,m-1+,0. Therefore, this transition probability can be computed as(20)pS1-S1EIED=∑0m-1di×1/Wi∑0m-1di.Success 2 to Success 2. The probability that a misbehavior node extracts new zero backoff counter is(21)pS2-S2=1W∗.The steady-state probabilities of Markov chain are determined as follows:(22)πW=11+pW-C+pW-S1/1-pS1-S1+pW-S2/1-pS2-S2πC=πW×pW-C;πS1=πW×pW-S11-pS1-S1;πS2=πW×pW-S21-pS2-S2.The average length of stationary state of channel model is calculated as(23)ET=πWTW+πCTC+πS1+πS2TS.Here,Ts is the time the channel is sensed busy because of a successful transmission, Tc is the time the channel is sensed busy by each station during a collision, and Tw is the duration of an empty slot time.From the view of a node, the average slot duration in the backoff countdown process is greater thanE[T] because of the freezing backoff issue. Hence,(24)Eslot=ETπW.


## 3.3. Performance Parameters

In this section, we derive throughput, packet drop rate, and delay performance metrics as follows.(a) Throughput Analysis. The saturation throughput of network is defined as the fraction of channel occupied and successfully transmitted payload bits:(25)Th=πS1+πS2×EPET.The normalized throughput of a normal node and a misbehavior node can be expressed as follows:(26)Th1=πS1n-l×EPET,Th2=πS2l×EPET.(b) Packet Drop Probability. The packet drop probability is defined as the probability that a packet is dropped when the retry limit is reached and it is equal to(27)Pdrop1=p1R+1,Pdrop2=p2R+1.(c) Access Delay Analysis. The average packet delay for a successfully transmitted packet is defined to be the time interval from the time the packet is at the head of its MAC queue ready to be transmitted, until an acknowledgement for this packet is received. The packet delay of a normal node employing BEB algorithm is calculated similar to study in [13], in which E[Tdrop] is the average number of slot times required for a packet to experience R+1 collisions in the (0,1,…,R) retry stages. Thus, Tdelay(BEB)=E[Tdrop]×E[slot].(28)Tdelay1BEB=∑j=0RWj+12×p1j-p1R+11-p1R+1×Eslot.The packet delay of a normal node using EIED algorithm is(29)Tdelay1EIED=∑i=0mTi×di∑i=0mdi,where Ti is the average delay when a normal node starts at the ith stage in the backoff process, with the probability density function being equal to di. For each i, Ti is calculated as follows:(30)Ti=∑j=0RWmini+j,m+12×p1j-p1R+11-p1R+1×Eslot.Similarly, the packet delay of misbehavior node is given by(31)Tdelay2=∑j=0RW∗+12×p2j-p2R+11-p2R+1×Eslot.


## 4. Numerical Results and Discussions

To validate the network performance of two backoff algorithms for both normal node and malicious node in a saturated wireless single-hop network, we use MATLAB Tool to verify throughput, packet drop probability, and packet delay parameters. Analytical results will be examined under standard parameters of the IEEE 802.11a as shown in Table1.Table 1
Simulation parameters.
Physical slot timeσ 9μs SIFS 16μs DIFS 34μs PHY header 128 bits MAC header 160 bits Retry limit 7 Basic rateRbasic 6 Mbps Data rateRdata 6 Mbps L A C K 304 bits E [ P ] 12000 bits C W m i n 15 C W m a x 1023LetLDATA be the average length of DATA packet, LDATA=H+E[P], where H is the length of header which composes physical header and MAC header. The transmission durations of DATA and ACK packets are TDATA=LDATA/Rdata; TACK=LACK/Rbasic. With the basic mechanism, the time durations of each steady-state TW,TS,Tc are given by(32)TW=σTC=TDATA+SIFS+TACK+DIFSTS=TDATA+SIFS+TACK+DIFS.Firstly, we verify network throughput in basic mechanism under backoff freezing phenomenon with previous studies in the same input parameters. As seen in Figure3, the EIED algorithm can provide a better throughput more than BEB algorithm as proven in [2, 3]. Notably, the backoff freezing issue does not change significantly throughput curve but keeps good value when the number of nodes increases in this case.Figure 3
Network throughput versus number of nodes.A misbehavior node chooses a backoff with fixed window to gain more opportunity of channel preemption. We illustrate the normal node throughput and malicious node throughput for both BEB and EIED algorithms. We consider a network containing 12 nodes with one malicious node and its contention window varying from 2 to 32 as shown in Figure4. We can see that the throughput of cheating node decreases very fast when W∗ value increases. In addition, misbehavior node in network utilizing EIED algorithm achieves higher throughput than the case of BEB algorithm.Figure 4
Single node throughput versus contention window size.Figures5 and 6 show the delays and packet drop rates of the different backoff algorithms by varying network size. We consider two cases: a network having one malicious node whose contention window is equal to 8 and a normal network without any malicious nodes. A misbehavior node always keeps a smaller delay and packet drop rate because its opportunity of channel occupation is higher. Although EIED algorithm can provide a better total throughput and reduce packet drop probability, the throughput and delay parameters when having a malicious node in network are worse than in BEB algorithm. Therefore, we can conclude that in the case of using EIED algorithm the fairness of network is reduced if there is an attack at MAC layer.Figure 5
Delays versus number of nodes.Figure 6
Packet drop rate versus number of nodes.


## 5. Conclusion

Our presented contribution in this paper is twofold. Firstly, we propose a novel analytical model to model IEEE 802.11 MAC employing EIED backoff algorithms with freezing backoff phenomenon covered. Secondly, the network performance of different backoff algorithms under common attacks at MAC layer is studied through numerical results. We can see that the performance of EIED backoff algorithm is better than that of BEB algorithm under normal condition. However, when the network contained malicious node, the network performance metrics of the network employing BEB backoff algorithm are better than those when employing EIED algorithm. In our next works, these network performance metrics will be validated by a discrete simulation tool.



---

*Source: 2459780-2017-02-14.xml*