# Performance Evaluation of IEEE 1609 WAVE for Vehicular Communications

Authors: Jyh-Horng Wen; Chien-Erh Weng
Journal: International Journal of Vehicular Technology
 (2013)

---

## Abstract

In IEEE 1609, it uses IEEE 802.11 Enhanced Distributed Channel Access (EDCA) mechanism to access the channel. IEEE 802.11 EDCA is a new wireless technology for wireless access in the vehicular environment (WAVE). It defines a new supplement to the existing IEEE 802.11 MAC protocol. In IEEE 802.11 EDCA, the aim is providing a QoS support. While the system serves different access categories (ACs), EDCA does not perform well under high load conditions. In order to improve the efficiency, we pay attention to the EDCA with transmit opportunity (TXOP) mechanism. We first proposed a Markov chain model and studied the behavior. We extend the model to support IEEE 802.11 EDCA and presented a more accurate analysis under nonideal channel environment. We also compared it with that without TXOP mechanism under channel error environment.


---

## Body

## 1. Introduction

In recent years, the WLANs market is experiencing an explosive growth. The medium access control (MAC) protocol is the key element that provides the efficiency in accessing the channel, while satisfying the quality of service (QoS) requirements. IEEE 802.11 EDCA is a new wireless technology which is an enhanced version of IEEE 802.11 distributed coordination function (DCF). The IEEE 802.11 EDCA aims at improving the capabilities and efficiency of the IEEE 802.11 MAC protocol by defining a new mechanism to support the QoS services. While the system serves different ACs, EDCA does not perform well under high load conditions. In order to improve the efficiency, EDCA provides two mechanisms named as transmission opportunity (TXOP) and Block_ACK. These two mechanisms are allowed to offer new data transmission services that include the multiple frame delivery [1–3]. There have been many performance analyses of the IEEE 802.11 EDCA. Deng and Chang [4] proposed a priority scheme by differentiating the backoff window. Aad and Castelluccia [5] proposed a priority scheme by differentiating interframe spaces (IFSs), in which a higher priority class uses IFS, whereas a lower priority class uses a space that equals the sum of IFS and the maximum window size. In [6] Veres et al. proposed priority schemes by differentiating the minimum backoff window size and the maximum window size. In [7], it studied the performance of the IEEE 1609 WAVE and IEEE 802.11p trial standards for vehicular communications. It had implemented key components of these standards in a simulation environment also supporting realistic vehicular mobility simulation. Gallardo et al. analyze the performance of EDCA under the specific conditions of the CCH of a WAVE environment. The protocol is modeled using Markov chains, and results related to throughput, frame-error rate, buffer occupancy, and delay are obtained under different traffic-load conditions [8]. In [9], adaptive Enhanced Distributed Channel Access (EDCA) mechanism based on IEEE 802.11p WAVE for vehicular ad hoc network (VANET) to improve medium access ratio is proposed. These performance studies neglected that high load situation. They cannot truly reflect the real operation of EDCA with priority schemes. In this paper, we pay attention to the EDCA of IEEE 802.11 with TXOP mechanism. We proposed a Markov chain model and studied the behavior. We extend the model to support IEEE 802.11 EDCA and present a more accurate analysis of the IEEE 802.11 EDCA under a nonideal channel environment in WAVE. We also compared it with that without TXOP mechanism under channel error environment.The rest of this paper is organized as follows. In Section2, a general description of IEEE 802.11 and our proposed model with TXOP mechanism is presented. Analytical performance deviations of proposed model including throughput analysis under non-ideal channel scenario are presented in Section 3. The numerical results are given with discussion in Section 4. Finally, conclusions are drawn in Section 5.


## 2. Review of IEEE 802.11

