Distributed clustering approach for wireless sensor network based cellular data placement model

Requiring all the nodes in a large-scale wireless sensor network to communicate their data to their respective destination will deplete the energy of the nodes quickly due to the long-distance and multi-hop nature of the communication and will also results in network contention. Therefore to increase longevity and support scalability, nodes are often grouped into disjoint and mostly non-overlapping clusters. Clustering saves energy and reduces network contention by enabling locality of communication: nodes communicate their data over shorter distances to their respective cluster-heads. The cluster-heads aggregate these data into a smaller set of meaningful information. Not all nodes, but only the cluster-heads need to communicate far distances to their respective destinations. In this paper, we propose a distributed clustering approach for our proposed real time data placement model for WSNs. It is assumed that the sensor nodes are aware of their locations in their deployment area, and they are time synchronized. For data dissemination and action in the wireless sensor network the usage of Action and Relay Stations (ARS) has been proposed.