Among overlay networks, those that form a certain data structure to realize efficient routing are called structured overlay. One type of range-searchable structured overlay is Skip Graph. However, the Skip Graph routing does not always result in the shortest path, and Detouring Skip Graph, a method that uses detouring paths, has been proposed to achieve more efficient routing. In this paper, based on the Detouring Skip Graph algorithm, we propose an algorithm that selects detouring routes based on node density to improve the routing efficiency by adjusting parameters such as thresholds. The results show that the proposed method is slightly more efficient than Detouring Skip Graph.