The IEEE 802.11 wireless local area network is a shared-medium communication network that transmits information over wireless links for all IEEE 802.11 stations in its transmission range to receive. It is one of the most deployed wireless networks in the world and is likely to play a major role in multimedia home networks and next-generation wireless communications. IEEE 802.11 wireless networks can be configured into two different modes: ad hoc and infrastructure. In ad hoc mode, all wireless stations within the communication range can communicate directly with each other, whereas, in the infrastructure mode, an access point (AP) is needed to connect all stations to a distribution system (DS), and each station can communicate with others through the AP. IEEE 802.11 is composed of both a physical layer (PHY) and MAC specifications for wireless local area networks [10, 11].In the IEEE802.11 protocol, the fundamental mechanism to access the medium is called the distributed coordination function (DCF). This is a random access scheme which is based on the Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) protocol. The standard also defines an optional point coordination function (PCF) which is based on a polled-response mechanism.In the DCF, if a station has a frame to transmit, it will monitor the channel. If the channel is busy, the MAC waits until the medium becomes idle and then defers for an extra time interval, called the DCF interframe space (DIFS). After sensing the channel within a DIFS, the STA randomly chooses a backoff interval before transmitting. The backoff counter is decremented in terms of a time slot as long as the channel is sensed as being idle. The counter is stopped when a transmission with other STAs is detected on the channel and reactivated when the channel is sensed as being idle again for more than a DIFS. The station transmits its frame when the backoff counter reaches zero. At each transmission, the backoff time is uniformly chosen in the range[0,W-1], where W is the current backoff window size. W equals the initial backoff window size CWmin. After each unsuccessful transmission, W is doubled until a maximum backoff window size value CWmax is reached. Once it reaches CWmax, W shall remain at the value CWmax until it is reset. W shall be reset to CWmin after every successful transmission or the retransmission counter reaches the retry limit (L). After the destination station successfully receives the frame, it transmits an acknowledgment frame (ACK) following a short inter-frame space (SIFS) time. If the transmitting station does not receive the ACK within a specified ACK timeout or it detects the transmission of a different frame on the channel, it reschedules the frame transmission according to the previous backoff rules. The above mechanism is called the basic access mechanism (ACK CSMA/CA). To reduce the hidden station problem, an optional four-way handshakes data transmission mechanism called request-to-send (RTS)/clear-to-send (CTS) is also defined in the DCF. Before transmitting a packet, a station operating in an RTS/CTS mode “reserves” the channel by sending a special request-to-send short frame. The destination station acknowledges the receipt of a RTS frame by sending back a clear-to-send frame. Since collision may occur only on the RTS frame and it is detected by the lack of a CTS response, the RTS/CTS mechanism allows for an increase in the system performance by reducing the duration of a collision when long messages are transmitted [10–12].


### 2.1. Enhanced DCF of IEEE 802.11

IEEE 802.11 EDCA is a new wireless technology which is an enhanced version of IEEE 802.11 DCF. It defines a new supplement to the existing IEEE 802.11 MAC protocol. The IEEE 802.11 EDCA aims at improving the capabilities and efficiency of the IEEE 802.11 MAC protocol by defining a new mechanism to support the QoS services. EDCA specifies four default access categories (ACs). Each STA contends for the channel access and independently starts its backoff depending on its associated AC. Each AC uses AIFS [AC],CWmin[AC], and CWmax[AC] instead of DIFS, CWmin, and CWmax of the DCF [8].The contention method of EDCA is the same as that in DCF. Each STA having a frame to transmit has to wait for the channel to be idle without interruption for a period AIFS [AC], and then it should start a random backoff process with its ownCW[AC]. For each time slot interval, during which the channel stays idle, the random backoff value is decremented. When the backoff counter reaches zero, the frame is transmitted. AIFS [AC] is calculated as follows:
(1)AIFS[AC]=AIFSN[AC]×aSlotTime+aSIFSTime,
where the backoff time is calculated as follows:
(2)backofftime=random_integer×aSlotTime,
where random_integer is uniformly and randomly chosen in the range [1,CW(AC)+1], instead of [0,CW] as in the DCF. Initially, CW of each AC is equal to CWmin[AC]. After each collision, CW is doubled up to
(3)CWmax[AC]=2m*(CWmin[AC]+1)-1,
where m  is called the maximum backoff stage. Once it reaches CWmax[AC], it remains at this value until it is reset.


### 2.2. The System Model

