Huffman coding

Energy efficient algorithm in wireless networks

Abstract

In the proposed Huffman LEACH model, energy consumption increases exponentially with distance and there are no maximum limits. The transmit power level of a sensor node can only be adjusted to discrete values that may result in one transmit power level for various distances. The resulting energy consumption for two links of different distances can be equivalent. The number of clusters generated in LEACH does not converge to a fixed value which shortens the lifespan of the network. The energy consumption of the wireless sensor network is inversely proportional to the lifetime of the wireless sensor network. Here, we assume that the network lifetime is defined as the time from the deployment of the WSN till the first gateway dies. Hence, network lifetime can be maximized by using the parameter discussed in this paper. If we can minimize the energy consumption of the CH nodes, then energy consumption of the sensor nodes can be minimized if we can minimize their relative distance from their corresponding CH’s. The experimental result of proposed model says better with its energy faster than the nodes with lower data transmission rate when compared with the existing WSN models.