A Dynamic Priority Assignment Technique for Streams with (m, k)-Firm Deadlines
IEEE Transactions on Computers
Skip-Over: algorithms and complexity for overloaded systems that allow skips
RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
An Adaptive Scheduling Approach in Real-Time CORBA
ISORC '99 Proceedings of the 2nd IEEE International Symposium on Object-Oriented Real-Time Distributed Computing
Overload management in sensor-actuator networks used for spatially-distributed control systems
Proceedings of the 1st international conference on Embedded networked sensor systems
Dynamic Window-Constrained Scheduling of Real-Time Streams in Media Servers
IEEE Transactions on Computers
| Hi-index | 0.00 |
IEEE 802.15.4/Zigbee is one of the most widespread Wireless Sensor Network technologies. It may work either in beacon-enabled mode or in beaconless mode. When operating in beacon-enabled mode, it divides the superframe in sixteen equally-sized time slots, where the request for slot allocation is achieved through a CSMA/CA approach. This allocation method does not allow the provision of any service differentiation scheme, which is required for the transfer of time constrained messages. This paper proposes a QoS provision approach with minimal changes to existing protocols. Our approach improves the CSMA/CA algorithm by assigning decentralized priorities based on the (m,k)-firm task model. In this paper, a set of experimental results is presented and compared with the traditional approach currently offered by the standard. This set of experiments highlight the promising behavior of the proposed approach, when dealing with high network load scenarios.