We assume in the following that, for a given station in the priorityi class, b(i,t) is defined as a random process representing the value of backoff counter at time t, and s(i,t) is defined as the random process representing the backoff stage j, where 0≤j≤m and m  is the maximum backoff stage. The value of the backoff counter is uniformly chosen in the range  (0,1,…,Wi,j-1), where Wi,j=2jWi,0 and Wi,0=CWmin[i]. Let pi  denote the probability that a transmitted frame collides with the priority i class. A Markov chain {s(i,t),b(i,t)} can be established to analyze the contention process. Therefore, the state of each station in the priority i class is described by {i,j,k}, where i is just an index standing for the priority i class, j stands for the backoff stage and takes values (0,1,…,m), and k stands for the backoff delay and takes values (0,1,…,Wi,j-1)  in time slots. The state transition diagram for the priority i class is shown in Figure 1, where the state {i,1,0} stands for the state that the station senses when the channel is idle, and when a previous frame transmits successfully, the STA can transmit a frame immediately without activating the backoff stage. The transmission probabilities are listed as follows.Figure 1
Markov chain model for the priorityi class with the backoff window size.The backoff counter freezes when the STA senses that the channel is busy in the priorityi class:
(4)P{i,j,k∣i,j,k}=pi,0≤k≤Wi,j-1,0≤j≤m.The backoff counter decrements when the STA senses the channel is idle in the priorityi class:
(5)P{i,j,k∣i,j,k+1}=1-pi,0≤k≤Wi,j-2,0≤j≤m.
The STA enters the {i,-1,0} state if it has a successful transmission with the previous frame in the priority i class:
(6)P{i,-1,0∣i,j,0}=1-pi,0≤j≤m.
The STA transmits its frame without entering the backoff process at {i,1,0} state if it detects that its previous transmitted frame was successfully received and the channel is idle in the priority i class:
(7)P{i,-1,0∣i,-1,0}=1-pi.The STA defers the transmission of a new frame and enters stage 0 of the backoff process if the STA finds a collision has occurred at{i,1,0} state in the priority i class:
(8)P{i,0,k∣i,-1,0}=piWi,0,0≤k≤Wi,0-1.The STA chooses a backoff delay of the next stagej after an unsuccessful transmission at stage j-1 in the priority i  class:
(9)P{i,j,k∣i,j-1,0}=piWi,j,1≤j≤m,0≤k≤Wi,j-1.Letbi,j,k=limPr{s(i,t)=j,b(i,t)=k}  be the stationary distribution of the Markov chain. We can derive the following relations by chain regularities:
(10)bi,-1,0=(2pi(1-pi)2(1-2pi))×(2pi(1-pi)2(1-2pi)+Wi,0(1-(2pi)m)(1-pi)+(1+Wi,0(2pi)m)(1-2pi))-1.Letτi be the probability that a STA in the priority i class transmits during a time slot e. We then have
(11)τi=bi,-1,0+∑j=0m-1bi,j,0+bi,m,0=11-pibi,-1,0.


### 2.3. TXOP Mechanism

In IEEE 802.11, the TXOP is a time period when a particular station (STA) that wins the channel access has the right to initiate transmission along with the EDCA parameters of AIFS[AC],CWmin[AC], and CWmax[AC]. During the TXOP, STA is allowed to transmit more than one frame with a short inter-frame (SIFS) time gap between an ACK and the subsequent frame transmission without the backoff process. Since SIFS is used for frame separations, the other STAs cannot gain channel access because they must wait for at least a DIFS interval. The TXOP frame structure is shown in Figure 2.Figure 2
TXOP frame structure.


## 2.1. Enhanced DCF of IEEE 802.11

IEEE 802.11 EDCA is a new wireless technology which is an enhanced version of IEEE 802.11 DCF. It defines a new supplement to the existing IEEE 802.11 MAC protocol. The IEEE 802.11 EDCA aims at improving the capabilities and efficiency of the IEEE 802.11 MAC protocol by defining a new mechanism to support the QoS services. EDCA specifies four default access categories (ACs). Each STA contends for the channel access and independently starts its backoff depending on its associated AC. Each AC uses AIFS [AC],CWmin[AC], and CWmax[AC] instead of DIFS, CWmin, and CWmax of the DCF [8].The contention method of EDCA is the same as that in DCF. Each STA having a frame to transmit has to wait for the channel to be idle without interruption for a period AIFS [AC], and then it should start a random backoff process with its ownCW[AC]. For each time slot interval, during which the channel stays idle, the random backoff value is decremented. When the backoff counter reaches zero, the frame is transmitted. AIFS [AC] is calculated as follows:
(1)AIFS[AC]=AIFSN[AC]×aSlotTime+aSIFSTime,
where the backoff time is calculated as follows:
(2)backofftime=random_integer×aSlotTime,
where random_integer is uniformly and randomly chosen in the range [1,CW(AC)+1], instead of [0,CW] as in the DCF. Initially, CW of each AC is equal to CWmin[AC]. After each collision, CW is doubled up to
(3)CWmax[AC]=2m*(CWmin[AC]+1)-1,
where m  is called the maximum backoff stage. Once it reaches CWmax[AC], it remains at this value until it is reset.


