routing lists, geometric routing can be considered a lean version of source routing [14]. Our geometric routing algorithm GOAFR+ (pronounced as "gopher-plus") combines--similarly to earlier proposals =-=[4, 6, 15, 20]-=---two concepts called greedy routing and face routing. In greedy routing mode the algorithm forwards the routed message at each network node to the neighbor closest to the destination. Already in simp