To handle routing void of greedy geographical routing in wireless sensor networks,an efficiency adaptive void-handle algorithm is proposed,which is based on route signs that are distributed extracted and eliminated iteratively.

The scheme assigns a coordinate to each node of the network so that the nodes are embedded into a metric space induced by a small size of spanning trees of the network graph,and thus according to the coordinate space a greedy routing algorithm can be used for every pair of nodes.