Sensor deployment, which often dictates the overall network performance, is a fundamental issue in Wireless Sensor Networks. In this paper, we address the problem of deterministic wireless sensor networks deployment. Our research aims to generate the best network topology that ensures the required degree of coverage with the minimum number of sensors. The problem in hand is NP-complete. To overcome the great complexity involved, we propose an efficient deterministic greedy heuristic named Max-Cov-Tp that is able to determine the minimum number of sensors and their locations to achieve the overall coverage of the region of interest.