Energy-Efficient Data Fusion in WSNs Using Mobility-Aware Compression and Adaptive Clustering

Abstract

To facilitate energy-efficient information dissemination from multiple sensors to the sink within Wireless Sensor Networks (WSNs), in-network data fusion is imperative. This paper presents a new WSN topology that incorporates the Mobility-Efficient Data Fusion (MEDF) algorithm, which integrates a data-compression protocol with an adaptive-clustering mechanism. The primary goals of this topology are, first, to determine a dynamic sequence of cluster heads (CHs) for each data transmission round, aiming to prolong network lifetime by implementing an adaptive-clustering mechanism resilient to network dynamics, where CH selection relies on residual energy and minimal communication distance; second, to enhance packet delivery ratio (PDR) through the application of a data-compression technique; and third, to mitigate the hot-spot issue, wherein sensor nodes nearest to the base station endure higher relay burdens, consequently influencing network longevity. To address this issue, mobility models provide a straightforward solution; specifically, a Random Positioning of Grid Mobility (RPGM) model is employed to alleviate the hot-spot problem. The simulation results show that the network topology incorporating the proposed MEDF algorithm effectively enhances network longevity, optimizes average energy consumption, and improves PDR. Compared to the Energy-Efficient Multiple Data Fusion (EEMDF) algorithm, the proposed algorithm demonstrates enhancements in PDR and energy efficiency, with gains of 5.2% and 7.7%, respectively. Additionally, it has the potential to extend network lifetime by 13.9%. However, the MEDF algorithm increases delay by 0.01% compared to EEMDF. The proposed algorithm is also evaluated against other algorithms, such as the tracking-anchor-based clustering method (TACM) and Energy-Efficient Dynamic Clustering (EEDC), the obtained results emphasize the MEDF algorithm’s ability to conserve energy more effectively than the other algorithms.