Di-GAFR: Directed Greedy Adaptive Face-Based Routing

摘要

In this paper, we present Di-GAFR, a novel WSN geometric routing algorithm containing greedy, face and directed routing. In Di-GAFR, forwarding decisions merely depend on information about a node's immediate neighbors in the network topology, which made the algorithm absolutely local and highly scalable. Additionally, we have proved that Di-GAFR was asymptotically optimal. Simulations demonstrate that Di-GAFR sufficiently outperforms other prominent algorithms, such as GPSR and GOAFR, in the "critical" region.