Energy efficient algorithm for routing problem in Wireless Sensor Networks

Wireless Sensor Network (WSN) is a collection of sensor nodes. A sensor node covers all information which is present in its sensing range. To access the information present in some other sensor range, the networks use a process called Routing. Routing problem in wireless sensor network (WSN) concerned with maximizing the sensor network lifetime while continuously routing the collected data (information) to the base station (central server). A route (sometimes called as Path) is a set of sensors that establish a connection between a source node and a sink node (base station). The routing problem is used to determine a set of different routes with maximum aggregated lifetime while constraining the life of each sensor by its initial battery life. In WSN, we demand an energy-efficient path which is used to send collected information to the center base station. At the base station, the received data are processed further. In this paper, we try to design maximum number of energy- efficient routes in such a way that every path is a set of selected sensors (instead of all sensors). In this paper, we also give detailed analysis of earlier techniques and propose a new energy-efficient algorithm for designing these paths to maximize the total lifetime of the sensor network. The simulation section gives a clear proof of effectiveness of proposed algorithm when compared with some existing approaches.