GW-GEM: A Reliable Routing Algorithm for Wireless Sensor Networks

There have been many reliable routing algorithms for wired networks. For routing in wireless sensor networks, the reliability aspect has not been paid as much attention. GEM (Graph EMbedding for sensor networks) is an innovative routing algorithm for wireless sensor networks that is based on the idea of graph embedding. However, it cannot survive edge failures well. In this paper, we propose GW-GEM (Greedy-Walk GEM), a GEM-based multi-path routing algorithm that preserves the advantages of GEM and improves its reliability performance significantly. Specifically, in the case where 1% of edges fail in a 900-node simulated network, GEM leads to a path error rate of 9.2% while GW-GEM only results in a path error rate of 1%.