Optimal routing methodology to enhance the life time of sensor network

Abstract

Enhancement of the life time of sensor network is an important task. Routing of packet in a network plays a major impact on the energy utilization of nodes in a network. To increase the life time of network and to reduce the energy utilization of node, a new Dijkstra based routing management algorithm is proposed. This paper provides a solution to find the shortest path to route the packet from source to sink. The Dijkstra’s routing management has been chosen for the effective management of the energy efficiency in network. In this method, using the weight factor of the node, the connection cost between the nodes are calculated and it is estimated through the amount of energy spent by the node from the source to sink. In DRM method, the energy efficiency is achieved by finding the shortest route from source node to destination node and the number of hops of a node from source to sink is based on the size of the network. In this paper the new Dijkstra’s routing management algorithm has been discussed and the results are compared, with the existing distance based, Dijkstra’s routing method in the aspect of packet loss and successful packet transmission. When experimented with 50 nodes the results shows that the packet loss in DRM is 3 and successful transmission is 22 and in DDRM the packet loss and transmission is about 7 and successful transmission is 17.The percentage of dead nodes is 32% in DDRM; where 11% in DRM. This shows that the Dijkstra’s routing management algorithm gives more deterministic performance compared to the distance-based routing Management method.