| Summary: | 碩士 === 國立臺南大學 === 資訊教育研究所 === 94 === With the advances of sensors in recent, they can be used to collect information as well as have the abilities of sensing and communication. A wireless sensor network consists of a large number of sensors connected via wireless communication. This thesis proposes an efficient data aggregation algorithm with range query capability for sensor networks. The proposed aggregation and query mechanisms are based on a virtual grid. In each grid, a head node is selected to be a manager. When an event is generated and is detected by a head node. All the other head nodes are singled via data announcement from the detected head node. A user, a mobile sink, queries the event via a head node, called agent, within the same grid. According to the received event type, the user issues an enquiry message to query the sensor network with a specific regular or irregular shape range. The user queries and aggregates the data in the regular-shape range. In addition, due to the contiguous event occurred, the user queries and aggregates the data in the irregular-shape range. While the information is collected from the sensor range, the information will be sent back to the user. Furthermore, we propose efficient approaches to gather the information from sensor networks with void or obstacle. Finally, experimental results show that our proposed approaches are energy-efficiency than the existing approach.
|
|---|
