Scheduled persistence for medium access control in sensor networks

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

6 Citations (Scopus)

Abstract

For sensor networks, throughput may not be the most important metric to optimize in medium access control. For many applications, periodic reports are desirable suggesting the need for a time division (TDMA) access scheme. However for many reasons, including nonuniformity of deployment and the large number of sensor nodes anticipated, TDMA is impractical. In this paper, we explore scheduled persistence for medium access control in sensor networks. A continuum of approaches from simple randomized -persistent schedules at one extreme to topology-transparent schedules based on Steiner systems at the other are considered. We investigate the probability of obtaining a collision-free slot before a specified time (number of slots) and show that while the expected throughput of these approaches is the same, their variance is strikingly different. The schemes are also remarkably robust to high density. Furthermore, when schedules are chosen at random for each frame, scheduled persistence offers an interesting alternative for medium access control in sensor networks.

Original languageEnglish (US)
Title of host publication2004 IEEE International Conference on Mobile Ad-Hoc and Sensor Systems
Pages264-273
Number of pages10
StatePublished - 2004
Event2004 IEEE International Conference on Mobile Ad-Hoc and Sensor Systems - Fort Lauderdale, FL, United States
Duration: Oct 25 2004Oct 27 2004

Other

Other2004 IEEE International Conference on Mobile Ad-Hoc and Sensor Systems
CountryUnited States
CityFort Lauderdale, FL
Period10/25/0410/27/04

Fingerprint

Medium access control
Sensor networks
Time division multiple access
Throughput
Sensor nodes
Topology

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Colbourn, C., & Syrotiuk, V. (2004). Scheduled persistence for medium access control in sensor networks. In 2004 IEEE International Conference on Mobile Ad-Hoc and Sensor Systems (pp. 264-273)

Scheduled persistence for medium access control in sensor networks. / Colbourn, Charles; Syrotiuk, Violet.

2004 IEEE International Conference on Mobile Ad-Hoc and Sensor Systems. 2004. p. 264-273.

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

Colbourn, C & Syrotiuk, V 2004, Scheduled persistence for medium access control in sensor networks. in 2004 IEEE International Conference on Mobile Ad-Hoc and Sensor Systems. pp. 264-273, 2004 IEEE International Conference on Mobile Ad-Hoc and Sensor Systems, Fort Lauderdale, FL, United States, 10/25/04.
Colbourn C, Syrotiuk V. Scheduled persistence for medium access control in sensor networks. In 2004 IEEE International Conference on Mobile Ad-Hoc and Sensor Systems. 2004. p. 264-273
Colbourn, Charles ; Syrotiuk, Violet. / Scheduled persistence for medium access control in sensor networks. 2004 IEEE International Conference on Mobile Ad-Hoc and Sensor Systems. 2004. pp. 264-273
@inproceedings{105db9d312024ef4801152e2974830ae,
title = "Scheduled persistence for medium access control in sensor networks",
abstract = "For sensor networks, throughput may not be the most important metric to optimize in medium access control. For many applications, periodic reports are desirable suggesting the need for a time division (TDMA) access scheme. However for many reasons, including nonuniformity of deployment and the large number of sensor nodes anticipated, TDMA is impractical. In this paper, we explore scheduled persistence for medium access control in sensor networks. A continuum of approaches from simple randomized -persistent schedules at one extreme to topology-transparent schedules based on Steiner systems at the other are considered. We investigate the probability of obtaining a collision-free slot before a specified time (number of slots) and show that while the expected throughput of these approaches is the same, their variance is strikingly different. The schemes are also remarkably robust to high density. Furthermore, when schedules are chosen at random for each frame, scheduled persistence offers an interesting alternative for medium access control in sensor networks.",
author = "Charles Colbourn and Violet Syrotiuk",
year = "2004",
language = "English (US)",
isbn = "0780388151",
pages = "264--273",
booktitle = "2004 IEEE International Conference on Mobile Ad-Hoc and Sensor Systems",

}

TY - GEN

T1 - Scheduled persistence for medium access control in sensor networks

AU - Colbourn, Charles

AU - Syrotiuk, Violet

PY - 2004

Y1 - 2004

N2 - For sensor networks, throughput may not be the most important metric to optimize in medium access control. For many applications, periodic reports are desirable suggesting the need for a time division (TDMA) access scheme. However for many reasons, including nonuniformity of deployment and the large number of sensor nodes anticipated, TDMA is impractical. In this paper, we explore scheduled persistence for medium access control in sensor networks. A continuum of approaches from simple randomized -persistent schedules at one extreme to topology-transparent schedules based on Steiner systems at the other are considered. We investigate the probability of obtaining a collision-free slot before a specified time (number of slots) and show that while the expected throughput of these approaches is the same, their variance is strikingly different. The schemes are also remarkably robust to high density. Furthermore, when schedules are chosen at random for each frame, scheduled persistence offers an interesting alternative for medium access control in sensor networks.

AB - For sensor networks, throughput may not be the most important metric to optimize in medium access control. For many applications, periodic reports are desirable suggesting the need for a time division (TDMA) access scheme. However for many reasons, including nonuniformity of deployment and the large number of sensor nodes anticipated, TDMA is impractical. In this paper, we explore scheduled persistence for medium access control in sensor networks. A continuum of approaches from simple randomized -persistent schedules at one extreme to topology-transparent schedules based on Steiner systems at the other are considered. We investigate the probability of obtaining a collision-free slot before a specified time (number of slots) and show that while the expected throughput of these approaches is the same, their variance is strikingly different. The schemes are also remarkably robust to high density. Furthermore, when schedules are chosen at random for each frame, scheduled persistence offers an interesting alternative for medium access control in sensor networks.

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

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

M3 - Conference contribution

AN - SCOPUS:20344404964

SN - 0780388151

SN - 9780780388154

SP - 264

EP - 273

BT - 2004 IEEE International Conference on Mobile Ad-Hoc and Sensor Systems

ER -