 |
 |
||||||||
|
|||||||||
|
|
|||||||||
|
||
|
|
|
|
|
Wireless sensor networks operate in unattended and untethered mode where power consumption is of greatest importance. General purpose adaptive infrastructures are useful for dissemination of user interests and collection of sensor data. In this thesis, a sensor querying mechanism which provides local query optimization and in-network message concatenation for energy efficient response delivery is presented. The protocol is designed to operate as the lowest tier of a hierarchical architecture that enables access to tiny sensors in the target domain from a monitoring application via a service aware ad hoc backbone. Queries are classified according to data generation characteristics and the components of the querying system are explained in this context. A comparative data traffic analysis and experimental performance results of the prototype implementation on TinyOS running Berkeley mica motes are also given. The results have revealed that local optimization can reduce bit transmission by a multiple of user supplied sampling period parameter and message concatenation can further reduce transmission by 75%. It has also been shown the application specific quality of service parameters can effectively be used to construct sensor querying networks dynamically. |
|
|
|
|
||
 |
|
|
||||||||||||||||||
| |||||||||||||||||||
|
|
|
|