The coverage problem is a fundamental issue in wireless sensor network (WSN). As the sensor nodes of WSN has limited energy, energy saving becomes important in increasing the lifecycle of the network. Constructing a sensor network with a mix of mobile and static sensors can achieve a balance between sensor coverage and sensor cost. In this paper, we design two centralized deployment algorithms of sensors in terms of the coverage problem to achieve the goal of energy-efficient coverage, and thus to enhance the lifecycle of mixed WSN: The Hungarian method-based algorithm (HBA) and the threshold-based algorithm (TBA). The former algorithm can minimize the overall moving distance of mobile sensors. And the latter algorithm is an improvement of the former, which can do better in load-balance. We compared the two algorithms by simulation and discussed which algorithm is better in prolonging the lifecycle of network.