WIRELESS SENSOR NETWORK ALGORITHMS USING THE DISTANCE AND ENERGY OF SENSOR NODE
Wireless sensor network (WSN) consists of a large number of tiny sensor nodes which are usually deployed in a hard environment. Self-configuration and infrastructure are the two fundamental properties of sensor networks. Sensor nodes are high energy constrained devices because they are battery operated devices and due to harsh environment deployment it is impossible to change or recharge their battery. Energy conservation and prolonging the network life are two major challenges in a sensor network. Communication consumes the large portion of WSN energy. Several protocols have been proposed to realize power-efficient communication in a wireless sensor network. Cluster based routing protocols are best known for increasing energy efficiency, stability and network lifetime of WSNs. Low energy adaptive clustering hierarchy (LEACH) is an important protocol in this class. One of the disadvantages of LEACH is that it does not consider the nodes energy and distance for the election of a cluster head. This paper proposes a new energy efficient clustering protocol DE-LEACH for homogeneous wireless sensor network which is an extension of LEACH. DE-LEACH elects cluster heads on the basis of distance and residual energy of the nodes. Proposed protocol increases the network life, stability and throughput of sensor network and simulations result shows that DE-LEACH is better than LEACH.
cluster, energy efficiency, initial energy, residual energy, wireless sensor network.