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, António Grilo, Mário Nunes
Copyright: © 2009 |Volume: 5 |Issue: 2 |Pages: 16
ISSN: 1548-0631|EISSN: 1548-064X|ISSN: 1548-0631|EISBN13: 9781615201600|EISSN: 1548-064X|DOI: 10.4018/jbdcn.2009040105
Cite Article Cite Article

MLA

Macedo, Mário, et al. "Slot Allocation Algorithms for Minimizing Delay in Alarm-Driven WSNs Applications." IJBDCN vol.5, no.2 2009: pp.68-83. http://doi.org/10.4018/jbdcn.2009040105

APA

Macedo, M., Grilo, A., & Nunes, M. (2009). Slot Allocation Algorithms for Minimizing Delay in Alarm-Driven WSNs Applications. International Journal of Business Data Communications and Networking (IJBDCN), 5(2), 68-83. http://doi.org/10.4018/jbdcn.2009040105

Chicago

Macedo, Mário, António Grilo, and Mário Nunes. "Slot Allocation Algorithms for Minimizing Delay in Alarm-Driven WSNs Applications," International Journal of Business Data Communications and Networking (IJBDCN) 5, no.2: 68-83. http://doi.org/10.4018/jbdcn.2009040105

Export Reference

Mendeley
Favorite Full-Issue Download

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.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.