10-05-2012, 01:54 PM
Dynamic Conflict-Free Transmission Scheduling for Sensor Network Queries
Dynamic conflict free transmission.docx (Size: 13.97 KB / Downloads: 31)
Abstract
With the emergence of high data rate sensor network applications, there is an increasing demand for high-performance
query services. 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 workloads, DCQS is
specifically designed for query services in wireless sensor networks. DCQS has several unique features. First, it optimizes the query
performance through conflict-free transmission scheduling based on the temporal properties of queries in wireless sensor networks.
Second, it can adapt to workload changes without explicitly reconstructing the transmission schedule. Furthermore, DCQS also
provides predictable performance in terms of the maximum achievable query rate. We provide an analytical capacity bound for DCQS
that enables DCQS to handle overload through rate control. NS2 simulations demonstrate that DCQS significantly outperforms a
representative TDMA protocol (DRAND) and 802.11b in terms of query latency and throughput.
Existing System:
With the emergence of high data rate sensor network applications, there is an increasing demand for high-performance query services. To meet this challenge Instances of these queries are executed periodically to collect data at the base station. The use of routing trees inexecuting query instances introduces precedence constraints among packet transmissions. For example, when data aggregation is used, a node must wait for its children’s data reports before computing an aggregated data report and relaying it to its parent. queries in wireless sensor networks. In contrast to earlier TDMA protocols designed for general-purpose workloads, DCQS is
Proposed System:
networks and adapt to workload changes.To meet this challenge, we propose Dynamic Conflict-free Query Scheduling (DCQS), an integrated framework for transmission scheduling designed to meet the communication needs of high data rate applications. A data collection application may express its collection interests as queries over subsets of nodes which may involve data aggregation Instances of these queries are executed periodically to collect data at the base station.
Hard Ware Requirements
Processor:: Pentium-III (or) Higher
Ram:: 64MB (or) Higher
Cache:: 512MB
Hard disk:: 10GB
Soft Ware Requirements
Operating System : Windows 2000 server Family or higher version
Techniques : JDK 1.5
Data Bases : Oracle10g
Front End : Java ,Awt,Swing.