WIRELESS sensor networks (WSNs) can be readily deployed in various environments to collect information in an autonomous manner, and thus can support abundant applications such as habitat monitoring, moving target tracking, and fire detection. WSNs are generally event-based systems, and consist of one or more sinks which is responsible for gathering specific data by sending queries. Sensor nodes are densely deployed and responsible for detecting interesting events and sending related data to sinks. The collaborative signal processing algorithms can be designed in WSN applications to improve the sensing performance. A data fusion technique, which can merge raw data from multiple sources to achieve improved accuracies and more specific inferences than could be achieved by use of a single sensor alone, has been employed in sensor network systems for target detection, localization, and classification. WSN community, most investigations on data aggregation schemes focus on designing proper strategies to drive the packets carrying redundant and correlated data converge spatially and temporally, which will provide more chances and more sufficient conditions for actual aggregation operations. The data aggregation schemes can the existing data aggregation schemes can effectively make packets more spatially and temporally convergent to improve aggregation efficiency, most of them assume that there are homogeneous sensors and only one application in WSNs, and ignore considering whether the packets really carry redundant and correlated information or not. Actually, nodes are equipped with various sensors (i.e., pressure, temperature, humidity, light intensity, etc.) and different applications can also run in the same WSN simultaneously.
You are here: Home / bulk ieee projects 2013 / Packet driven timing scheme for dynamic routing in wireless sensor networks