Next century challenges: scalable coordination in sensor networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Wireless sensor networks for habitat monitoring
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Grid Coverage for Surveillance and Target Location in Distributed Sensor Networks
IEEE Transactions on Computers
Coding Theory Framework for Target Location in Distributed Sensor Networks
ITCC '01 Proceedings of the International Conference on Information Technology: Coding and Computing
An analysis of a large scale habitat monitoring application
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Deploying wireless sensors to achieve both coverage and connectivity
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Approximation Algorithms for Sensor Deployment
IEEE Transactions on Computers
Energy Efficient Target-Oriented Scheduling in Directional Sensor Networks
IEEE Transactions on Computers
tk-coverage: Time-Based K-Coverage for Energy Efficient Monitoring
ICPADS '09 Proceedings of the 2009 15th International Conference on Parallel and Distributed Systems
On deploying wireless sensors to achieve both coverage and connectivity
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Constructing low-connectivity and full-coverage three dimensional sensor networks
IEEE Journal on Selected Areas in Communications - Special issue on simple wireless sensor networking solutions
A Reliable Energy Efficient Algorithm for Target Coverage in Wireless Sensor Networks
ICDCSW '10 Proceedings of the 2010 IEEE 30th International Conference on Distributed Computing Systems Workshops
IEEE Communications Magazine
Hi-index | 0.00 |
The paper proposes a deterministic node deployment method based on grid scan to achieve targets coverage and nodes connectivity. Target area is divided into girds from which the most suitable one is selected to place the next node. In the coverage phase, the grid where the sensor node can sense the most targets and have the best coverage level is selected to place the next sensor node. To make the sensor nodes connected, first, the sensor nodes are divided into connected groups, then, the grid where the relay node can connect the most groups and have the best connectivity level is selected to place the next relay node. Simulation experimental results show that the method can achieve target coverage with the least sensor nodes and sensor node connectivity to a great extent.