| Previous | [ 1] | [ 2] | [ 3] | [ 4] | [ 5] | [ 6] | [ 7] | [ 8] | [ 9] | [ 10] | [ 11] | [ 12] | [ 13] | [ 14] | [ 15] | [ 16] | [ 17] | [ 18] | [ 19] | [ 20] | [ 21] |
¡@
Tzung-Shi Chen+, Yi-Shiang Chang+, Hua-Wen Tsai and Chih-Ping Chu
+Department of Information and Learning Technology
National University of Tainan
Tainan, 700 Taiwan
E-mail: chents@mail.nutn.edu.tw
Department of Computer Science and Information Engineering
National Cheng Kung University
Tainan, 701 Taiwan
E-mail: chucp@csie.ncku.edu.tw
This work proposes efficient data aggregation algorithms for range query in wireless
sensor networks. The proposed aggregation and query mechanisms are based on a
virtual grid in sensor networks. A sensor node is selected to be a manager, named head,
in each grid. The head node detects the generated event, announces event to all heads,
and responds the query of mobile users. A user obtains the occurred event information
from its grid head. If a user is interested in the event, it issues a query to acquire data of a
specified regular-shape or spreading irregular-shape ranges. User can designate a regular
range for querying. To track the diffusing event, this work proposes an efficient distributed
algorithm for a dynamic tree structure in sensor networks. Users can oversee the
spreading event via querying the incurred irregular-shape range. Additionally, this work
proposes efficient approaches to gather data from sensor networks when voids exist. Finally,
experimental results show that the proposed approaches are more energy-efficiency
than the existing approach.
Received September 15, 2006; accepted February 6, 2007.
Communicated by Ten H. Lai, Chung-Ta King and Jehn-Ruey Jiang.
*This work was supported in part by the National Science Council of Taiwan, R.O.C., under grants No. NSC-
95- 2221-E-024-012 and NSC-95-2524-S-156-001.