Dynamic Conflict-free Query Scheduling for Wireless Sensor Networks
Dynamic Conflict-free Query Scheduling for Wireless Sensor Networks
复制标题
DOI：
10.1109/icnp.2006.320182
复制
发表时间：
2006-11
期刊：
影响因子：
--
通讯作者：
O. Chipara;Chenyang Lu;J. Stankovic
中科院分区：
文献类型：
--
作者：
O. Chipara;Chenyang Lu;J. Stankovic
随着高数据速率传感器网络应用的出现，此类网络对高性能查询服务的需求不断增加。为了应对这一挑战，我们提出了动态无冲突查询调度（DCQS），这是一种用于无线传感器网络中查询的新颖调度技术。与早期为通用网络和工作负载设计的 TDMA 协议相比，DCQS 专门为支持网络内数据聚合的查询服务而设计。 DCQS 有几个重要的特点。首先，它通过利用数据聚合引入的时间属性和优先级约束来优化查询性能和能源效率。其次，它可以有效地适应动态工作负载和速率变化，而无需显式重建传输调度。此外，我们还提供了 DCQS 在查询完成率方面的分析能力范围。此界限使 DCQS 能够通过速率控制来处理过载。 NS2 仿真结果表明，DCQS 在查询延迟、吞吐量和能源效率方面显着优于代表性 TDMA 协议 (DRAND) 和 802.11 协议。
With the emergence of high data rate sensor network applications, there is an increasing demand for high- performance query services in such networks. To meet this challenge, we propose Dynamic Conflict-free Query Scheduling (DCQS), a novel scheduling technique for queries in wireless sensor networks. In contrast to earlier TDMA protocols designed for general-purpose networks and workloads, DCQS is specifically designed for query services supporting in-network data aggregation. DCQS has several important features. First, it optimizes the query performance and energy efficiency by exploiting the temporal properties and precedence constraints introduced by data aggregation. Second, it can efficiently adapt to dynamic workloads and rate changes without explicitly reconstructing the transmission schedule. In addition, we provide an analytical capacity bound for DCQS in terms of query completion rate. This bound enables DCQS to handle overload through rate control. NS2 simulation results demonstrate that DCQS significantly outperforms a representative TDMA protocol (DRAND) and the 802.11 protocol in terms of query latency, throughput, and energy efficiency.