Comparative Evaluation of LEACH based Routing Algorithms for Different Deployment Densities of WSN
Gurpreet Singh, Surender Singh
Abstract
Gurpreet Singh, Surender Singh
Abstract
Abstract: This paper considered two algorithms namely LEACH and LEACH-C for evaluating their performance for different node densities. Wireless sensor network (WSN) is simulated using a MATLAB programming and power consumption algorithms take into consideration all aspects of power consumption in the operation of the node. Simulating different algorithm schemes on the same network system, same initial power sources, and routing protocol, a different lifetime and power consumption patterns are demonstrated for different node densities. The performance of LEACH-C routing protocol gives better results in lifetime as well as in network disintegration criterion for all type of node densities. However, higher densities with low covering area fair better for both algorithms.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Abstract: This paper considered two algorithms namely LEACH and LEACH-C for evaluating their performance for different node densities. Wireless sensor network (WSN) is simulated using a MATLAB programming and power consumption algorithms take into consideration all aspects of power consumption in the operation of the node. Simulating different algorithm schemes on the same network system, same initial power sources, and routing protocol, a different lifetime and power consumption patterns are demonstrated for different node densities. The performance of LEACH-C routing protocol gives better results in lifetime as well as in network disintegration criterion for all type of node densities. However, higher densities with low covering area fair better for both algorithms.
Key concepts: Computer science, Routing protocol, Computer network, Hierarchical routing, Link-state routing protocol, Distributed computing, Static routing, Dynamic Source Routing