Throughput performance of slotted nonpersistent CSMA with an adaptive array

Akira Sugihara, Kei Enomoto, Iwao Sasase

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

In conventional slotted nonpersistent CSMA, a packet is generated during a slot, and the terminal senses the channel at the beginning of the next slot. It is known that slotted CSMA has better throughput performance than unslotted CSMA. However, because of the propagation delay, if more than two packets are generated during the same slot, later packets might sense the channel as idle, and they will cause a conflict. Furthermore, when the CSMA modes are used in practical radio communication systems, the hidden-terminal problem should be considered. We propose a slotted nonpersistent CSMA with an adaptive array at the receiver to improve throughput performance. In our proposed model, in order for an adaptive array to distinguish packets during the same time slot and acquire the first arriving packet, the starting times of packet transmission from all terminals are randomized over the interval which is the difference between the slot width and the packet width. First, we analyze the performance of the throughput and the average number of transmissions and schedulings. We also evaluate the performance by means of computer simulation in order to consider the hidden-terminal problem in the CSMA mode. It is found that the theoretical results of the proposed model agree well with the computer simulated results, and the proposed model attains higher throughput and smaller average numbers of transmissions and schedulings than the conventional slotted nonpersistent CSMA. It is also shown that the performance of the proposed model with an adaptive array due to hidden-terminal degradation is smaller compared to the conventional CSMA.

Original languageEnglish
Pages (from-to)34-43
Number of pages10
JournalElectronics and Communications in Japan, Part I: Communications (English translation of Denshi Tsushin Gakkai Ronbunshi)
Volume80
Issue number9
Publication statusPublished - 1997 Sep

Fingerprint

Carrier sense multiple access
Throughput
Scheduling
Radio communication
Communication systems
Degradation
Computer simulation

Keywords

  • Adaptive array
  • Average number of transmissions
  • Hidden terminal
  • Scheduling
  • Slotted nonpersistent CSMA
  • Throughput

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

@article{3f25e9f4e730492f940ba5123faf9309,
title = "Throughput performance of slotted nonpersistent CSMA with an adaptive array",
abstract = "In conventional slotted nonpersistent CSMA, a packet is generated during a slot, and the terminal senses the channel at the beginning of the next slot. It is known that slotted CSMA has better throughput performance than unslotted CSMA. However, because of the propagation delay, if more than two packets are generated during the same slot, later packets might sense the channel as idle, and they will cause a conflict. Furthermore, when the CSMA modes are used in practical radio communication systems, the hidden-terminal problem should be considered. We propose a slotted nonpersistent CSMA with an adaptive array at the receiver to improve throughput performance. In our proposed model, in order for an adaptive array to distinguish packets during the same time slot and acquire the first arriving packet, the starting times of packet transmission from all terminals are randomized over the interval which is the difference between the slot width and the packet width. First, we analyze the performance of the throughput and the average number of transmissions and schedulings. We also evaluate the performance by means of computer simulation in order to consider the hidden-terminal problem in the CSMA mode. It is found that the theoretical results of the proposed model agree well with the computer simulated results, and the proposed model attains higher throughput and smaller average numbers of transmissions and schedulings than the conventional slotted nonpersistent CSMA. It is also shown that the performance of the proposed model with an adaptive array due to hidden-terminal degradation is smaller compared to the conventional CSMA.",
keywords = "Adaptive array, Average number of transmissions, Hidden terminal, Scheduling, Slotted nonpersistent CSMA, Throughput",
author = "Akira Sugihara and Kei Enomoto and Iwao Sasase",
year = "1997",
month = "9",
language = "English",
volume = "80",
pages = "34--43",
journal = "Electronics and Communications in Japan, Part I: Communications (English translation of Denshi Tsushin Gakkai Ronbunshi)",
issn = "8756-6621",
publisher = "John Wiley and Sons Inc.",
number = "9",

}

TY - JOUR

T1 - Throughput performance of slotted nonpersistent CSMA with an adaptive array

AU - Sugihara, Akira

AU - Enomoto, Kei

AU - Sasase, Iwao

PY - 1997/9

Y1 - 1997/9

N2 - In conventional slotted nonpersistent CSMA, a packet is generated during a slot, and the terminal senses the channel at the beginning of the next slot. It is known that slotted CSMA has better throughput performance than unslotted CSMA. However, because of the propagation delay, if more than two packets are generated during the same slot, later packets might sense the channel as idle, and they will cause a conflict. Furthermore, when the CSMA modes are used in practical radio communication systems, the hidden-terminal problem should be considered. We propose a slotted nonpersistent CSMA with an adaptive array at the receiver to improve throughput performance. In our proposed model, in order for an adaptive array to distinguish packets during the same time slot and acquire the first arriving packet, the starting times of packet transmission from all terminals are randomized over the interval which is the difference between the slot width and the packet width. First, we analyze the performance of the throughput and the average number of transmissions and schedulings. We also evaluate the performance by means of computer simulation in order to consider the hidden-terminal problem in the CSMA mode. It is found that the theoretical results of the proposed model agree well with the computer simulated results, and the proposed model attains higher throughput and smaller average numbers of transmissions and schedulings than the conventional slotted nonpersistent CSMA. It is also shown that the performance of the proposed model with an adaptive array due to hidden-terminal degradation is smaller compared to the conventional CSMA.

AB - In conventional slotted nonpersistent CSMA, a packet is generated during a slot, and the terminal senses the channel at the beginning of the next slot. It is known that slotted CSMA has better throughput performance than unslotted CSMA. However, because of the propagation delay, if more than two packets are generated during the same slot, later packets might sense the channel as idle, and they will cause a conflict. Furthermore, when the CSMA modes are used in practical radio communication systems, the hidden-terminal problem should be considered. We propose a slotted nonpersistent CSMA with an adaptive array at the receiver to improve throughput performance. In our proposed model, in order for an adaptive array to distinguish packets during the same time slot and acquire the first arriving packet, the starting times of packet transmission from all terminals are randomized over the interval which is the difference between the slot width and the packet width. First, we analyze the performance of the throughput and the average number of transmissions and schedulings. We also evaluate the performance by means of computer simulation in order to consider the hidden-terminal problem in the CSMA mode. It is found that the theoretical results of the proposed model agree well with the computer simulated results, and the proposed model attains higher throughput and smaller average numbers of transmissions and schedulings than the conventional slotted nonpersistent CSMA. It is also shown that the performance of the proposed model with an adaptive array due to hidden-terminal degradation is smaller compared to the conventional CSMA.

KW - Adaptive array

KW - Average number of transmissions

KW - Hidden terminal

KW - Scheduling

KW - Slotted nonpersistent CSMA

KW - Throughput

UR - http://www.scopus.com/inward/record.url?scp=0031237843&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0031237843&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0031237843

VL - 80

SP - 34

EP - 43

JO - Electronics and Communications in Japan, Part I: Communications (English translation of Denshi Tsushin Gakkai Ronbunshi)

JF - Electronics and Communications in Japan, Part I: Communications (English translation of Denshi Tsushin Gakkai Ronbunshi)

SN - 8756-6621

IS - 9

ER -