Download now Free registration required
This paper study the problem of landmark selection for landmark-based routing in a network of fixed wireless communication nodes. It present a distributed landmark selection algorithm that does not rely on global clock synchronization, and a companion local greedy landmark-based routing scheme. The paper assumes no node location information, and that each node can communicate with some of its geographic neighbors. Each node is named by its hop count distances to a small number of nearby landmarks. Greedy routing at a node is performed to equalize its vector of landmark distances to that of the destination. This is done by following the shortest path to the landmark that maximizes the ratio of its distances to the source and the destination.
- Format: PDF
- Size: 403 KB