National Conference on Recent Trends in Computer & IT (RTCIT-09) Samalkha, Haryana, 24 th -25 th April2009 A New Innovative Approach for Energy Conservation in Wireless Sensor Networks Vinod Kumar*,Rohit Vaid**, Neeraj Mangla*** M.M.University, Mullana -133203(Haryana),India er_vinod15@yahoo.co.in, rohit_vaid1@rediffmail.com,erneerajynr@gmail.com ( +91-9466017416,+91-9416224521,+91-9416191176 ) Abstract: Wireless sensor networks are a new type of networked systems. They have constrained computational and energy resources and an ad hoc environment for their working. This paper presents an improvement on the energy consumption in wireless sensor networks by increasing the network’s localization, clustering and power conservation abilities. Furthermore, using a novel and creative schemes to generate shortest paths for information routing from source to destination nodes and using a more efficient algorithm will improve the overall effectiveness of the entire network in terms of power efficiency. In this paper we have implemented an approach to limit the power consumption used by sensor networks for information transfer. Keywords: Clustering, sleep and idle mode, shortest path, WSN. Introduction: The purpose of this research is to design a shortest path routing algorithm for use with the wireless sensor networks. The objective of the shortest path routing algortihm is find the shortest path from one node to the next based on the information packet’s beginning and final locations. The nodes of this network will have a single path that they will direct information down based on the destination address. This single path is designed to be the packet’s shortest path, which is why it would be most beneficial to travel on that route. One problem that must be avoided is that of ”‘free-looping.”’ Further clustering techniques are applied to save the energy of the sensor nodes and nodes are put into four different modes i.e. idle, sleep ,receive and transmit mode to save the energy of the sensor nodes. 1.A. Shortest Path Routing Designing an algorithm to implement shortest path routing between nodes for information transfer is a very complex matter. The goal of this algorithm is to efficiently find a path from one node to another using the least amount of ”hops” possible in a Multi-hop Wireless Network. There are many things to take into consideration before a shortest path routing algorithm can function. Power conservation and memory management create complexities that make devising an efficient route selection algorithm rather difficult. However, the research presented implements a possible solution. PDF Created with deskPDF PDF Writer - Trial :: http://www.docudesk.com