Semi-Dynamic Tree Scheduling Process for Wireless Sensor Networks

This paper presents Semi-Dynamic Tree Scheduling Process for Wireless Sensor Networks (WSN). We combined two type of scheduling in this study: the static scheduling for coordinator nodes and the dynamic scheduling for leaf nodes. We consider a cluster tree topology in our study with, one main coordinator (Personal Area Network Coordinator), several children coordinators (Routers) and several end devices (leafs). We implement the scheduling algorithm on the PAN Coordinator. The experimental implementation is done over TelosB sensors under TinyOS environment.