Table of Contents Author Guidelines Submit a Manuscript
Security and Communication Networks
Volume 2017, Article ID 2459780, 8 pages
https://doi.org/10.1155/2017/2459780
Research Article

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

1Posts and Telecommunications Institute of Technology, Hanoi, Vietnam
2Panasonic R&D Center, Hanoi, Vietnam

Correspondence should be addressed to Trong-Minh Hoang; nv.ude.titp@hnimgnortgnaoh

Received 11 July 2016; Revised 25 October 2016; Accepted 29 December 2016; Published 14 February 2017

Academic Editor: Francesco Gringoli

Copyright © 2017 Trong-Minh Hoang et al. 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.

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.

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 Section 2 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 [57]. 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 [1012]. 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 is n, and the number of misbehavior nodes is . The IEEE MAC layer is employed by BEB or EIED backoff algorithm in all normal nodes. Let 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 the transmission probability of normal node when it employed BEB backoff algorithm and 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 stage and backoff time counter value . For convenience, let , , denote , , and in the jth retry/retransmission, is the maximum backoff stage, and is the maximum retry limit. The contention window size of BEB algorithm is illustrated as follows:

in which and . The transmission probability of a normal node using BEB algorithm is given by

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 value :

After an unsuccessful transmission, the contention window increases as a constant value :

In this paper, we focus on a special case of EIED algorithm, where . A backoff state model of a node based on two-dimension Markov chain is illustrated in Figure 2. The state indicates that a node has a successful transmission, and the state indicates that a node stays in backoff process when a transmission is failed. Due to the anomalous slots, we can consider a window to include the first idle backoff slot after a successful transmission [5].

Denote by 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 . The transition probabilities of the Markov model are given as follows:

The first and second lines of (5) demonstrate that the backoff counter is decreased by 1 in duration times and . Four remaining equations in (5) show that the backoff stage is reduced by 1 after a successful transmission and increased by 1 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 ):

The equations in (7) and in (8) modelled the horizontal relation between all states that backoff counter is equal to zero:

At the first and the last stage, we have

By using an inductive method for this calculation, we obtain that

Denote . Since all the states can be expressed as a function of the probabilities, by imposing the normalization condition, we can solve the Markov chain:

The transmission probability of a normal node when using EIED algorithm is

Given the transmission probability of normal node and misbehavior node , 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:

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. Let be equal to the contention window size of misbehavior node plus 1. The backoff counter of a selfish node is chosen randomly from zero to . The transmission probability of a misbehavior node can be reduced from (1) as

The collision probability of misbehavior node isThen, we can solve 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 Figure 1. The four states are Wait, Success 1, Success 2, and Contention. 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; and Contention 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

Wait to Success 1. The channel is sensed busy because of a successful transmission of a normal node.

Wait to Success 2. A misbehavior node accesses the channel and initiates a successful transmission.

Wait to Contention. The channel experiences a collision due to some concurrent transmissions. Thus, the transition probability from Wait state to Contention state is

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

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 by the probability that a node transmits a new packet at backoff stage . We have , , and . A node can start a new transmission with zero backoff value if and only if its current state belongs to . Therefore, this transition probability can be computed as

Success 2 to Success 2. The probability that a misbehavior node extracts new zero backoff counter is

The steady-state probabilities of Markov chain are determined as follows:

The average length of stationary state of channel model is calculated as

Here, is the time the channel is sensed busy because of a successful transmission, is the time the channel is sensed busy by each station during a collision, and 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 than because of the freezing backoff issue. Hence,

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:

The normalized throughput of a normal node and a misbehavior node can be expressed as follows:

(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

(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 is the average number of slot times required for a packet to experience collisions in the () retry stages. Thus, .

The packet delay of a normal node using EIED algorithm iswhere is the average delay when a normal node starts at the th stage in the backoff process, with the probability density function being equal to . For each , is calculated as follows:

Similarly, the packet delay of misbehavior node is given by

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 Table 1.

Table 1: Simulation parameters.

Let be the average length of DATA packet, , where is the length of header which composes physical header and MAC header. The transmission durations of DATA and ACK packets are ; . With the basic mechanism, the time durations of each steady-state are given by

Firstly, we verify network throughput in basic mechanism under backoff freezing phenomenon with previous studies in the same input parameters. As seen in Figure 3, 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 Figure 4. We can see that the throughput of cheating node decreases very fast when 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.

Figures 5 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.

Competing Interests

The authors declare that there is no conflict of interests regarding the publication of this article.

References

  1. IEEE, “IEEE standard for information technology: telecommunications and information exchange between systems: local and metropolitan area networks: specific requirements—part 11: wireless LAN medium access control (MAC) and physical layer (PHY) specifications,” IEEE Standard 802.11-2007, 2007, Revision of IEEE Std 802.11-1999. View at Google Scholar
  2. H. Wu, Y. Peng, K. Long, S. Cheng, and J. Ma, “Performance of reliable transport protocol over IEEE 802.11 wireless LAN: analysis and enhancement,” in Proceedings of the 21st Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM '02), vol. 2, pp. 599–607, IEEE, New York, NY, USA, June 2002. View at Publisher · View at Google Scholar
  3. C. Ye, Y. Li, and A. Reznik, “Performance analysis of exponential increase exponential decrease back-off algorithm,” in Proceedings of the IEEE Global Telecommunications Conference (GLOBECOM '10), pp. 1–6, Miami, Fla, USA, December 2010.
  4. G. Bianchi, “Performance analysis of the IEEE 802.11 distributed coordination function,” IEEE Journal on Selected Areas in Communications, vol. 18, no. 3, pp. 535–547, 2000. View at Publisher · View at Google Scholar · View at Scopus
  5. I. Tinnirello, G. Bianchi, and Y. Xiao, “Refinements on IEEE 802.11 distributed coordination function modeling approaches,” IEEE Transactions on Vehicular Technology, vol. 59, no. 3, pp. 1055–1067, 2010. View at Publisher · View at Google Scholar · View at Scopus
  6. H. Chen, “Revisit of the Markov model of IEEE 802.11 DCF for an error-prone channel,” IEEE Communications Letters, vol. 15, no. 12, pp. 1278–1280, 2011. View at Publisher · View at Google Scholar · View at Scopus
  7. T.-M. Hoang, V.-K. Bui, and T. Nguyen, “Analyzing impacts of physical interference on a transmission in IEEE 802.11 mesh networks,” in Proceedings of the 9th International Conference on Telecommunication Systems Services and Applications (TSSA '15), pp. 1–6, November 2015. View at Publisher · View at Google Scholar · View at Scopus
  8. L. Guang, C. Assi, and A. Benslimane, “MAC layer misbehavior in wireless networks: challenges and solutions,” IEEE Wireless Communications, vol. 15, no. 4, pp. 6–14, 2008. View at Publisher · View at Google Scholar · View at Scopus
  9. V. R. Giri and N. Jaggi, “MAC layer misbehavior effectiveness and collective aggressive reaction approach,” in Proceedings of the 33rd IEEE Sarnoff Symposium 2010, 5, p. 1, April 2010. View at Publisher · View at Google Scholar · View at Scopus
  10. C. Liu, Y. Shu, W. Yang, and O. W. W. Yang, “Throughput modeling and analysis of IEEE 802.11 DCF with selfish node,” in Proceedings of the IEEE Global Telecommunications Conference (GLOBECOM '08), pp. 1–5, New Orleans, La, USA, December 2008.
  11. C. Liu, Y. Shu, M. Li, and O. W. W. Yang, “Delay modeling and analysis of IEEE 802.11 DCF with selfish nodes,” in Proceedings of the 4th International Conference on Wireless Communications, Networking and Mobile Computing (WiCOM '08), pp. 1–4, Dalian, China, 2008.
  12. K.-J. Park, J. Choi, K. Kang, and Y.-C. Hu, “Malicious or selfish? analysis of carrier sense misbehavior in IEEE 802.11 WLAN,” Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, vol. 22, pp. 351–362, 2009. View at Publisher · View at Google Scholar · View at Scopus
  13. P. Chatzimisios, A. C. Boucouvalas, and V. Vitsas, “IEEE 802.11 packet delay: a finite retry limit analysis,” in Proceedings of the IEEE Global Communication Conference (GLOBECOM '03), vol. 2, pp. 950–954, San Francisco, Calif, USA, December 2003.