Route Discovery with Constant Memory in Oriented Planar Geometric Networks

摘要: We address the problem of discovering routes in strongly connected planar geometric networks with directed links. consider two types networks: Eulerian (in which every vertex has same number ingoing and outgoing edges) outerplanar a single face contains all vertices network). Motivated by necessity for establishing communication wireless networking based only on geographic proximity, both instances we give algorithms that use information is geographically local to participating route discovery.