In directional sensor networks

the coverage of the target region can be enhanced by adjusting the sensing directions of nodes.A greedy iterative algorithm of coverage enhancing problem in directional sensor network is proposed.In each iteration

the sensing directions of those nodes that can most increase the coverage are adjusted.This iteration process is repeated until the coverage cannot be increased by adjusting the sensing direction of any node.Moreover

a computational geometry method for region calculations in this algorithm is proposed to improve the computational accuracy and reduce the computing time.Extensive simulation results have shown that this algorithm has fast convergence speed and short execution time.And it outperforms existing algorithms with respect to the coverage of the target region.