Go to:
Logótipo
Comuta visibilidade da coluna esquerda
Você está em: Start > Publications > View > Dynamic GTS scheduling of periodic skippable slots in IEEE 802.15.4 Wireless Sensor Networks
Publication

Dynamic GTS scheduling of periodic skippable slots in IEEE 802.15.4 Wireless Sensor Networks

Title
Dynamic GTS scheduling of periodic skippable slots in IEEE 802.15.4 Wireless Sensor Networks
Type
Article in International Conference Proceedings Book
Year
2009
Authors
Tiago Semprebom
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Carlos Montez
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Ricardo Moraes
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Conference proceedings International
Pages: 110-117
Proceedings of 8th IFAC International Conference on Fieldbuses and Networks in Industrial and Embedded Systems (FeT’2009
Indexing
Publicação em Scopus Scopus
Scientific classification
FOS: Engineering and technology > Electrical engineering, Electronic engineering, Information engineering
Other information
Abstract (EN): The IEEE 802.15.4 standard offers a flexible communication solution for low-rate wireless small area networks. When the beacon mode is enabled, real-time communication is possible by using the Guaranteed Time Slots (GTS) mechanism. However, the beacon-enabled mode only supports a maximum of seven GTS allocated in each superframe, preventing other nodes to benefit from the guaranteed service. This paper introduces the SIGHT (Skips In GTS scHeduling for IEEE 802.15.4 neTworks) model, which incorporates a dynamic GTS allocation policy for IEEE 802.15.4 networks based on the (m,k)-firm task model. Our approach ensures that at least m messages are allocated in a guaranteed slot, for any k consecutive superframes. It adopts a deterministic schedulability test and an on-line prioritization heuristic algorithm called Slotted DBP (Distance Based Priority) to attend requests according to this schedulability model. A simulation model has been developed, in order to compare the behaviour in overload conditions of the proposed Slotted DBP with other approaches (DWCS and FIFO).
Language: English
Type (Professor's evaluation): Scientific
No. of pages: 8
Documents
We could not find any documents associated to the publication with allowed access.
Recommend this page Top
Copyright 1996-2024 © Reitoria da Universidade do Porto  I Terms and Conditions  I Acessibility  I Index A-Z  I Guest Book
Page created on: 2024-09-19 03:15:42 | Acceptable Use Policy | Data Protection Policy | Complaint Portal