|
Half binary exponential increment double decrement back-off algorithm toenhance the saturated throughput of IEEE802.11 wireless LAN |
|---|---|
| รหัสดีโอไอ | |
| Creator | Jesada Sartthong |
| Title | Half binary exponential increment double decrement back-off algorithm toenhance the saturated throughput of IEEE802.11 wireless LAN |
| Publisher | Nakhon Pathom Rajabhat University |
| Publication Year | 2562 |
| Journal Title | Journal of Thai Interdisciplinary Research |
| Journal Vol. | 14 |
| Journal No. | 1 |
| Page no. | 21 |
| Keyword | back-off algorithm, CSMA/CA protocol, contention window, saturation throughput |
| URL Website | http://rdi.npru.ac.th |
| Website title | วารสารวิจัยสหวิทยาการไทย |
| ISSN | 2465-3837 |
| Abstract | In wireless local area network (WLAN), the back-off algorithm is used to reduce the collided packets in carriersense multiple accesses with collision avoidance protocol (CSMA/CA). Normally, the collided packets occur whentwo or more packets are sent in the same timeslot. This research proposes a new back-off algorithm inretransmission process for improving the saturated throughput of IEEE802.11 WLAN. A proposed scheme is calledhalf binary exponential increment double decrement (HBEIDD) back-off algorithm. The throughput performance ofa proposed algorithm is compared with four existing back-off techniques namely: double increment doubledecrement (DIDD), exponential increment exponential decrement (EIED), binary exponential increment halfdecrement (BEIHD), and random increment binary exponential decrement (RIBED) back-off algorithms. Theaccuracy of all back-off algorithms is compared in a discrete time Markov chain model in fixed back-off states andcontention window (CW) sizes. Numerical results show that the saturation throughput of HBEIDD back-offalgorithm is more stable than the existing back-off techniques under high traffic load condition. |
