Skip to main content
Log in

An implicit GTS allocation mechanism in IEEE 802.15.4 for time-sensitive wireless sensor networks: theory and practice

  • Published:
Real-Time Systems Aims and scope Submit manuscript

Abstract

Timeliness guarantee is an important feature of the recently standardized IEEE 802.15.4 protocol, turning it quite appealing for Wireless Sensor Network (WSN) applications under timing constraints. When operating in beacon-enabled mode, this protocol allows nodes with real-time requirements to allocate Guaranteed Time Slots (GTS) in the contention-free period. The protocol natively supports explicit GTS allocation, i.e. a node allocates a number of time slots in each superframe for exclusive use. The limitation of this explicit GTS allocation is that GTS resources may quickly disappear, since a maximum of seven GTSs can be allocated in each superframe, preventing other nodes to benefit from guaranteed service. Moreover, the GTS may be underutilized, resulting in wasted bandwidth. To overcome these limitations, this paper proposes i-GAME, an implicit GTS Allocation Mechanism in beacon-enabled IEEE 802.15.4 networks. The allocation is based on implicit GTS allocation requests, taking into account the traffic specifications and the delay requirements of the flows. The i-GAME approach enables the use of one GTS by multiple nodes, still guaranteeing that all their (delay, bandwidth) requirements are satisfied. For that purpose, we propose an admission control algorithm that enables to decide whether to accept a new GTS allocation request or not, based not only on the remaining time slots, but also on the traffic specifications of the flows, their delay requirements and the available bandwidth resources. We show that our approach improves the bandwidth utilization as compared to the native explicit allocation mechanism defined in the IEEE 802.15.4 standard. We also present some practical considerations for the implementation of i-GAME, ensuring backward compatibility with the IEEE 801.5.4 standard with only minor add-ons. Finally, an experimental evaluation on a real system that validates our theoretical analysis and demonstrates the implementation of i-GAME is also presented.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Cavalieri S, Monforte S, Corsaro A, Scapellato G (2003) Multicycle polling scheduling algorithms for fieldbus networks. J Real-Time Syst 25:157–185

    Article  MATH  Google Scholar 

  • Chipcon (2004) CC2420 transceiver datasheet, http://www.chipcon.com

  • Chipcon, (2005) User Manual Rev. 01—CC2420 ZDK Development Kit, http://www.chipcon.com

  • Crossbow (2004) MICAz datasheet, http://www.xbow.com

  • Cunha A, Koubâa A, Alves M (July 2006) Implementation of the i-GAME mechanism in IEEE 802.15.4 WPANs. IPP-HURRAY technical report, TR060702

  • Feng X, Mok A (2002) A model of hierarchical real-time virtual resources. In: IEEE Real Time System Symposium. IEEE Computer Society, Austin

    Google Scholar 

  • Gay D, Levis P, von Behren R, Welsh M, Brewer E, Culler D (2003) The nesC language: a holistic approach to networked embedded systems. In: Proceedings of the programming language design and implementation

  • Hill J (2003) System architecture for wireless sensor networks. In: Computer Science Department. University of California, Berkeley

    Google Scholar 

  • IEEE-TG15.4 (2003) Part 15.4: wireless medium access control (MAC) and physical layer (PHY) specifications for low-rate wireless personal area networks (LR-WPANs). IEEE standard for information technology

  • Koubâa A, Alves M, Tovar E (2005) A two-tiered architecture for real-time communications in large-scale wireless sensor networks: research challenges. In: 17th Euromicro conference on real-time systems (ECRTS’05), WiP session, Palma de Mallorca

  • Koubâa A, Alves M, Tovar E (2006) GTS allocation analysis in IEEE 802.15.4 for real-time wireless sensor networks. In: 14th international workshop on parallel and distributed real-time systems (WPDRTS 2006). IEEE, Rhodes Island

    Google Scholar 

  • Koubâa A, Song YQ (2004) Evaluation and improvement of response time bounds for real-time applications under non-pre-emptive fixed priority scheduling. Int J Prod Res 42:2899–2913

    Article  MATH  Google Scholar 

  • Leboudec J-Y, Thiran P (2001) A theory of deterministic queuing systems for the Internet. Lecture notes in computer science (LNCS), vol 2050

  • Raja P, Noubir G (1993) Static and dynamic polling mechanisms for fieldbus networks. ACM SIGOPS Oper Syst Rev 27:34–45

    Article  Google Scholar 

  • Yoo S-E, Kim D, Pham M-L, Doh Y, Choi E, Huh J-D (2005) Scheduling support for guaranteed time services in IEEE 802.15.4 low rate WPAN. In: 11th IEEE international conference on embedded and real-time computing systems and applications (RTCSA’05). IEEE Computer Society, Hong Kong

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Anis Koubâa.

Additional information

This work was partially funded by FCT under CISTER research unit (UI608), by the PLURALITY project (CONC-REEQ/900/2001) and ARTIST2.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Koubâa, A., Alves, M., Tovar, E. et al. An implicit GTS allocation mechanism in IEEE 802.15.4 for time-sensitive wireless sensor networks: theory and practice. Real-Time Syst 39, 169–204 (2008). https://doi.org/10.1007/s11241-007-9038-x

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11241-007-9038-x

Keywords

Navigation