Skip to Main Content
This paper introduces BGR, a new beacon-less geographic routing algorithm for wireless sensor networks. Data packets are forwarded toward the destination, and nodes, which hear the packet compete for becoming the next hop. A recovery strategy is provided for the case of empty forwarding areas. The main innovation is a strategy to avoid simultaneous forwarding situations, which would otherwise cause packet failures. It is confirmed by simulation that BGR sends very few packets and is reliable infields with sufficiently high node density. Furthermore, BGR is compared with similar algorithms after developing a general framework for beacon-less algorithms with an integrative terminology. Different kinds of forwarding areas are compared.