Clustering in Wireless Sensor Networks: Performance Comparison of LEACH & LEACH-C Protocols Using NS2

Abstract Every type of network, be it wired or wireless, will be influenced by several key factors for its efficient functioning. Routing issue, applicable to all types of networks, is one among the several such key factors. Wireless Sensor Networks (WSN) has not been exception to this. Moreover, such issues are very critical due to severe resource constraints like efficient energy utilization, lifetime of network, and drastic environmental conditions in WSNs. Neither hop-by-hop or neither direct reach ability is possible in case of WSNs. In this regard, many routing protocols have been proposed to optimize the efficiency of WSNs amidst of above mentioned severe resource constraints. Out of these, clustering algorithms have gained more importance, in increasing the life time of the WSN, because of their approach in cluster head selection and data aggregation. LEACH (distributed) is the first clustering routing protocol which is proven to be better compared to other such algorithms. This paper elaborately compares two important clustering protocols, namely LEACH and LEACH-C (centralized), using NS2 tool for several chosen scenarios, and analysis of simulation results against chosen performance metrics with latency and network lifetime being major among them. The paper will be concluded by mentioning the observations made from analyses of results about these protocols.

[1]  Ravi Prakash,et al.  Max-min d-cluster formation in wireless ad hoc networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[2]  V. Loscri,et al.  A two-levels hierarchy for low-energy adaptive clustering hierarchy (TL-LEACH) , 2005, VTC-2005-Fall. 2005 IEEE 62nd Vehicular Technology Conference, 2005..

[3]  Robert Tappan Morris,et al.  Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks , 2002, Wirel. Networks.

[4]  Adrian Perrig,et al.  ACE: An Emergent Algorithm for Highly Uniform Cluster Formation , 2004, EWSN.

[5]  Sajal K. Das,et al.  WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks , 2002, Cluster Computing.

[6]  Ossama Younis,et al.  HEED: a hybrid, energy-efficient, distributed clustering approach for ad hoc sensor networks , 2004, IEEE Transactions on Mobile Computing.

[7]  M. Luccini,et al.  Algorithms for Node Clustering in Wireless Sensor Networks: A Survey , 2008, 2008 4th International Conference on Information and Automation for Sustainability.

[8]  Wendi Heinzelman,et al.  Energy-efficient communication protocol for wireless microsensor networks , 2000, Proceedings of the 33rd Annual Hawaii International Conference on System Sciences.

[9]  Abraham O. Fapojuwo,et al.  A centralized energy-efficient routing protocol for wireless sensor networks , 2005, IEEE Communications Magazine.

[10]  Wendi B. Heinzelman,et al.  Application-specific protocol architectures for wireless networks , 2000 .

[11]  Wei Zhang,et al.  GROUP: A Grid-Clustering Routing Protocol for Wireless Sensor Networks. , 2006, 2006 International Conference on Wireless Communications, Networking and Mobile Computing.

[12]  Guangyan Huang,et al.  Dynamic Minimal Spanning Tree Routing Protocol for Large Wireless Sensor Networks , 2006, 2006 1ST IEEE Conference on Industrial Electronics and Applications.

[13]  Wang Sheng,et al.  Performance Comparison of LEACH and LEACH-C Protocols by NS2 , 2010, 2010 Ninth International Symposium on Distributed Computing and Applications to Business, Engineering and Science.