HCDA: hybrid collision aware data aggregation in wireless sensor networks

Since the inception of wireless sensor networks, many protocols have been designed and developed to address various issues like energy, collision, delay and security. But the rapid developments of the wireless sensor networks are still as imperative research topic due to its deployment issues. This work minimises such issues in an energy efficient way by implementing a collision free data aggregation schedule. This article proposes a hybrid algorithm for data aggregation by constructing a collision free data aggregation tree called HCDA that improves the energy utilisation of the sensor nodes. The operation of HCDA is managed by two algorithms: 1) node discovery algorithm (NDA): each node finds its neighbours and chooses their corresponding child nodes to form a two-hop collision free aggregation tree; 2) hybrid data aggregation (HDA): by applying HDA algorithm on NDA aggregation tree, the sink node achieves the fast data aggregation in a collision free topology. The correctness of HCDA is formally proven and approximation and complexities have been analysed. In data aggregation process, the simulation results confirm the higher performance in terms of throughput, delivery ratio and packet delay.