TY - GEN
T1 - Scheduled persistence for medium access control in sensor networks
AU - Colbourn, Charles
AU - Syrotiuk, Violet
PY - 2004/12/1
Y1 - 2004/12/1
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
T3 - 2004 IEEE International Conference on Mobile Ad-Hoc and Sensor Systems
SP - 264
EP - 273
BT - 2004 IEEE International Conference on Mobile Ad-Hoc and Sensor Systems
T2 - 2004 IEEE International Conference on Mobile Ad-Hoc and Sensor Systems
Y2 - 25 October 2004 through 27 October 2004
ER -