Path Vector Face Routing: Geographic Routing With Local Face Information

Existing geographic routing algorithms depend on the planarization of the network connectivity graph for correctness, and the planarization process gives rise to a well-defined notion of "Faces". In this paper, the authors demonstrate that they can improve routing performance by storing a small amount of local face information at each node. They present a protocol, Path Vector EXchange Protocol (PVEX), that maintains local face information at each node efficiently, and a new geographic routing algorithm, Greedy Path Vector Face Routing (GPVFR), that achieves better routing performance in terms of both path stretch and hop stretch than existing geographic routing algorithms by exploiting available local face information.

Provided by: MIT Computer Science and Artificial Intelligence Laboratory Topic: Mobility Date Added: Jan 2013 Format: PDF

Find By Topic