Efficient TDMA scheduling algorithms for sensor networks containing multiple rings

Ákos Orosz, Gergo Róth, G. Simon

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

1 Citation (Scopus)

Abstract

In this paper a special ring topology is investigated for sensor networks, where the whole network is decomposed into subnetworks forming rings, and these subnetworks are connected to each other through a main ring. Each of these subnetworks may have different requirements concerning message delivery times. In this paper algorithms are proposed, which generate such networks from the connectivity graph, and create TDMA scheduling for the generated network. The proposed algorithms can handle the requirements of various delivery times, and can provide parallel operation of nodes, where possible, to decrease the overall length of the schedule. The theoretical results are supported by measurement examples.

Original languageEnglish
Title of host publication2013 IEEE 8th International Symposium on Intelligent Signal Processing, WISP 2013 - Proceedings
PublisherIEEE Computer Society
Pages126-130
Number of pages5
ISBN (Print)9781467345439
DOIs
Publication statusPublished - 2013
Event2013 IEEE 8th International Symposium on Intelligent Signal Processing, WISP 2013 - Funchal, Madeira, Portugal
Duration: Sep 16 2013Sep 18 2013

Other

Other2013 IEEE 8th International Symposium on Intelligent Signal Processing, WISP 2013
CountryPortugal
CityFunchal, Madeira
Period9/16/139/18/13

Fingerprint

Time division multiple access
Scheduling algorithms
Sensor networks
Scheduling
Topology

ASJC Scopus subject areas

  • Signal Processing
  • Artificial Intelligence

Cite this

Orosz, Á., Róth, G., & Simon, G. (2013). Efficient TDMA scheduling algorithms for sensor networks containing multiple rings. In 2013 IEEE 8th International Symposium on Intelligent Signal Processing, WISP 2013 - Proceedings (pp. 126-130). [6657495] IEEE Computer Society. https://doi.org/10.1109/WISP.2013.6657495

Efficient TDMA scheduling algorithms for sensor networks containing multiple rings. / Orosz, Ákos; Róth, Gergo; Simon, G.

2013 IEEE 8th International Symposium on Intelligent Signal Processing, WISP 2013 - Proceedings. IEEE Computer Society, 2013. p. 126-130 6657495.

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

Orosz, Á, Róth, G & Simon, G 2013, Efficient TDMA scheduling algorithms for sensor networks containing multiple rings. in 2013 IEEE 8th International Symposium on Intelligent Signal Processing, WISP 2013 - Proceedings., 6657495, IEEE Computer Society, pp. 126-130, 2013 IEEE 8th International Symposium on Intelligent Signal Processing, WISP 2013, Funchal, Madeira, Portugal, 9/16/13. https://doi.org/10.1109/WISP.2013.6657495
Orosz Á, Róth G, Simon G. Efficient TDMA scheduling algorithms for sensor networks containing multiple rings. In 2013 IEEE 8th International Symposium on Intelligent Signal Processing, WISP 2013 - Proceedings. IEEE Computer Society. 2013. p. 126-130. 6657495 https://doi.org/10.1109/WISP.2013.6657495
Orosz, Ákos ; Róth, Gergo ; Simon, G. / Efficient TDMA scheduling algorithms for sensor networks containing multiple rings. 2013 IEEE 8th International Symposium on Intelligent Signal Processing, WISP 2013 - Proceedings. IEEE Computer Society, 2013. pp. 126-130
@inproceedings{e37e84171b324ca6bac15b3cfc721555,
title = "Efficient TDMA scheduling algorithms for sensor networks containing multiple rings",
abstract = "In this paper a special ring topology is investigated for sensor networks, where the whole network is decomposed into subnetworks forming rings, and these subnetworks are connected to each other through a main ring. Each of these subnetworks may have different requirements concerning message delivery times. In this paper algorithms are proposed, which generate such networks from the connectivity graph, and create TDMA scheduling for the generated network. The proposed algorithms can handle the requirements of various delivery times, and can provide parallel operation of nodes, where possible, to decrease the overall length of the schedule. The theoretical results are supported by measurement examples.",
author = "{\'A}kos Orosz and Gergo R{\'o}th and G. Simon",
year = "2013",
doi = "10.1109/WISP.2013.6657495",
language = "English",
isbn = "9781467345439",
pages = "126--130",
booktitle = "2013 IEEE 8th International Symposium on Intelligent Signal Processing, WISP 2013 - Proceedings",
publisher = "IEEE Computer Society",

}

TY - GEN

T1 - Efficient TDMA scheduling algorithms for sensor networks containing multiple rings

AU - Orosz, Ákos

AU - Róth, Gergo

AU - Simon, G.

PY - 2013

Y1 - 2013

N2 - In this paper a special ring topology is investigated for sensor networks, where the whole network is decomposed into subnetworks forming rings, and these subnetworks are connected to each other through a main ring. Each of these subnetworks may have different requirements concerning message delivery times. In this paper algorithms are proposed, which generate such networks from the connectivity graph, and create TDMA scheduling for the generated network. The proposed algorithms can handle the requirements of various delivery times, and can provide parallel operation of nodes, where possible, to decrease the overall length of the schedule. The theoretical results are supported by measurement examples.

AB - In this paper a special ring topology is investigated for sensor networks, where the whole network is decomposed into subnetworks forming rings, and these subnetworks are connected to each other through a main ring. Each of these subnetworks may have different requirements concerning message delivery times. In this paper algorithms are proposed, which generate such networks from the connectivity graph, and create TDMA scheduling for the generated network. The proposed algorithms can handle the requirements of various delivery times, and can provide parallel operation of nodes, where possible, to decrease the overall length of the schedule. The theoretical results are supported by measurement examples.

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

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

U2 - 10.1109/WISP.2013.6657495

DO - 10.1109/WISP.2013.6657495

M3 - Conference contribution

AN - SCOPUS:84892656071

SN - 9781467345439

SP - 126

EP - 130

BT - 2013 IEEE 8th International Symposium on Intelligent Signal Processing, WISP 2013 - Proceedings

PB - IEEE Computer Society

ER -