Dynamic and Scalable Routing to Perform Efficient Data Aggregation in Wireless Sensor Networks
Data aggregation is one of the main methods to conserve energy in Wireless Sensor Networks (WSN). Redundant data can be aggregated at intermediate nodes of a WSN reducing the number of messages exchanged and, consequently, reducing communication costs. Most data aggregation protocols are generally based on a static routing scheme. Although those protocols can save energy by eliminating data redundancy, in dynamic scenarios, they can incur high overhead to reconstruct the routing tree. In this paper, they consider the problem of constructing a dynamic and scalable structure for data aggregation in WSNs.