Performace and energy efficient Greedy forwarding method for sensor networks

The area of study and work presented in this paper is on a method of routing in sensor networks that is a part of Geographic Routing protocol known as Greedy Forwarding. This is an much more efficient version of methods that are applicable in GR. This works on the principle of progressing in the process of forwarding by selecting a peer that is nearer to the final node where the packets are destined. But with the benefits of reducing the total distance between two end points this method incurs limitations regarding collection of proper network topology information thus creating voids while sending packets. To avoid this an improvised version of previous works is presented over here that highlights mainly of increasing performance as well as energy efficiency of GF method in GR. A more enhanced method that will collect more accurate topological information and support the forwarding process with energy saving to increase networks lifetime is presented. Here the discussion about the work done by previous methods will be shown along with we introduce to you a newer version. The basic aim is to consider maximum energy paths and nodes with maximum energy remains.