A survey of TDMA scheduling schemes in wireless multihop networks

Aggeliki Sgora, Dimitrios J. Vergados, Dimitrios D. Vergados

Research output: Contribution to journalArticleScientificpeer-review

25 Citations (Scopus)

Abstract

One of the major problems in wireless multihop networks is the scheduling of transmissions in a fair and efficient manner. Time Division Multiple Access (TDMA) seems to be one of the dominant solutions to achieve this goal since it is a simple scheme and can prolong the devices' lifetime by allowing them to transmit only a portion of the time during conversation. For that reason, several TDMA scheduling algorithms may be found in the literature. The scope of this article is to classify the existing TDMA scheduling algorithms based on several factors, such as the entity that is scheduled, the network topology information that is needed to produce or maintain the schedule, and the entity or entities that perform the computation that produces and maintains the schedules, and to discuss the advantages and disadvantages of each category.
Original languageEnglish
Article number53
Number of pages39
JournalACM Computing Surveys
Volume47
Issue number3
DOIs
Publication statusPublished - 2015
MoE publication typeA1 Journal article-refereed

Fingerprint

Wireless multi-hop Networks
Time division multiple access
Multiple Access
Wireless networks
Division
Scheduling
Scheduling algorithms
Scheduling Algorithm
Schedule
Topology
Network Topology
Lifetime
Classify

Keywords

  • Division Multiple Access (TDMA)
  • collision
  • wireless multihop networks

Cite this

Sgora, Aggeliki ; Vergados, Dimitrios J. ; Vergados, Dimitrios D. / A survey of TDMA scheduling schemes in wireless multihop networks. In: ACM Computing Surveys. 2015 ; Vol. 47, No. 3.
@article{aa45f9b8f34043fc8cb958603b23b310,
title = "A survey of TDMA scheduling schemes in wireless multihop networks",
abstract = "One of the major problems in wireless multihop networks is the scheduling of transmissions in a fair and efficient manner. Time Division Multiple Access (TDMA) seems to be one of the dominant solutions to achieve this goal since it is a simple scheme and can prolong the devices' lifetime by allowing them to transmit only a portion of the time during conversation. For that reason, several TDMA scheduling algorithms may be found in the literature. The scope of this article is to classify the existing TDMA scheduling algorithms based on several factors, such as the entity that is scheduled, the network topology information that is needed to produce or maintain the schedule, and the entity or entities that perform the computation that produces and maintains the schedules, and to discuss the advantages and disadvantages of each category.",
keywords = "Division Multiple Access (TDMA), collision, wireless multihop networks",
author = "Aggeliki Sgora and Vergados, {Dimitrios J.} and Vergados, {Dimitrios D.}",
note = "CO:U Norwegian University of Science and Technology, Trondheim, Norway CO:U University of Piraeus, Piraeus, Greece CA2: BA1146 PGN: 39 p.",
year = "2015",
doi = "10.1145/2677955",
language = "English",
volume = "47",
journal = "ACM Computing Surveys",
issn = "0360-0300",
publisher = "Association for Computing Machinery ACM",
number = "3",

}

A survey of TDMA scheduling schemes in wireless multihop networks. / Sgora, Aggeliki; Vergados, Dimitrios J.; Vergados, Dimitrios D.

In: ACM Computing Surveys, Vol. 47, No. 3, 53, 2015.

Research output: Contribution to journalArticleScientificpeer-review

TY - JOUR

T1 - A survey of TDMA scheduling schemes in wireless multihop networks

AU - Sgora, Aggeliki

AU - Vergados, Dimitrios J.

AU - Vergados, Dimitrios D.

N1 - CO:U Norwegian University of Science and Technology, Trondheim, Norway CO:U University of Piraeus, Piraeus, Greece CA2: BA1146 PGN: 39 p.

PY - 2015

Y1 - 2015

N2 - One of the major problems in wireless multihop networks is the scheduling of transmissions in a fair and efficient manner. Time Division Multiple Access (TDMA) seems to be one of the dominant solutions to achieve this goal since it is a simple scheme and can prolong the devices' lifetime by allowing them to transmit only a portion of the time during conversation. For that reason, several TDMA scheduling algorithms may be found in the literature. The scope of this article is to classify the existing TDMA scheduling algorithms based on several factors, such as the entity that is scheduled, the network topology information that is needed to produce or maintain the schedule, and the entity or entities that perform the computation that produces and maintains the schedules, and to discuss the advantages and disadvantages of each category.

AB - One of the major problems in wireless multihop networks is the scheduling of transmissions in a fair and efficient manner. Time Division Multiple Access (TDMA) seems to be one of the dominant solutions to achieve this goal since it is a simple scheme and can prolong the devices' lifetime by allowing them to transmit only a portion of the time during conversation. For that reason, several TDMA scheduling algorithms may be found in the literature. The scope of this article is to classify the existing TDMA scheduling algorithms based on several factors, such as the entity that is scheduled, the network topology information that is needed to produce or maintain the schedule, and the entity or entities that perform the computation that produces and maintains the schedules, and to discuss the advantages and disadvantages of each category.

KW - Division Multiple Access (TDMA)

KW - collision

KW - wireless multihop networks

U2 - 10.1145/2677955

DO - 10.1145/2677955

M3 - Article

VL - 47

JO - ACM Computing Surveys

JF - ACM Computing Surveys

SN - 0360-0300

IS - 3

M1 - 53

ER -