Optimized Query Routing Trees for Wireless Sensor Networks

Download Now Free registration required

Executive Summary

In order to process continuous queries over Wireless Sensor Networks (WSNs), sensors are typically organized in a Query Routing Tree (denoted as T) that provides each sensor with a path over which query results can be transmitted to the querying node. The authors found that current methods deployed in predominant data acquisition systems construct T in a sub-optimal manner which leads to significant waste of energy. In particular since T is constructed in an ad-hoc manner there is no guarantee that a given query workload will be distributed equally among all sensors.

  • Format: PDF
  • Size: 1288.2 KB