Constructing Load-Balanced Data Aggregation Trees in Probabilistic Wireless Sensor Networks

Authored by: Jing (Selena) He

Handbook of Sensor Networking

Print publication date:  January  2015
Online publication date:  January  2015

Print ISBN: 9781466569713
eBook ISBN: 9781466569720
Adobe ISBN:


 Download Chapter



In wireless sensor networks (WSNs), sensor nodes periodically sense the monitored environment and send the information to the sink (or base station), at which the gathered/collected information can be further processed for end-user queries. In this data gathering process, data aggregation can be used to fuse data from different sensors to eliminate redundant transmissions, since the data sensed by different sensors have spatial and temporal correlations [1]. Hence, through this in-network data aggregation technique, the amount of data that needs to be transmitted by a sensor is reduced, which in turn decreases each sensor’s energy consumption so that the whole network lifetime is extended. For continuous monitoring applications with a periodical traffic pattern, a tree-based topology is often adopted to gather and aggregate sensing data because of its simplicity. Compared with an arbitrary network topology, a tree-based topology conserves the cost of maintaining a routing table at each node, which is computationally expensive for the sensor nodes with limited resources. For clarification, data gathering trees capable of performing aggregation operations are also referred to as data aggregation trees (DATs), which are directed trees rooted at the sink and have a unique directed path from each node to the sink. Additionally, in a DAT, sensing data from different sensors are combined at intermediate sensors according to certain aggregation functions including COUNT, MIN, MAX, SUM, and AVERAGE [2].

Search for more...
Back to top

Use of cookies on this website

We are using cookies to provide statistics that help us give you the best experience of our site. You can find out more in our Privacy Policy. By continuing to use the site you are agreeing to our use of cookies.