In this paper, we propose and evaluate the simple routing method for reverse k-nearest neighbor queries in spatial networks. This method searches the area by bichromatic reverse k-nearest neighbors search considering the rectangle area including the exact point of each object. We calculate the area that the relationship between a query object and a target object is not changed and search the route to the destination for newly object.