Traditional coverage algorithms for directional sensor network only consider coverage

but can’t guarantee the connectivity.In view of this deficiency

a connective target-coverage algorithm（CTA） is proposed by using the maximum multi-overlapping domains of neighbor target points and the integer linear programming（ILP） formulation.Candidate position sets are calculated using the concept of covering maximum targets within deployment-circle

then the ILP formulation is used to find the optimal positions of these nodes from the candidate position sets on the basis of meeting users’ demand and connectivity.Simulation results show that CTA can greatly reduce network deployment costs and ensure network’s connectivity on the premise that coverage is guaranteed.