TDMA scheduling problem avoiding interference in multi-hop wireless sensor networks

Mihiro Sasaki, Takehiro Furuta, Takamori Ukai, Fumio Ishizaki

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

In this paper, we consider a multi-hop sensor network, where the network topology is a tree, TDMA (time division multiple access) is employed as medium access control, and all data generated at sensor nodes are delivered to a sink node (the base station) located on the root of the tree through the network. It is reported that if a transmission schedule that avoids interference between sensor nodes completely can be computed, TDMA is preferable to CSMA/CA (carrier sense multiple access with collision avoidance) in performance. In general, the TDMA scheduling problem to find the shortest schedule is formulated as a combinatorial optimization problem, where each combination corresponds to a schedule. However, solving such a combinatorial optimization problem is difficult, especially for large-scale multi-hop sensor networks. The reason of the difficulty is that the number of the combinations increases exponentially with the increase of the number of nodes. In this paper, to formulate the TDMA scheduling problem, we propose a min-max model and a min-sum model. The min-max model yields the shortest schedule, but it is difficult to solve large-scale problems. The min-sum model does not guarantee providing the shortest schedule; however, it may give us good schedules over a short amount of computation time, compared to the min-max model. Numerical examples show that the min-sum model can provide good schedules in a reasonable CPU time, even when the min-max model fails to compute the shortest schedule in a reasonable CPU time.

Original languageEnglish
JournalJournal of Advanced Mechanical Design, Systems and Manufacturing
Volume10
Issue number3
DOIs
Publication statusPublished - 2016
Externally publishedYes

Fingerprint

Time division multiple access
Wireless sensor networks
Scheduling
Combinatorial optimization
Sensor nodes
Sensor networks
Program processors
Carrier sense multiple access
Medium access control
Collision avoidance
Base stations
Topology

Keywords

  • Integer programming
  • Interference
  • Multi-hop wireless sensor network
  • Scheduling
  • TDMA

ASJC Scopus subject areas

  • Mechanical Engineering
  • Industrial and Manufacturing Engineering

Cite this

TDMA scheduling problem avoiding interference in multi-hop wireless sensor networks. / Sasaki, Mihiro; Furuta, Takehiro; Ukai, Takamori; Ishizaki, Fumio.

In: Journal of Advanced Mechanical Design, Systems and Manufacturing, Vol. 10, No. 3, 2016.

Research output: Contribution to journalArticle

Sasaki, Mihiro ; Furuta, Takehiro ; Ukai, Takamori ; Ishizaki, Fumio. / TDMA scheduling problem avoiding interference in multi-hop wireless sensor networks. In: Journal of Advanced Mechanical Design, Systems and Manufacturing. 2016 ; Vol. 10, No. 3.
@article{84a7b9a95b014c57861b6b46ceabbd97,
title = "TDMA scheduling problem avoiding interference in multi-hop wireless sensor networks",
abstract = "In this paper, we consider a multi-hop sensor network, where the network topology is a tree, TDMA (time division multiple access) is employed as medium access control, and all data generated at sensor nodes are delivered to a sink node (the base station) located on the root of the tree through the network. It is reported that if a transmission schedule that avoids interference between sensor nodes completely can be computed, TDMA is preferable to CSMA/CA (carrier sense multiple access with collision avoidance) in performance. In general, the TDMA scheduling problem to find the shortest schedule is formulated as a combinatorial optimization problem, where each combination corresponds to a schedule. However, solving such a combinatorial optimization problem is difficult, especially for large-scale multi-hop sensor networks. The reason of the difficulty is that the number of the combinations increases exponentially with the increase of the number of nodes. In this paper, to formulate the TDMA scheduling problem, we propose a min-max model and a min-sum model. The min-max model yields the shortest schedule, but it is difficult to solve large-scale problems. The min-sum model does not guarantee providing the shortest schedule; however, it may give us good schedules over a short amount of computation time, compared to the min-max model. Numerical examples show that the min-sum model can provide good schedules in a reasonable CPU time, even when the min-max model fails to compute the shortest schedule in a reasonable CPU time.",
keywords = "Integer programming, Interference, Multi-hop wireless sensor network, Scheduling, TDMA",
author = "Mihiro Sasaki and Takehiro Furuta and Takamori Ukai and Fumio Ishizaki",
year = "2016",
doi = "10.1299/jamdsm.2016jamdsm0047",
language = "English",
volume = "10",
journal = "Journal of Advanced Mechanical Design, Systems and Manufacturing",
issn = "1881-3054",
publisher = "Japan Society of Mechanical Engineers",
number = "3",

}

