Reference pattern-based data aggregation in a wireless sensor network

Abstract

Advances in computing hardware have enabled the development of wireless sensors that can detect and report various real-world phenomena in real time. These systems face bandwidth, power, and throughput limitations that restrict the amount of information transmitted end-to-end. Data aggregation is a proven method for addressing these issues. We employ reference pattern-based data aggregation in a wireless sensor network to save energy and reduce redundancy. In traditional data aggregation, each node sends its data to the cluster head, which combines it and forwards it to the base station, consuming more energy. However, in ESPDA, each sensor node creates a pattern code for the sensed data using a lookup table and then transmits it to the cluster head. Pattern codes represent sensed data and are compact. Generating pattern codes from a lookup table poses challenges: first, creating the table requires more computational resources; second, finding critical values in the interval also consumes computational resources and energy. The new proposed mechanism lowers the use of computational and energy resources. We utilized a reference-based approach to generate the pattern codes. Simulation results show that the proposed mechanism is more energy- and computation-efficient compared to ESPDA.