Greedy Routing for Maximum Lifetime in Wireless Sensor Networks

In this paper, we present GRMax for WSN (Greedy Routing for Maximum Lifetime in Wireless Sensor Networks) whose goal is to manage the restricted energy so that the Wireless Sensor Network (WSN) stay connected for the maximum time possible. We evaluate the performance of GRMax for WSN by replacing the greedy routing of Greedy Perimeter Stateless Routing (GPSR) protocol with GRMax. Evaluation and comparison of GPSR and GRMax for WSN is done through NS2. Results show that GRMax for WSN performs better than GPSR with respect to packet delivery fraction, number of dropped packet and network lifetime. With the introduction of VIP nodes we avoid early network partition whatever random the traffic is. And with our new metric, we make sure that battery power resources are used efficiently since we suppose that every node can fix his transmission range depending on the distance to the selected next hop. As metric we use the cosine of the deviation angle. We can use our resources efficiently because with our metric, from the source to the destination we use a path close to the straight line.