## 2.2. The System Model

We assume in the following that, for a given station in the priorityi class, b(i,t) is defined as a random process representing the value of backoff counter at time t, and s(i,t) is defined as the random process representing the backoff stage j, where 0≤j≤m and m  is the maximum backoff stage. The value of the backoff counter is uniformly chosen in the range  (0,1,…,Wi,j-1), where Wi,j=2jWi,0 and Wi,0=CWmin[i]. Let pi  denote the probability that a transmitted frame collides with the priority i class. A Markov chain {s(i,t),b(i,t)} can be established to analyze the contention process. Therefore, the state of each station in the priority i class is described by {i,j,k}, where i is just an index standing for the priority i class, j stands for the backoff stage and takes values (0,1,…,m), and k stands for the backoff delay and takes values (0,1,…,Wi,j-1)  in time slots. The state transition diagram for the priority i class is shown in Figure 1, where the state {i,1,0} stands for the state that the station senses when the channel is idle, and when a previous frame transmits successfully, the STA can transmit a frame immediately without activating the backoff stage. The transmission probabilities are listed as follows.Figure 1
Markov chain model for the priorityi class with the backoff window size.The backoff counter freezes when the STA senses that the channel is busy in the priorityi class:
(4)P{i,j,k∣i,j,k}=pi,0≤k≤Wi,j-1,0≤j≤m.The backoff counter decrements when the STA senses the channel is idle in the priorityi class:
(5)P{i,j,k∣i,j,k+1}=1-pi,0≤k≤Wi,j-2,0≤j≤m.
The STA enters the {i,-1,0} state if it has a successful transmission with the previous frame in the priority i class:
(6)P{i,-1,0∣i,j,0}=1-pi,0≤j≤m.
The STA transmits its frame without entering the backoff process at {i,1,0} state if it detects that its previous transmitted frame was successfully received and the channel is idle in the priority i class:
(7)P{i,-1,0∣i,-1,0}=1-pi.The STA defers the transmission of a new frame and enters stage 0 of the backoff process if the STA finds a collision has occurred at{i,1,0} state in the priority i class:
(8)P{i,0,k∣i,-1,0}=piWi,0,0≤k≤Wi,0-1.The STA chooses a backoff delay of the next stagej after an unsuccessful transmission at stage j-1 in the priority i  class:
(9)P{i,j,k∣i,j-1,0}=piWi,j,1≤j≤m,0≤k≤Wi,j-1.Letbi,j,k=limPr{s(i,t)=j,b(i,t)=k}  be the stationary distribution of the Markov chain. We can derive the following relations by chain regularities:
(10)bi,-1,0=(2pi(1-pi)2(1-2pi))×(2pi(1-pi)2(1-2pi)+Wi,0(1-(2pi)m)(1-pi)+(1+Wi,0(2pi)m)(1-2pi))-1.Letτi be the probability that a STA in the priority i class transmits during a time slot e. We then have
(11)τi=bi,-1,0+∑j=0m-1bi,j,0+bi,m,0=11-pibi,-1,0.


## 2.3. TXOP Mechanism

In IEEE 802.11, the TXOP is a time period when a particular station (STA) that wins the channel access has the right to initiate transmission along with the EDCA parameters of AIFS[AC],CWmin[AC], and CWmax[AC]. During the TXOP, STA is allowed to transmit more than one frame with a short inter-frame (SIFS) time gap between an ACK and the subsequent frame transmission without the backoff process. Since SIFS is used for frame separations, the other STAs cannot gain channel access because they must wait for at least a DIFS interval. The TXOP frame structure is shown in Figure 2.Figure 2
TXOP frame structure.


## 3. Performance Analysis of EDCA with TXOP Mechanism

