We explore the asymptotic performance of existing geographic routing with a utilization of k-hop neighborhood information. The reachability from source to sink improves as we use more information for routing decision and the average number of hops required decreases significantly from 1-hop to 2-hop searching, which indicates a potential tradeoff between performance enhancement and system complexity. As simple greedy geographic routing is insufficient in lossy wireless environment, we propose a new metric incorporating both advance in distance and link quality. Through simulations, we show its effectiveness over the conventional simple greedy method. The generalization to k-hop based routing and resulting performance are also presented. Simulation results show that with the multi-hop based searching, there is a good improvement in the number of transmissions required from source to sink, which also indicates potential improvement in routing delay and energy consumption in transmissions.