Physical layer driven protocol and algorithm design for energy-efficient wireless sensor networks
Proceedings of the 7th annual international conference on Mobile computing and networking
A coverage-preserving node scheduling scheme for large wireless sensor networks
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
PEAS: A Robust Energy Conserving Protocol for Long-lived Sensor Networks
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Integrated coverage and connectivity configuration for energy conservation in sensor networks
ACM Transactions on Sensor Networks (TOSN)
Deploying a Wireless Sensor Network on an Active Volcano
IEEE Internet Computing
A Coverage-Based Maximum Lifetime Data Gathering Algorithm in Sensor Networks
MDM '06 Proceedings of the 7th International Conference on Mobile Data Management
A survey of energy-efficient scheduling mechanisms in sensor networks
Mobile Networks and Applications
Scheduling sleeping nodes in high density cluster-based sensor networks
Mobile Networks and Applications
Lightweight deployment-aware scheduling for wireless sensor networks
Mobile Networks and Applications
Wireless sensor network survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
ZigBee Wireless Networks and Transceivers
ZigBee Wireless Networks and Transceivers
Distributed wireless sensor network localization via sequential greedy optimization algorithm
IEEE Transactions on Signal Processing
Mobile element assisted cooperative localization for wireless sensor networks with obstacles
IEEE Transactions on Wireless Communications
Wireless multimedia sensor networks: A survey
IEEE Wireless Communications
Optimal Nonlinear Estimation for Localization of Wireless Sensor Networks
IEEE Transactions on Signal Processing
Hi-index | 0.00 |
A virtual square grid-based coverage algorithm (VSGCA) is proposed in this paper. Each sensor node divides its sensing range into virtual square grids, if all the grids are covered by neighbors, the target node is redundant node. Compared with some previous algorithms, VSGCA can guarantee the coverage and connectivity in the whole network and has a computational complexity of O(nxM), which is less than most of other algorithms. Simulation results show that VSGCA can achieve better performance with fewer active nodes and lower computational complexity.