An Accurate and Scalable Analytical Model for IEEE 802.15.4 Slotted CSMACA Networks

  • 格式:pdf
  • 大小:301.00 KB
  • 文档页数:9
440
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 8, NO. 1, JANUARY 2009
An Accurate and ቤተ መጻሕፍቲ ባይዱcalable Analytical Model for IEEE 802.15.4 Slotted CSMA/CA Networks
I. I NTRODUCTION
I
EEE 802.15.4 defines PHY and MAC specifications for low data rate and low power Wireless Personal Area Networks (WPANs) [1]. The IEEE 802.15.4 MAC specification supports two operational modes: (1) non beacon-enabled mode where unslotted CSMA/CA is used, and (2) beacon-enabled mode where beacons are periodically sent by a PAN coordinator. In the superframe of beacon-enabled mode, both contention based period (CAP) and optional contention-free period (CFP) may exist. Slotted CSMA/CA algorithm (shortened to SCSMA) is used in the CAP and will be studied in this paper. SCSMA uses truncated binary exponential backoff as that used in the IEEE 802.11 CSMA/CA algorithm for wireless local area networks (WLAN) [2]. A device attempting to access channel with SCSMA will undergo random backoff and two clear-channel assessment (CCA). During the backoff, the 802.15.4 device will not sense channel and backoff counter decreases by one for every backoff slot. This specific design reduces energy consumption for channel sensing. However, it is unclear if the design will result in a high energy efficiency of the SCSMA algorithm and how it will affect on the other
Jianhua He, Zuoyin Tang, Hsiao-Hwa Chen, and Qian Zhang
Abstract—In this paper a Markov chain based analytical model is proposed to evaluate the slotted CSMA/CA algorithm specified in the MAC layer of IEEE 802.15.4 standard. The analytical model consists of two two-dimensional Markov chains, used to model the state transition of an 802.15.4 device, during the periods of a transmission and between two consecutive frame transmissions, respectively. By introducing the two Markov chains a small number of Markov states are required and the scalability of the analytical model is improved. The analytical model is used to investigate the impact of the CSMA/CA parameters, the number of contending devices, and the data frame size on the network performance in terms of throughput and energy efficiency. It is shown by simulations that the proposed analytical model can accurately predict the performance of slotted CSMA/CA algorithm for uplink, downlink and bi-direction traffic, with both acknowledgement and non-acknowledgement modes. Index Terms—IEEE 802.15.4, slotted CSMA/CA, wireless personal area network, MAC, Markov chain, ZigBee.
network performances, e.g., network throughput and packet success probability. In the literature, there were research reports on analytical models of the SCSMA algorithm. Misic et al. proposed a Markov model to evaluate the throughput of 802.15.4 networks with unsaturated downlink and uplink traffic [6]. However, their analytical model did not match the simulation results very well. A simplified Markov model was proposed in [7], in which a geometric distribution was used to approximate the uniform distribution for the random backoff counter. But the approximation results in large inaccuracy in the prediction of throughput. Energy and throughput performances of 802.15.4 was analyzed in [8]. As pointed out in [9], the proposed model did not mimic the 802.15.4 behavior sufficiently. A simple Markov model was proposed with an assumption of independent channel sensing probability in [9]. The model can effectively predict the channel sensing probability but can not accurately predict the throughput performance. A threedimensional Markov model was proposed in [4] to evaluate the throughput of SCSMA, which used the idea of the Markov chain model proposed for IEEE 802.11e in [10]. However, the state transitions in [4] were not correctly modeled. The model was revised with improved accuracy in [5]. A drawback of the three-dimensional Markov model for SCSMA is the big number of Markov states which limits its scalability. An embedded two-dimensional Markov model was proposed for SCSMA in [11] for saturated uplink traffic. However, the state transitions in the model were observed to be incorrect. It is also observed that although the embedded model was proposed for SCSMA with acknowledgment mode, the ACK timeout event was not modeled. In this paper, we propose a two two-dimensional Markov chains to model SCSMA, in order to reduce the number of Markov chain states and investigate SCSMA in more details. As can be seen in Section IV, the first Markov chain is an embedded Markov chain. In the embedded Markov chain, a state consists of only backoff stage and backoff counter at the end of a slot where a transmission completes. As a 802.15.4 device can backoff and perform CCA during other device’s transmission, the transitions of embedded states become very complex. We introduce a secondary two-dimensional Markov chain to model the changes of a device’s backoff stage and backoff counter during other device’s transmission. With the two two-dimensional Markov chains, the proposed analytical model can achieve high accuracy and scalability. The analytical model can also deal with acknowledgement mode and bidirection traffic for SCSMA. The analytical model is validated with a wide range of network and traffic configurations,