i-GAME: An implicit GTS allocation mechanism in IEEE 802.15.4 for time-sensitive wireless sensor networks

被引:53
作者
Koubaa, Anis [1 ]
Alves, Mario [1 ]
Tovar, Eduardo [1 ]
机构
[1] Polytech Inst Porto, IPP HURRAY Res Grp, Rua Dr Antonio Bernardino Almeida 431, P-4200072 Oporto, Portugal
来源
18TH EUROMICRO CONFERENCE ON REAL-TIME SYSTEMS, PROCEEDINGS | 2006年
关键词
D O I
10.1109/ECRTS.2006.13
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
The IEEE 802.15.4 Medium Access Control (MAC) protocol is an enabling technology for time sensitive wireless sensor networks thanks to its Guaranteed-Time Slot (GTS) mechanism in the beacon-enabled mode. However, the protocol only 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 he allocated in each superframe, preventing other nodes to benefit from guaranteed service. Moreover, the GTSs may he only partially used, 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 a GTS by multiple nodes, while all their (delay, bandwidth) requirements are still 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 proposal improves the bandwidth utilization compared to the explicit allocation used in the IEEE 802.15.4 protocol 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.
引用
收藏
页码:183 / +
页数:2
相关论文
共 7 条
[1]   Multicycle polling scheduling algorithms for FieldBus networks [J].
Cavalieri, S ;
Monforte, S ;
Corsaro, A ;
Scapellato, G .
REAL-TIME SYSTEMS, 2003, 25 (2-3) :157-185
[2]  
IEEE, 2003, 802154 IEEE
[3]   Evaluation and improvement of response time bounds for real-time applications under non-pre-emptive Fixed Priority Scheduling [J].
Koubaa, A ;
Song, YQ .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2004, 42 (14) :2899-2913
[4]  
KOUBAA A, 2005, P 17 EUR C REAL TIM
[5]  
Koubaa A., 2006, 802154 IEEE
[6]  
Le Boudec J.-Y., 2001, LNCS, V2050
[7]  
RAJA P, 1993, ACM OPERATING SYSTEM, V27, P34