Mar 2008 doc:IEEE e Slide 1 Submission Paul Dixon, Pei Liu, Hisilicon Project: IEEE P Working Group for Wireless Personal Area Networks (WPANs) Submission Title: [ Non-persistent CSMA Mechanism ] Date Submitted: [Mar 2008 ] Source: [Paul Dixon, Pei Liu, Liang Li] Company: [Hisilicom Technology Co. Ltd, Vinno Technologies Inc. ] Address: [Nan Tian Bld., No.10 Xinxi. Rd Shang-Di Information Industry Base, Hai-Dain District, Beijing,China ] Voice:[ ], Re: [ IEEE e ] Abstract:[Description the upgraded MAC issues on Chinese WPAN Standard Draft] Purpose:[To encourage discussion.] Notice:This document has been prepared to assist the IEEE P It is offered as a basis for discussion and is not binding on the contributing individual(s) or organization(s). The material in this document is subject to change in form and content after further study. The contributor(s) reserve(s) the right to add, amend or withdraw material contained herein. Release:The contributor acknowledges and accepts that this contribution becomes the property of IEEE and may be made publicly available by P

Mar 2008 doc:IEEE e Slide 2 Submission Paul Dixon, Pei Liu, Hisilicon The CSMA/CA Operation Procedure in IEEE MAC The CSMA/CA algorithm is used within CAP in IEEE MAC, may operate in either of two topologies: the star topology or the peer- to-peer topology. The network throughput is an important evaluation for the performance of CSMA/CA. In IEEE , the procedure is derived from CSMA/CA mechanism of the IEEE Standard

Mar 2008 doc:IEEE e Slide 3 Submission Paul Dixon, Pei Liu, Hisilicon Drawbacks of Current MAC Protocol The CSMA/CA mechanism in WPAN is quite different from IEEE802.11:  The virtual carrier-sense mechanism, and the RTS （ request-to-send ） /CTS （ clear-to-send) are not employed in WPAN, because of the low data rate, short packets, and high ratio of packet header and control packets to payload data for a single node, compared to  Only the slotted CSMA/CA is employed in , but in WPAN, slotted and unslotted CSMA/CA may be employed, depending on the network modes. Therefore, a large error may result from calculation of successful CCA probability and throughput. Furthermore, the computational complexity of successful CCA probability and throughput are quite high.

Mar 2008 doc:IEEE e Slide 4 Submission Paul Dixon, Pei Liu, Hisilicon Definition of Networking Throughput The throughput is defined as the proportion of time to successfully transmit payload bits in the investigated cycle, the period between two successful packet transmissions. Where T p is the time to successfully transmit payload bits in the investigated cycle, T v is the period between two successful packet transmissions, shown as the CAP channel model.

Mar 2008 doc:IEEE e Slide 5 Submission Paul Dixon, Pei Liu, Hisilicon Promoting Non-persistent CSMA/CA The CSMA/CA algorithm in WPAN is similar to non-persistent CSMA. It’s feasible to apply np-CSMA for analyzing the WPAN CSMA/CA processing and confirming the throughput on WPAN.

Mar 2008 doc:IEEE e Slide 6 Submission Paul Dixon, Pei Liu, Hisilicon Communication Model on one Channel Communication Model in one Channel Acquire the average idle time in communications, and average collision times between successful communications in consideration of timeout.

Mar 2008 doc:IEEE e Slide 7 Submission Paul Dixon, Pei Liu, Hisilicon Calculation Throughput calculate the throughput calculate the cycle calculate the throughput confirm the time parameters calculate average collision times in a cycle  Build up the Markov model for accessing channel. Calculate the possibility of accessing the channel (such as the ratio of successful CCA, the possibility of first CCA in back off period), and one of two consecutive successful CCA.  Calculate the throughput based on the CAP model and parameters.

Mar 2008 doc:IEEE e Slide 8 Submission Paul Dixon, Pei Liu, Hisilicon The Non-persistent Slotted CSMA/CA Algorithm slotted CSMA/CA BE=macMinBE NB=0,CW=2 Battery life extension ？ Locate backoff period boundary Delay for random (0~2 BE -1) unit backoff periods Perform CCA Channel idle ？ CW=2,NB=NB+1 BE=min(BE+1,aMaxBE) NB> macMaxCSMABackoffs? failure CW=CW-1 CW=0? success Y N BE=min （ 2,mac MinBE) (step1) (step5 ） (step4) (step3) (step2) N N N Y YY

Mar 2008 doc:IEEE e Slide 9 Submission Paul Dixon, Pei Liu, Hisilicon The Non-persistent Unslotted CSMA/CA Algorithm

Mar 2008 doc:IEEE e Slide 10 Submission Paul Dixon, Pei Liu, Hisilicon Simulation Results of the Throughput Within CAP under CSMA Method Supposed: One coordinator and end devices with a star topology The number of devices is fixed and known Other conditions strictly follow the ones in the CSMA/CA algorithm in IEEE

Mar 2008 doc:IEEE e Slide 11 Submission Paul Dixon, Pei Liu, Hisilicon Simulation Results of the Throughput Within CAP under CSMA Method The details of the simulation conditions: Other parameters use the default values defined for 2.4GHz frequency channels such as 3, 5 and 4 for macMinBE, aMaxBE and macMaxCSMABackoff, respectively. packet payload55 or 115 bytes overhead15 bytes ACK length11 bytes Channel bit rate250 kbps Backoff unit10 bytes CCA time4 bytes

Mar 2008 doc:IEEE e Slide 12 Submission Paul Dixon, Pei Liu, Hisilicon Simulation Results of the Throughput Within CAP under CSMA Method Where L is the number of payload slots within CAP

Mar 2008 doc:IEEE e Slide 13 Submission Paul Dixon, Pei Liu, Hisilicon The Features of Non-persistent CSMA/CA Large reduction of the complexity of CAP analysis Much accuracy CCA assessing with low complexity, based on the new communication model on one channel Much accuracy evaluation of throughput in consideration of timeout.