TY - JOUR

T1 - TDMA scheduling problem avoiding interference in multi-hop wireless sensor networks

AU - Sasaki, Mihiro

AU - Furuta, Takehiro

AU - Ukai, Takamori

AU - Ishizaki, Fumio

PY - 2016

Y1 - 2016

N2 - In this paper, we consider a multi-hop sensor network, where the network topology is a tree, TDMA (time division multiple access) is employed as medium access control, and all data generated at sensor nodes are delivered to a sink node (the base station) located on the root of the tree through the network. It is reported that if a transmission schedule that avoids interference between sensor nodes completely can be computed, TDMA is preferable to CSMA/CA (carrier sense multiple access with collision avoidance) in performance. In general, the TDMA scheduling problem to find the shortest schedule is formulated as a combinatorial optimization problem, where each combination corresponds to a schedule. However, solving such a combinatorial optimization problem is difficult, especially for large-scale multi-hop sensor networks. The reason of the difficulty is that the number of the combinations increases exponentially with the increase of the number of nodes. In this paper, to formulate the TDMA scheduling problem, we propose a min-max model and a min-sum model. The min-max model yields the shortest schedule, but it is difficult to solve large-scale problems. The min-sum model does not guarantee providing the shortest schedule; however, it may give us good schedules over a short amount of computation time, compared to the min-max model. Numerical examples show that the min-sum model can provide good schedules in a reasonable CPU time, even when the min-max model fails to compute the shortest schedule in a reasonable CPU time.

AB - In this paper, we consider a multi-hop sensor network, where the network topology is a tree, TDMA (time division multiple access) is employed as medium access control, and all data generated at sensor nodes are delivered to a sink node (the base station) located on the root of the tree through the network. It is reported that if a transmission schedule that avoids interference between sensor nodes completely can be computed, TDMA is preferable to CSMA/CA (carrier sense multiple access with collision avoidance) in performance. In general, the TDMA scheduling problem to find the shortest schedule is formulated as a combinatorial optimization problem, where each combination corresponds to a schedule. However, solving such a combinatorial optimization problem is difficult, especially for large-scale multi-hop sensor networks. The reason of the difficulty is that the number of the combinations increases exponentially with the increase of the number of nodes. In this paper, to formulate the TDMA scheduling problem, we propose a min-max model and a min-sum model. The min-max model yields the shortest schedule, but it is difficult to solve large-scale problems. The min-sum model does not guarantee providing the shortest schedule; however, it may give us good schedules over a short amount of computation time, compared to the min-max model. Numerical examples show that the min-sum model can provide good schedules in a reasonable CPU time, even when the min-max model fails to compute the shortest schedule in a reasonable CPU time.

KW - Integer programming

KW - Interference

KW - Multi-hop wireless sensor network

KW - Scheduling

KW - TDMA

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

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

U2 - 10.1299/jamdsm.2016jamdsm0047

DO - 10.1299/jamdsm.2016jamdsm0047

M3 - Article

AN - SCOPUS:84977177241

VL - 10

JO - Journal of Advanced Mechanical Design, Systems and Manufacturing

JF - Journal of Advanced Mechanical Design, Systems and Manufacturing

SN - 1881-3054

IS - 3

ER -