One of the most fundamental problems in wireless sensor networks is the coverage control problem, which reflects how well a region is apperceived. The coverage control theories and algorithms can result in not only network resources’ optimial allocation but also efficient sensing and collecting of the environmental information, and communicating with neighboring nodes by wireless sensor networks. In this paper, the coverage control problem is captured. Some recent novel theories and algorithms for wireless sensor networks coverage control problems are reviewed, and the taxonomy is described. More specifically, several typical algorithms and protocols are discussed in detail. In the end, advantages and disadvantages of the algorithms are summarized. The open research issues in this field are also pointed out.