Single Hop Sensor Deployment Algorithm

Most important issues of sensor deployment within a given terrain are - complete sensing coverage within the terrain, a low cost deployment algorithm, no deployment within obstacles and minimizing the number of sensors to be deployed. A good routing algorithm required for fast commutations and less traffic between the sensor-nodes, for efficient tracking of objects within the terrain and finally low cost sensor with lowest possible memory requirement and better energy management. The proposed Single Hop Sensor Deployment Algorithm or SHSD Algorithm in short, considers an irregular terrain with obstacles for deployment. In the proposed algorithm two types of sensor nodes are considered, client sensor-nodes which are homogeneous in type with same sensing and communication coverage and server-nodes which are heterogeneous in type with greater communication coverage than sensing coverage. Each server with four clients forms a WSN, where any sensing of object by any of the four client nodes will be communicated to the server-node. Each server-node can communicate directly with its neighboring server-nodes. A moving object tracked by a WSN, can be reported to its neighbor WSNs without involving the client nodes, which definitely decrease traffic and increase the speed of communication. The gain in deployment algorithm is, instead finding the location of individual nodes for deployment; locations need to be searched for WSNs (for 5-sensors together).