In the point coverage problem, the subject to be covered is a set of discrete space points. These points can be some particular space points to represent the sensor field (e.g., the vertices of a grid) or are used to model some physical targets in the sensor field (e.g., the missile launchers in a battlefield). In order to cover these points, sensor nodes can be deterministically placed or randomly deployed in the sensor field. In a random network deployment, it is possible that some nodes cannot cover even a single target point. On the other hand, if the sensor field is friendly reachable and the network size is not too large, deterministic node placement is to place the nodes only at the desired locations so that each sensor node can cover at least one target. The objective of a deterministic node placement can be summarized as to answer the following question: