NP completeness proof of sensor selection problem
Your problem is an instance of a geometric cover problem.  Specifically, it appears to be very close to the discrete unit disc cover problem (just scale down all distances by a factor of $d$), which is apparently NP-hard but also admits reasonable approximation algorithms.