Enhancing Wireless Sensor Network Lifetime through Energy-Efficient Data Clustering and Compressed Forwarding in video Processing

Abstract

Wireless Sensor Networks (WSN) play a crucial role in diverse data gathering applications, but face a significant challenge in the form of limited energy reserves within sensor nodes. Enhancing the network's Quality of Service, particularly its lifetime, is paramount. Prolonging the network's operational span hinges on mitigating energy consumption, with communication accounting for a substantial portion of nodal power usage. By reducing data transmission, not only can energy consumption be curtailed, but also bandwidth requirements and network congestion can be minimized. In the context of Wireless Sensor Networks, the Distributed Similarity-based Clustering and Compressed Forwarding (DSCCF) approach strives to construct data-similar iso-clusters with minimal communication overhead. This technique involves extracting trend and magnitude components from lengthy data series using an LMS filter, resulting in what is termed data projection. Data similarity between nodes is assessed by measuring the Euclidean distance between these data projections, thereby facilitating efficient and low-overhead iso-cluster formation. To further economize intra-cluster communication, an adaptive-nLMS-based dual prediction framework is employed. During each data collection round, the cluster head holds instantaneous data for each cluster member, using either prediction or direct data communication. Furthermore, inter-cluster data is reduced via a multi-level lossless compressive forwarding technique. Impressively, this proposed approach has achieved an 80% reduction in data while maintaining optimal data accuracy for the collected information. The transmission of inter-cluster data exclusively occurs through a network backbone comprised solely of cluster heads. Initially, the cluster heads establish this network backbone. Each cluster head dispatches a link request query towards the sink through the backbone, receiving a link reply message containing path length and the weakest link of the path. The cluster head repeats this process for each available path, subsequently selecting the most optimal path based on the acquired information and its reliability in terms of link quality