Copyright Statement: This is an open access article licensed under a Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, even commercially as long as the original work is properly cited.
Digital Object Identifier (DOI) : 10.14569/IJACSA.2012.030222
Article Published in International Journal of Advanced Computer Science and Applications(IJACSA), Volume 3 Issue 2, 2012.
Abstract: To exploit in answering queries generated by the sink for the sensor networks, we propose an efficient routing protocol called energy-efficient dynamic routing tree (EDRT) algorithm. The idea of EDRT is to maximize in-network processing opportunities using the parent nodes and sibling nodes. In-network processing reduces the number of message transmission by partially aggregating results of an aggregate query in intermediate nodes, or merging the results in one message. This results in reduction of communication cost. Our experimental results based on simulations prove that our proposed method can reduce message transmissions more than query specific routing tree (QSRT) and flooding-based routing tree (FRT).
Si Gwan Kim and Hyong Soon Park, “Energy-Efficient Dynamic Query Routing Tree Algorithm for Wireless Sensor Networks” International Journal of Advanced Computer Science and Applications(IJACSA), 3(2), 2012. http://dx.doi.org/10.14569/IJACSA.2012.030222