Slot Allocation Algorithms for Minimizing Delay in Alarm-Driven WSNs Applications

Slot Allocation Algorithms for Minimizing Delay in Alarm-Driven WSNs Applications

Mário Macedo (INESC-ID, Portugal), António Grilo (INESC-ID, Portugal) and Mário Nunes (INESC-ID, Portugal)
DOI: 10.4018/jbdcn.2009040105
OnDemand PDF Download:
$37.50

Abstract

Energy-efficiency and latency requirements in alarm-driven Wireless Sensor Networks often demand the use of TDMA protocols with special features such as cascading of timeslots, in a way that the sensor-to-sink delay bound can stay below the duration of a single frame. However, this single TDMA frame should be as small as possible. The results presented in this paper, point to the conclusion that a largest-distances-first strategy can achieve the smallest single frame sizes, and also the lowest frame size variations. A quite simple distributed version of this algorithm is presented, which obtains the same results of its centralized version. Simulations also show that this discipline presents the best results in terms of sensor-to-sink slot distance, even if they require a few more slots than breadth-first in multi-frame scenarios.

Complete Article List

Search this Journal:
Reset
Open Access Articles: Forthcoming
Volume 13: 2 Issues (2017): Forthcoming, Available for Pre-Order
Volume 12: 2 Issues (2016)
Volume 11: 2 Issues (2015)
Volume 10: 4 Issues (2014)
Volume 9: 4 Issues (2013)
Volume 8: 4 Issues (2012)
Volume 7: 4 Issues (2011)
Volume 6: 4 Issues (2010)
Volume 5: 4 Issues (2009)
Volume 4: 4 Issues (2008)
Volume 3: 4 Issues (2007)
Volume 2: 4 Issues (2006)
Volume 1: 4 Issues (2005)
View Complete Journal Contents Listing