Amazing technological breakthrough possible @S-Logix

Office Address

  • #5, First Floor, 4th Street Dr. Subbarayan Nagar Kodambakkam, Chennai-600 024 Landmark : Samiyar Madam
  • +91- 81240 01111

Social List

Clustering with Load Balancing-Based Routing Protocol for Wireless Sensor Networks - 2018

Clustering with Load Balancing-Based Routing Protocol for Wireless Sensor Networks

Research Area:  Wireless Sensor Networks


In this paper we propose a routing protocol based on clustering (IGP-C Protocol) to extend the lifetime in the context of wireless sensor networks while optimizing other resources (memory and processor). Firstly, a clustering algorithm and a load balancing technique are used together in order to reap the benefits of both approaches. The proposed clustering algorithm with load balancing (CALB Algorithm) is a fully distributed algorithm performed by each sensor and requires only communication with its immediate neighbors. Secondly, an Improved Gossiping Protocol (IGP) is proposed to extend the CALB algorithm to the data routing. The simulation results demonstrate the better and promising performances of the IGP-C protocol compared with the other protocols proposed in the literature. The IGP-C protocol allows a better distribution of energy, memory and processing capabilities of cluster-heads and reduces the number of clusters consisting of a single sensor along with the number of iterations. This demonstrates the effectiveness of the cluster-heads election process which improves the load balancing in the wireless sensors network in terms of cluster-heads load and clusters size. Furthermore, the proposed routing strategy builds around the clustering algorithm, is effective since it reduces the data transmission delay and prolongs the network lifetime.


Author(s) Name:  Nadjet Khoulalene, Louiza Bouallouche-Medjkoune, Djamil Aissani, Adel Mani and Halim Ariouat

Journal name:  Wireless Personal Communications

Conferrence name:  

Publisher name:  Springer

DOI:  10.1007/s11277-018-5902-3

Volume Information:   volume 103, pages 2155–2175 (2018)