Affiliations: [a] School of Computing Science and Engineering, Galgotias University, India
| [b] Department of Information Technology, Kongu Engineering College, India
| [c] Department of Computer and Communication Engineering, Manipal University Jaipur, Jaipur, Rajasthan, India
| [d] Department of Computer Science and Engineering, Sharda University, Greater Noida, Uttar Pradesh, India
Correspondence:
[*]
Corresponding author. Punit Gupta, Department of Computer and Communication Engineering, Manipal University Jaipur, Jaipur-Ajmer Express Highway, Dehmi Kalan, Near GVK Toll Plaza, Jaipur, Rajasthan 30300, India. E-mail: punitg07@gmail.com.
Abstract: In Wireless Sensor Networks (WSNs), effective transmission with acceptable degradation in the power of sensor nodes is a key challenge. In a large network, holdup is bound to occur in communicating superfluous data. The aforementioned issues namely, energy, delay and data redundancy are interdependent on each other and a tradeoff needs to be worked out to improve the overall performance. The extant methods in the literature employ either centralized or distributed approach to select a cluster head (CH). In this paper, sink originated hybrid and dynamic clustering with routing technique is proposed. The proposed routing algorithm works based on node handling capability of each sensor node in the selection of CH and also helps in identifying the forwarder node. In addition, processing load of a sensor node is also considered for selecting the forwarder. Both space and time correlation is used to collect data from the clusters and then aggregated to provide a proficient communication. The introduced method is evaluated with the performance of the previously available techniques like, Data Routing for In-Network Aggregation (DRINA), Efficient Data Collection Aware of Spatio-Temporal Correlation (EAST), Cluster-Based Data Aggregation (CBDA), Energy-Efficient Data Aggregation and Transfer (EEDAT), and Distributed algorithm for Integrated tree Construction and data Aggregation (DICA). Simulation parameters considered for assess ing the performance of the proposed algorithm are aggregation ratio, routing overhead, packet delivery fraction, throughput, packet delay and consumed energy. The experimental analysis of the introduced algorithm generates paramount outcome of finest aggregation quality with diverse key characteristics and circumstances as required by a sensor network.
