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
Optimizing Sensor Networks in the Energy-Latency-Density Design Space
IEEE Transactions on Mobile Computing
Integrated coverage and connectivity configuration in wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Simulating Large Wireless Sensor Networks Using Cellular Automata
ANSS '05 Proceedings of the 38th annual Symposium on Simulation
Cellular Automata
Energy-efficient coverage for target detection in wireless sensor networks
Proceedings of the 6th international conference on Information processing in sensor networks
Cellular Automata: A Discrete View of the World (Wiley Series in Discrete Mathematics & Optimization)
Wireless sensor network survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
This paper studies a field coverage problem of wireless sensor networks. The objective is to prolong the network life for active sensing coverage. The problem is modeled using cellular automata. One deterministic algorithm and one probabilistic algorithm are proposed to extend the network life time. Both algorithms allow the activation of a particular sensor be determined by the current state of its immediate neighbors. Simulation examines both algorithms in percentage of coverage, residual energy and active sensors. The simulation results show a significant increase in network lifespan with a reasonable coverage through time. The results also indicate that a cellular automata is suitable for simulating large wireless sensor networks.