Autonomous and distributed construction of locality aware skip graph

Abstract

An increasing number and variety of devices are connected to the Internet. Thus, it is expected that peer-to-peer (P2P) networks, which have no central servers, will solve the server overload issue in the client-server communication model. Among P2P information search schemes, we focus on Skip Graphs, because they exhibit strong churn resilience and have a range search function, which is desirable for advanced networks such as smart meter networks, smart agriculture, smart cities, vehicular ad hoc networks, and online social networks. However, the overlay of a Skip Graph is constructed regardless of the nodes' locations. As a result, the end-to-end delay between communication nodes becomes much longer than the potential minimum. In a conventional method, this problem is solved by using special landmark nodes. However, this approach sacrifices some advantages of Skip Graphs as a P2P system. Thus, we propose a Skip Graph construction method that does not use any special nodes. The simulation results show that the proposed method provides about 35% improvement in transmission distance without additional query hops.