EEGRA: Energy Efficient Geographic Routing Algorithms for Wireless Sensor Network

Energy efficiency is critical in wireless sensor networks (WSN) for system reliability and deployment cost. The power consumption of the communication in multi-hop WSN is primarily decided by three factors: routing distance, signal interference, and computation cost of routing. Several routing algorithms designed for energy efficiency or interference avoidance had been proposed. However, they are either too complex to be useful in practices or specialized for certain WSN architectures. In this paper, we propose two energy efficient geographic routing algorithms (EEGRA) for wireless sensor networks, which are based on existing geographic routing algorithms and take all three factors into account. The first algorithm combines the interference into the routing cost function, and uses it in the routing decision. The second algorithm transforms the problem into a constrained optimization problem, and solves it by searching the optimal discretized interference level. We integrate four geographic routing algorithms: GOAFR+, Face Routing, GPSR, and RandHT, to both EEGRA algorithms and compare them with three other routing methods in terms of power consumption and computation cost for the grid and irregular sensor topologies. The results of our experiments show both algorithms conserve sensor's routing energy 30% ~ 50% comparing to general geographic routing algorithms. In addition, the time complexity of EEGRA algorithms is similar to the geographic greedy routing methods, which is much faster than the optimal SINR-based algorithm.