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).
Highlights
Wireless sensor networks have emerged as an innovative class of networked systems due to the union of smaller, cheaper embedded processors and wireless interfaces with sensors based on micro-mechanical systems (MEMS) technology
We propose a query-based routing tree, called energy-efficient dynamic routing tree (EDRT) that is separately constructed for each query by utilizing the query information
We proposed a query-based EDRT scheme, which is constructed dynamically for each query
Summary
Wireless sensor networks have emerged as an innovative class of networked systems due to the union of smaller, cheaper embedded processors and wireless interfaces with sensors based on micro-mechanical systems (MEMS) technology. The main idea of in-network processing is to reduce volumes of data in the network by partially aggregating sensed values or merging intermediate data. For aggregation queries such as MAX, SUM and COUNT, an intermediate node may aggregate them and send only a newly computed value instead of just forwarding all values received from its children. For a SUM query, an intermediate node forwards only the added value among the values received from its children These aggregate queries reduce the number of messages, reducing power consumption. We propose a query-based routing tree, called energy-efficient dynamic routing tree (EDRT) that is separately constructed for each query by utilizing the query information.
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Advanced Computer Science and Applications
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
