An Energy-Aware Periodical Data Gathering Protocol Using Deterministic Clustering in Wireless Sensor Networks (WSN)

Abstract

One major concern of energy constrained WSN technology is to design energy efficient communication protocol. Clustering the whole network is an efficient solution to increase its life time. In this paper, we propose a clustering based communication protocol for periodical data gathering application in wireless sensor network. It uses the scheduled rotation of cluster heads, which eliminates the problem with the variability of the number of clusters generated in the dynamic, distributed and randomized protocol. Proposed protocol shows more energy efficiency by only triggering the cluster formation when cluster heads energy level falls below a certain threshold. In the simulation, our protocol shows better performance than that of LEACH (Low Energy Adaptive Clustering Hierarchy) protocol in respect of energy dissipation and number of survival nodes. Furthermore this protocol performs higher number of rounds than that of LEACH in case of the first node and 60% nodes die in the network.

An Energy efficient WSN with cooperative relaying technique

“…Then all the CHs collect their member health information and transmit the same to the BS along with present frame data. This decision is taken based on the CH residual energy (E Residual ) and energy consumed in previous frame (E disp f rame ) [7].…”

On Clustering in Sensor Networks

“…1.1) is crucial for the performance of the network. Research about the choice itself or methods to reduce the overhead due to the signalling necessary to renew the cluster heads have been carried, either by letting the cluster heads directly transmit to their successors the role of cluster head based on the information exchanged the first time to choose the first cluster heads, (e. g. Rajiullah & Shimamoto (2007), Nam & Min (2007)), or by using an information transmitted in the data frames (cf. Gerla et al (2000)).…”

“…Lin & Gerla (1997)). In Rajiullah & Shimamoto (2007), Rajiullah and Shimamoto propose to decrease the traffic and processing load necessary to renew the choice of the cluster head by letting the first cluster heads to decide which nodes will be cluster heads later. A cluster head, as soon as it has reached a low energy threshold, pass the baton to the next one, which advertises its neighborhood that it becomes the new cluster head.…”

Self-Learning-Based Data Aggregation Scheduling Policy in Wireless Sensor Networks

“…As one of the most fundamental capability for WSNs, data collection aims to deliver the data generated from the monitoring area or object to the users who have interests on them [1]. The operations of wireless communication normally consume the most part of energy due to the electronic characteristics of sensor devices [2].…”