The purpose of our analysis is to evaluate the saturation throughput and the delay performances of EDCA with TXOP mechanism under ideal channel and channel error scenarios. Based on the previous description, we can derive the close forms for system performance metrics of saturation throughput and delay.From the analysis that was depicted in the previous chapter, the transmission probability is related toCW size and AIFS[AC]. When deriving the saturation throughput and delay from different TXOP durations, the collision probability and the transmission probability of an STA are the same as those derived in chapter 4. However, the equations relating to the transmission time of each successful contention will be different for the different ACs; that is, different ACs are assigned to different TXOP durations. We assume that the system is under an environment of channel error having the RTS/CTS CSMA/CA mechanism. Thus, we can obtain
(12)Si=(ps,i*E[TLi])×((1-pi)σ+∑i=0N-1ps,i(1-Pe,i)TS,i+[pi-ps,i]TC,i+∑i=0N-1ps,i(Pe,iRTSTe,iRTS+Pe,iCTSTe,iCTS+Pe,iDATATe,iDATA+Pe,iACKTe,iACK){∑i=0N-1ps,i(1-Pe,i)TS,i})-1,E[TLi]={∑l=1Ki-1l*((1-Pe,i)(1-P^e,i)l-1P^e,i)+Ki*(1-Pe,i)(1-P^e,i)Ki-1{∑111}}*TLi,TS,i=TRTS+TCTS+2TSIFS+ki*(TLi+TACK+2TSIFS)+AIFS(i),
where TS,i is the TXOP duration which equals the time needed to successively transmit ki frames. When the system is under the environment of a channel error, there are three kinds of transmission error frames: (1) the RTS/CTS frames transmission error; when the RTS/CTS frames transmit an error, the STA cannot determine whether the error is caused by a collision or channel error; (2) the data frames transmission error. (3) The ACK frames transmission error. The probabilities of an unsuccessful transmission can be written as
(13)Pe,i=1-(1-Pb)LRTS+LCTS+Li+LACK,P^e,i=1-(1-Pb)Li,Pe,iRTS=1-(1-Pb)LRTS,Pe,iCTS=(1-Pb)LRTS(1-(1-Pb)LCTS),Pe,iDATA=(1-Pb)LRTS+LCTS(1-(1-Pb)Li),Pe,iACK=(1-Pb)LRTS+LCTS+Li(1-(1-Pb)LACK),
where Pb is the bit error rate and Lxxx is the length of different types of frames. Pe,ixxx is the frame-error rate of the frame type xxx for the priority i class. Te,ixxx is the time duration caused by the frame errors of the different frame types xxx. From the description, we can get the time duration of the different frame types xxx as follows:
(14)Te,iRTS=TRTS+TCTStimeout+AIFS[i],Te,iCTS=TRTS+TSIFS+AIFS[i],Te,iDATA=TRTS+TCTS+AIFS[i]+2TSIFS+TH+TLi+TACKtimeout,Te,iACK=TRTS+TCTS+AIFS[i]+3TSIFS+TH+TLi.From the previous description, the saturation delay in a channel error scenario for the priorityi class can be defined as
(15)E[Di]=E[Xi]σ+E[Bi]((1-pe,i)ps,iTS,i+(pi-pS,i)TC,i)+E(Ni,m)(TC,i+TO)+(1-pe,i)TS,i,
where the first term on the right hand side of (15) is the time for the backoff process, the second term is the time of the frozen backoff counter, the third term is the time needed to deal with collisions, and the fourth term is the successful transmission time, where E[Ni,retry] denotes the average number of retries of a frame for the priority i until it is successfully received and depicted as follows:
(16)E(Ni,retry)=∑j=0mi,retryjpij(1-pi)(1-Pe,i)1-pmi,retry+1,E(Xi)=∑j=0mi,retrypij(1-pi)(1-Pe,i)1-pmi,retry+1∑h=0jWi,h-12,E(Bi)=E(Xi)(1-pi)pi.
We denote that  E(Xi) and E(Bi)  are the total number of idle and busy slots that the frame encounters, respectively, during the backoff process for the priority i class.


## 4. Performance Evaluation

