This paper focuses on the energy efficient construction of a k-barrier coverage in mobile sensor networks. First, this paper formulates 1-BCMS (1-barrier coverage min-sum of moving distance) problem for constructing 1-barrier coverage energy efficiently, reduces the 1-BCMS problem to 1-GBMS (1-grid barrier min-sum of moving distance) problem based on grid model, and present the reduced problem’s Linear Programming Model and prove it to be NP-hard. Secondly, this paper presents a CBGB (constructing baseline grid barrier) algorithm to construct 1-barrier coverage energy efficiently. CBGB is an approximation algorithm for 1-GBMS problem and the solution of CBGB is close to the optimal solution. Finally, a Divide-and-Conquer algorithm is proposed to construct k-barrier coverage. This algorithm significantly reduces communication overhead and computation cost compared to other algorithms. Simulation demonstrates the effectiveness of the proposed algorithm in constructing k-barrier coverage.