COMPETENT SCHEDULING FOR INTERMITTENT AGGREGATION QUERIES IN MULTIHOP SENSOR NETWORKS

Recent advances in low-power computing and communication technologies have given rise to the proliferation of wireless sensor networks having low cost sensor nodes with limited processing capacity and battery power. Wireless sensor networks can be used in a wide range of applications such as industrial process monitoring and control, surveillance of critical areas and structures, and target tracking. Scheduling is the process of deciding how to commit resources between a variety of possible tasks. However in this paper we examine periodic query scheduling for data aggregation with minimum delay under interference models. For a set of periodic aggregation queries, every query which is having its own period and the subset of source nodes which contains the data. For that we propose a family of efficient and effective real time scheduling protocols that can answer every job of each query task within a relative delay. Scheduling protocol contains the phases routing, transmission plan constructions, node activity scheduling, and packet scheduling. Based on this protocol design, we further propose schedulability test schemes to efficiently and effectively test whether, for a set of queries, every query job can be finished within a finite delay