Dynamic Conflict-free Query Scheduling for Wireless Sensor Networks

  • Authors:
  • Octav Chipara;Chenyang Lu;John Stankovic

  • Affiliations:
  • Department of Computer Science and Engineering, Washington University in St. Louis. ochipara@cse.wustl.edu;Department of Computer Science and Engineering, Washington University in St. Louis. lu@cse.wustl.edu;Department of Computer Science, University of Virginia. stankovic@cs.virginia.edu

  • Venue:
  • ICNP '06 Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

With the emergence of high data rate sensor net-work applications, there is an increasing demand for high-performance queryservices in such networks. To meet this challenge, we propose Dynamic Conflict-free Query Scheduling (DCQS), a novel schedulingtechnique for queries in wireless sensor networks. In contrast to earlier TDMA protocols designed for general-purpose networksand workloads, DCQS is specifically designed for query services supporting in-network data aggregation. DCQS has several importantfeatures. First, it optimizes the query performance and energy efficiency by exploiting the temporal properties and precedenceconstraints introduced by data aggregation. Second, it can efficiently adapt to dynamic workloads and rate changes withoutexplicitly reconstructing the transmission schedule. In addition, we provide an analytical capacity bound for DCQS in termsof query completion rate. This bound enables DCQS to handle overload through rate control. NS2 simulation results demonstratethat DCQS significantly outperforms a representative TDMA protocol (DRAND) and the 802.11 protocol in terms of query latency,throughput, and energy efficiency.