Abstract: An ［r,R］dominating set is a distance rdominating set which can be connected by adding paths with length within R. In this paper, it was restricted in random regular graphs and several algorithms were designed to approximate the minimum ［r,R］dominating set. After analyzing its average performance by using differential equations, an upper bound was achieved as well.