CGF-LQ: An optimal Combined Greedy-Face routing based on local link quality

We propose an optimal Combined Greedy-Face routing based on local link quality (CGF-LQ) in ad hoc wireless networks. Since it is expensive for wireless nodes to get the whole network topology information, geometric routing decisions should be made locally by nodes using location information of neighboring nodes. In this paper, we figure out the problem of Combined Greedy-Face (CGF) routing, then estimate the affection of distance between the relaying node and the sink node to the link quality according to radio propagation models. Basing on the findings, we propose a novel routing decision metric. Through experiment in the NS-2 simulator, we show advantages of the proposed routing algorithm over prior algorithms in several routing properties, including packet delivery ratio as well as hop count and routing overhead.