Our simulation model is built on Dedicated Short Range Communications (DSRC). DSRC is a block of spectra in the 5.850 to 5.925 GHz band. It is a short-to-medium range communications service that supports both public safety and private operations in roadside-to-vehicle and vehicle-to-vehicle communication environments. DSRC complements cellular communications by providing very high data transfer rates while minimizing latency in the link of short range [13]. DSRC is a part of Intelligent Transportation Systems (ITS). Compared with the existing wireless communication techniques of ITS, such as wireless AM and FM broadcasters, Global System for Mobile Communications (GSM), Global Positioning System (GPS), satellite telephone service in the 2.3 GHz band, and collision avoidance radar system in the 77 GHz band, DSRC can support low latency (<50 ms) and very high data transfer rates. Some possible applications in public safety are intersection collision avoidance, transit or emergency vehicle signal priority, vehicle safety inspection, and approaching emergency vehicle warning. Other possible applications in private operations are in-vehicle signing, electronic parking payments, gas station payments, and internet access services [14]. The simulation parameters are as follows: Frame payload=1023 bytes, MAC header=34 bytes, PHY header=16 bytes, ACK=14 bytes, RTS=20 bytes, CTS=14 bytes, SIFS=20μs, DIFS=50μs, propagation delay=1μs, and slot time=20μs. First, we finished the simulation of the TXOP mechanism with the RTS/CTS CSMA/CA access scheme under the channel error scenarios and compared it with the model that is without the TXOP mechanism. Figure 3 shows the saturation throughput performance of the TXOP mechanism with the RTS/CTS CSMA/CA access scheme for different priority STAs under a channel error scenario. Figure 4 depicts the saturation throughput performance of different priority STAs using the RTS/CTS CSMA/CA access scheme without the TXOP mechanism under a channel error scenario. From the results, we can conclude that the model with the TXOP mechanism under a channel error scenario can achieve higher performance than the model that is without the TXOP mechanism because the model with the TXOP mechanism is allowed to transmit more than one frame with a short interframe (SIFS) time gap between an ACK and the subsequent frame transmission without the backoff process.Figure 3
Saturation throughput of the different priority STAs with the TXOP mechanism under a channel error scenario,Ki=[1,1,1,6].Figure 4
Saturation throughput of the different priority STAs without the TXOP mechanism under a channel error scenario,Ki=[1,1,1,6].The throughput performances with the TXOP mechanism that considers different SNR conditions are shown in Figures5, 6, 7, and 8. From the results, we can conclude that the TXOP mechanism with a higher SNR can achieve a higher performance. The saturation delay performances of different priority STAs using the RTS/CTS CSMA/CA scheme with the TXOP mechanism under a nonideal channel scenario are shown in Figures 9, 10, 11, and 12. In the lower SNR scenario due to the channel error increase, the saturation delay increases. Figures 9, 10, 11, and 12 have the following parameters: the retry limit of priority 3 is changed from 3 to 4; the lower the retry limit is, the higher the saturation throughput of priority 3 is, while the saturation throughput of the other priority classes decreases and their delay increases, as the priority 3 has a lower retry limit.Figure 5
Saturation throughput of the different priority STAs with the TXOP mechanism under a channel error scenario,Ki=[1,1,1,7], and SNR=11dB.Figure 6
Saturation throughput of the different priority STAs with the TXOP mechanism under a channel error scenario,Ki=[1,1,1,7], and SNR=12dB.Figure 7
Saturation throughput of the different priority STAs with the TXOP mechanism under a channel error scenario,Ki=[1,1,1,7], and SNR=13dB.Figure 8
Saturation throughput of the different priority STAs with the TXOP mechanism under a channel error scenario,Ki=[1,1,1,7], and SNR=15dB.Figure 9
Saturation throughput with the TXOP mechanism by differentiating the retry limit.Figure 10
Saturation throughput with the TXOP mechanism by differentiating the retry limit.Figure 11
Saturation delay with the TXOP mechanism by differentiating the retry limit.Figure 12
Saturation delay with the TXOP mechanism by differentiating the retry limit.


## 5. Conclusion

In IEEE 1609 WAVE, it supports a variety of safety and nonsafety applications with eight levels of access category supports QoS using EDCA in IEEE 802.11. In this paper, we considered the Markov chain model of IEEE 802.11 EDCA under a non-ideal channel. In the non-ideal channel, the frame may be received unsuccessfully due to a channel error. When the frame is received unsuccessfully, it results in an increase in the saturation delay and a reduction in the saturation throughput. In order to improve the efficiency, we used the TXOP mechanism with the proposed model in a non-ideal channel scenario. The proposed model with the TXOP mechanism under a channel error scenario can achieve a higher performance than that without the TXOP mechanism due to fact that the modified model with the TXOP mechanism is allowed to transmit multiple frames during the TXOP duration.



---

*Source: 846016-2013-05-07.xml*