Sensor deployment is a critical issue since it reflects the cost and detection capability of a wireless sensor network. Coverage is also important in quality of monitoring in wireless sensor networks. Ant colony optimization (ACO) algorithm provides natural and intrinsic way of exploration of search space in multiple knapsack problem (MKP). In this work, we consider the problem of sensor deployment to full the coverage and maximize the lifetime of the network. We will formulate the deployment of sensors for coverage to the multiple knapsack like problem. Based on ACO algorithm, our paper proposed a deployment strategy to prolong the network lifetime, while ensuring a full coverage. The simulations have shown that our algorithm can prolong the lifetime of the network.