Wall Pass Algorithm in a Geographic Location-Based Distributed Routing System

Abstract

In this paper, we propose Wall Pass Algorithm (WPA). WPA presents a function to forward the messages to a neighboring area. We evaluate the performance of a geographic location-based distributed routing (GDR) system when the mobile terminals are moving. The results show that GDR and CAN have the same mean and the variance of the path length and the relay length when storing data, while the mean and the variance of the path length and the relay length of GDR are smaller than those of Chord and Kademlia. On the other hand, when sending query, GDR, Chord and Kademlia have the same mean and the variance of the path length, while the mean and the variance of the relay length of GDR are smaller than those of Chord and Kademlia. Furthermore, while GDR and CAN have the same mean and the variance of the relay length, the mean and the variance of the path length of GDR are smaller than those of CAN. In addition, WPA can decrease the communication overhead of the system.