In wireless network, nodes are generally battery powered; so due to constrain in energy it is very tough to perform some tasks with this type of node for very long time. Hierarchical-based routing protocol is efficient solution to this problem. LEACH is hierarchical routing protocol that engages randomized rotation of cluster head to equal distribution of energy load between sensor nodes in the network. LEACH also supports data aggregation in which they compress the amount of data and only compressed form will be sent to the base station. Due to data aggregation, amount of data alteration between node and base station is reduced. In this paper, we would like to introduce LEACH protocol in which LEACH selects cluster head node considering energy factor. Due to modification in threshold equation, only the node with highest energy becomes the CH. Devices which are used as nodes are generally battery powered so always have constrain for energy. If energy of the node is fully utilized than life time of that network will always be high. How we have modified LEACH to achieve long life? To address this issue we again slightly change threshold equation for CH selection. Keywords: LEACH protocol, wireless sensor networks, algorithmCite this Article Ravi Sapariya, Tejas Vasavada. Improve Life Time of LEACH Routing Protocol in Wireless Sensor Network. Journal of Network Security. 2015; 3(3): 1–8p.
