Barrier coverage is one of hot spots in the wireless sensor network. The probabilistic sensing model is closer to the actual situation than 0-1 sensing model. However, there is seldom study about probabilistic barrier coverage. This paper mainly studies virtual radius according to the probabilistic sensing model and the demand of detecting distance. And this paper also proposes the binary probabilistic barrier coverage model in which the neighbor virtual sensing circles are tangent. The CPBMN (construction of probabilistic barrier of minimum node) is also proposed based on this probabilistic barrier model. Firstly, the optimal target locations are determined by the binary probabilistic barrier coverage mode. Secondly, the Hungary algorithm selects the corresponding optimal mobile nodes to shift its target location. Thirdly, the vertical barriers between two horizontal adjacent probabilistic barrier segments are created. The K-probabilistic barriers in the whole area are created by combining these 1-probabilistic barriers in each subarea together. Simulation results show our method can effectively constitute probabilistic barrier coverage. Compared with other methods, it can decrease 70% energy consumption.