Analysis of a Self-organizing Algorithm for Time Slot Selection in Schedule-based Medium Access

L.F.W. van Hoesel, Paul J.M. Havinga

Research output: Book/ReportReportProfessional

20 Downloads (Pure)

Abstract

To ensure a long-lived network of wireless communicating sensors, it is necessary to have a medium access control protocol that is able to prevent energy-wasting behaviour like idle listening, hidden terminal problem or collision of packets. Schedule-based medium access protocols are in general robust against these effects, but require a mechanism to establish non-conflicting schedules. We present such a scheduling mechanism, which allows wireless sensors to choose a time interval for transmission, which is not interfering or causing collisions with other transmissions. We analyze the scheduling mechanism in the case that many nodes enter the time interval selection procedure simultaneously and potentially multiple selection rounds are required before each node has a non-conflicting schedule. In our proposed solution, we do not assume any hierarchical organization in the network and all operation is localized, making the network self-con��?guring.
Original languageUndefined
Place of PublicationEnschede
PublisherCentre for Telematics and Information Technology (CTIT)
Number of pages9
Publication statusPublished - Jan 2009

Publication series

NameCTIT Technical Report Series
PublisherCentre for Telematics and Information Technology, University of Twente
No.TR-CTIT-09-06
ISSN (Print)1381-3625

Keywords

  • METIS-263725
  • IR-65358
  • EWI-14996

Cite this

van Hoesel, L. F. W., & Havinga, P. J. M. (2009). Analysis of a Self-organizing Algorithm for Time Slot Selection in Schedule-based Medium Access. (CTIT Technical Report Series; No. TR-CTIT-09-06). Enschede: Centre for Telematics and Information Technology (CTIT).
van Hoesel, L.F.W. ; Havinga, Paul J.M. / Analysis of a Self-organizing Algorithm for Time Slot Selection in Schedule-based Medium Access. Enschede : Centre for Telematics and Information Technology (CTIT), 2009. 9 p. (CTIT Technical Report Series; TR-CTIT-09-06).
@book{94ef68c035c84a47be0d9ea32848cfa8,
title = "Analysis of a Self-organizing Algorithm for Time Slot Selection in Schedule-based Medium Access",
abstract = "To ensure a long-lived network of wireless communicating sensors, it is necessary to have a medium access control protocol that is able to prevent energy-wasting behaviour like idle listening, hidden terminal problem or collision of packets. Schedule-based medium access protocols are in general robust against these effects, but require a mechanism to establish non-conflicting schedules. We present such a scheduling mechanism, which allows wireless sensors to choose a time interval for transmission, which is not interfering or causing collisions with other transmissions. We analyze the scheduling mechanism in the case that many nodes enter the time interval selection procedure simultaneously and potentially multiple selection rounds are required before each node has a non-conflicting schedule. In our proposed solution, we do not assume any hierarchical organization in the network and all operation is localized, making the network self-con��?guring.",
keywords = "METIS-263725, IR-65358, EWI-14996",
author = "{van Hoesel}, L.F.W. and Havinga, {Paul J.M.}",
note = "http://eprints.ewi.utwente.nl/14996",
year = "2009",
month = "1",
language = "Undefined",
series = "CTIT Technical Report Series",
publisher = "Centre for Telematics and Information Technology (CTIT)",
number = "TR-CTIT-09-06",
address = "Netherlands",

}

van Hoesel, LFW & Havinga, PJM 2009, Analysis of a Self-organizing Algorithm for Time Slot Selection in Schedule-based Medium Access. CTIT Technical Report Series, no. TR-CTIT-09-06, Centre for Telematics and Information Technology (CTIT), Enschede.

Analysis of a Self-organizing Algorithm for Time Slot Selection in Schedule-based Medium Access. / van Hoesel, L.F.W.; Havinga, Paul J.M.

Enschede : Centre for Telematics and Information Technology (CTIT), 2009. 9 p. (CTIT Technical Report Series; No. TR-CTIT-09-06).

Research output: Book/ReportReportProfessional

TY - BOOK

T1 - Analysis of a Self-organizing Algorithm for Time Slot Selection in Schedule-based Medium Access

AU - van Hoesel, L.F.W.

AU - Havinga, Paul J.M.

N1 - http://eprints.ewi.utwente.nl/14996

PY - 2009/1

Y1 - 2009/1

N2 - To ensure a long-lived network of wireless communicating sensors, it is necessary to have a medium access control protocol that is able to prevent energy-wasting behaviour like idle listening, hidden terminal problem or collision of packets. Schedule-based medium access protocols are in general robust against these effects, but require a mechanism to establish non-conflicting schedules. We present such a scheduling mechanism, which allows wireless sensors to choose a time interval for transmission, which is not interfering or causing collisions with other transmissions. We analyze the scheduling mechanism in the case that many nodes enter the time interval selection procedure simultaneously and potentially multiple selection rounds are required before each node has a non-conflicting schedule. In our proposed solution, we do not assume any hierarchical organization in the network and all operation is localized, making the network self-con��?guring.

AB - To ensure a long-lived network of wireless communicating sensors, it is necessary to have a medium access control protocol that is able to prevent energy-wasting behaviour like idle listening, hidden terminal problem or collision of packets. Schedule-based medium access protocols are in general robust against these effects, but require a mechanism to establish non-conflicting schedules. We present such a scheduling mechanism, which allows wireless sensors to choose a time interval for transmission, which is not interfering or causing collisions with other transmissions. We analyze the scheduling mechanism in the case that many nodes enter the time interval selection procedure simultaneously and potentially multiple selection rounds are required before each node has a non-conflicting schedule. In our proposed solution, we do not assume any hierarchical organization in the network and all operation is localized, making the network self-con��?guring.

KW - METIS-263725

KW - IR-65358

KW - EWI-14996

M3 - Report

T3 - CTIT Technical Report Series

BT - Analysis of a Self-organizing Algorithm for Time Slot Selection in Schedule-based Medium Access

PB - Centre for Telematics and Information Technology (CTIT)

CY - Enschede

ER -

van Hoesel LFW, Havinga PJM. Analysis of a Self-organizing Algorithm for Time Slot Selection in Schedule-based Medium Access. Enschede: Centre for Telematics and Information Technology (CTIT), 2009. 9 p. (CTIT Technical Report Series; TR-CTIT-09-06).