a spare two-tier data aggregation for grid-based wireless sensor networks
This work proposes a spare two-tier data aggregation for grid-based wireless sensor networks. A sensor node is selected to be a header in each grid. The responsibility of header is to detect generated event, announce to all other headers, and respond to a mobile sink. A mobile sink obtains the occurred event information from its grid header. Each grid has two headers. All header nodes are randomly classified into two types, group-0 and group-1. To achieve the fault tolerance, two paths (path-0 for group-0 and path-1 for group-1) were constructed. This work provides two paths between roots and mobile sinks. This work can minimize energy consumption and enhance the network fault tolerance. In this paper, we also conducted some simulations to show that the proposed scheme outperforms the CODE and TTDD. If a user is interested in an event, it issues a query to acquire data from specified regular-shape ranges. In addition, this work proposes efficient approaches to gather data from sensor networks while voids exist. Finally, experimental results show that the proposed approaches are more energy-efficient than the existing approach.
data aggregation grid-based wireless sensor networks sink network lifetime