OD2AS: Optimal Distributed Data Aggregation Scheduling in wireless sensor network

Abstract

In this paper, we investigate the minimum data aggregation scheduling problem in wireless sensor networks (WSNs), aiming to nd the free-collision schedule that routes and aggregates the data on all the sensor nodes to the sink node in minimal time. To address this problem, we propose a new algorithm, named Optimal Distributed Data Aggregation Scheduling (OD2AS). OD2AS is based on three key design features that can ensure e cient and optimal aggregation scheduling, which are : (1) simultaneous execution of aggregation tree construction and scheduling, (2) parent selection criteria that maximize the choices of parents for each node and maximize time slot reuse, and (3) distributed execution of the algorithm. Simulations results show that OD2AS outperforms four competitive state-of-the-art aggregation scheduling algorithms in terms of latency and network lifetime. It also incurs lower message overhead than the sole existing distributed algorithm.