Home // ICSNC 2017, The Twelfth International Conference on Systems and Networks Communications // View article

Simulation Study of Persistent Relay CSMA with Random Assigning of Initial Contention Window Values

Authors:
Katsumi Sakakibara
Naoya Yoda
Kento Takabayashi

Keywords: persistent relay CSMA; wireless LAN; simulation; contention window.

Abstract:
Based on IEEE 802.11 Distributed Coordination Function (DCF), Persistent Relay Carrier Sense Multiple Access (PRCSMA) was proposed for cooperative transmission with two or more relay nodes. We propose random assigning of the initial Contention Window (CW) value of each relay node at the beginning of cooperation phase in PRCSMA. Each relay node independently and randomly selects its initial CW value among a predefined set of integers, while in the original PRCSMA, a relay node fixes its CW value to a common given integer. Numerical results obtained from computer simulation reveal that the proposed protocol can improve the performance of the original PRCSMA. The proposed protocol makes it possible to reduce the possibility of frame collisions among relay nodes and successfully reduce the duration of cooperation. Also, the results demonstrate that the binary exponential backoff algorithm degrades the performance of PRCSMA.

Pages: 36 to 41

Copyright: Copyright (c) IARIA, 2017

Publication date: October 8, 2017

Published in: conference

ISSN: 2163-9027

ISBN: 978-1-61208-591-3

Location: Athens, Greece

Dates: from October 8, 2017 to October 12, 2017