For the routing hole problem existing in wireless sensor networks when performing geographic forwarding, a
novel segmented greedy routing(SGR) model is proposed. In the proposed solution, the entire routing procedure is separated into several phases by middle target nodes, and only greedy forwarding is applied in each phase. In order to determine proper middle target nodes, a recursive detecting scheme is given. Taking GPSR as basic detecting algorithm, a SGR algorithm is developed. Simulation studies show that SGR algorithm can find near optimal routing path with relatively low cost in various network environment, especially when concave holes exist.