Wireless Sensor Network Placement Algorithm

Wireless sensor networks are widely deployed in various fields. One of the key issues in the implementation of such networks is maximizing the area detected and minimizing the number of sensor nodes. In this paper, we propose a systematic framework for how to choose the minimum sensor nodes from those which are originally distributed randomly in a sensor network. Integer linear integer programming model is used to describe the optimal placement. A greedy algorithm is proposed under quite general conditions. Simulation results and theoretical analysis with different grid density show that our proposed framework is computationally feasible and the resultant sensor node placement performs near-optimum.