Greedy forwarding combined with planar graph routing exploits minimal local position information to achieve reliable packet delivery in wireless networks. However, it is at the expense of path hop counts and traffic loads converging on links dictated by a chosen planar graph traversal scheme to bypass network holes. To mitigate these negative factors for delay-sensitive traffic service, our forwarding scheme further utilizes a simple hypothesis test based on local information to partition the set of candidate neighborhood nodes for packet relay into two subsets. One is a preferable subset containing nodes more likely located in a dense area of nodes and less likely to be a local minimum for greedy forwarding while the other contains the rest. The preferable subset has priority over the other one in the process of greedy forwarding. Consequently, our geographic routing scheme even embodies the feature of quasi greedy for forwarding packets but does achieve the goal of reducing routing hop counts. It only requires an extra complexity at each node to compute a representative angle that characterizes the node and to interchange with neighborhood nodes the angle information in addition to the location information needed normally.