This paper proposes a method for reducing redundant greedy-perimeter transitions in beacon-less geographic routing for wireless sensor networks (WSNs). Our method can be added to existing routing methods. Using a bloom filter, each node can detect a routing loop, and then the node stores the information as “failure history”. In the next forwarding the node can avoid such bad neighbors based on the failure history. Simulation results demonstrate the benefit of our method.
