New formulation for scheduling problem in multi-hop wireless sensor networks

Takehiro Furuta, Mihiro Sasaki, Fumio Ishizaki, Takamori Ukai, Hajime Miyazawa, Wonyong Koo

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

In this paper, we consider a multi-hop sensor network, where the network topology is a tree, TDMA is employed as medium access control, and all data generated at sensor nodes are delivered to a sink node 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 in performance. However, solving the scheduling problem for TDMA is diffcult, especially, in large-scale multi-hop sensor networks. In this paper, to formulate the scheduling problem for TDMA, we propose min-max model and min-sum model. While the min-max model yields the shortest schedule under the constraints, the min-sum model does not guarantee providing the shortest schedule. 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
Title of host publicationIWCMC 2010 - Proceedings of the 6th International Wireless Communications and Mobile Computing Conference
Pages73-78
Number of pages6
DOIs
Publication statusPublished - 2010
Externally publishedYes
Event6th International Wireless Communications and Mobile Computing Conference, IWCMC 2010 - Caen, France
Duration: 2010 Jun 282010 Jul 2

Other

Other6th International Wireless Communications and Mobile Computing Conference, IWCMC 2010
CountryFrance
CityCaen
Period10/6/2810/7/2

Fingerprint

Wireless sensor networks
Time division multiple access
Scheduling
Sensor nodes
Sensor networks
Program processors
Carrier sense multiple access
Medium access control
Topology

Keywords

  • Scheduling
  • Sensor networks
  • TDMA

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Computer Networks and Communications

Cite this

Furuta, T., Sasaki, M., Ishizaki, F., Ukai, T., Miyazawa, H., & Koo, W. (2010). New formulation for scheduling problem in multi-hop wireless sensor networks. In IWCMC 2010 - Proceedings of the 6th International Wireless Communications and Mobile Computing Conference (pp. 73-78) https://doi.org/10.1145/1815396.1815414

New formulation for scheduling problem in multi-hop wireless sensor networks. / Furuta, Takehiro; Sasaki, Mihiro; Ishizaki, Fumio; Ukai, Takamori; Miyazawa, Hajime; Koo, Wonyong.

IWCMC 2010 - Proceedings of the 6th International Wireless Communications and Mobile Computing Conference. 2010. p. 73-78.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Furuta, T, Sasaki, M, Ishizaki, F, Ukai, T, Miyazawa, H & Koo, W 2010, New formulation for scheduling problem in multi-hop wireless sensor networks. in IWCMC 2010 - Proceedings of the 6th International Wireless Communications and Mobile Computing Conference. pp. 73-78, 6th International Wireless Communications and Mobile Computing Conference, IWCMC 2010, Caen, France, 10/6/28. https://doi.org/10.1145/1815396.1815414
Furuta T, Sasaki M, Ishizaki F, Ukai T, Miyazawa H, Koo W. New formulation for scheduling problem in multi-hop wireless sensor networks. In IWCMC 2010 - Proceedings of the 6th International Wireless Communications and Mobile Computing Conference. 2010. p. 73-78 https://doi.org/10.1145/1815396.1815414
Furuta, Takehiro ; Sasaki, Mihiro ; Ishizaki, Fumio ; Ukai, Takamori ; Miyazawa, Hajime ; Koo, Wonyong. / New formulation for scheduling problem in multi-hop wireless sensor networks. IWCMC 2010 - Proceedings of the 6th International Wireless Communications and Mobile Computing Conference. 2010. pp. 73-78
@inproceedings{6f592b188aff48528ef966ae1385902d,
title = "New formulation for scheduling problem 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 is employed as medium access control, and all data generated at sensor nodes are delivered to a sink node 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 in performance. However, solving the scheduling problem for TDMA is diffcult, especially, in large-scale multi-hop sensor networks. In this paper, to formulate the scheduling problem for TDMA, we propose min-max model and min-sum model. While the min-max model yields the shortest schedule under the constraints, the min-sum model does not guarantee providing the shortest schedule. 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 = "Scheduling, Sensor networks, TDMA",
author = "Takehiro Furuta and Mihiro Sasaki and Fumio Ishizaki and Takamori Ukai and Hajime Miyazawa and Wonyong Koo",
year = "2010",
doi = "10.1145/1815396.1815414",
language = "English",
isbn = "9781450300629",
pages = "73--78",
booktitle = "IWCMC 2010 - Proceedings of the 6th International Wireless Communications and Mobile Computing Conference",

}

TY - GEN

T1 - New formulation for scheduling problem in multi-hop wireless sensor networks

AU - Furuta, Takehiro

AU - Sasaki, Mihiro

AU - Ishizaki, Fumio

AU - Ukai, Takamori

AU - Miyazawa, Hajime

AU - Koo, Wonyong

PY - 2010

Y1 - 2010

N2 - In this paper, we consider a multi-hop sensor network, where the network topology is a tree, TDMA is employed as medium access control, and all data generated at sensor nodes are delivered to a sink node 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 in performance. However, solving the scheduling problem for TDMA is diffcult, especially, in large-scale multi-hop sensor networks. In this paper, to formulate the scheduling problem for TDMA, we propose min-max model and min-sum model. While the min-max model yields the shortest schedule under the constraints, the min-sum model does not guarantee providing the shortest schedule. 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 is employed as medium access control, and all data generated at sensor nodes are delivered to a sink node 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 in performance. However, solving the scheduling problem for TDMA is diffcult, especially, in large-scale multi-hop sensor networks. In this paper, to formulate the scheduling problem for TDMA, we propose min-max model and min-sum model. While the min-max model yields the shortest schedule under the constraints, the min-sum model does not guarantee providing the shortest schedule. 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 - Scheduling

KW - Sensor networks

KW - TDMA

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

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

U2 - 10.1145/1815396.1815414

DO - 10.1145/1815396.1815414

M3 - Conference contribution

AN - SCOPUS:77955124912

SN - 9781450300629

SP - 73

EP - 78

BT - IWCMC 2010 - Proceedings of the 6th International Wireless Communications and Mobile Computing Conference

ER -