Abstract
The border coverage of forest fire in a three dimensional space is rigorously analyzed and the minimum number of the sensor nodes of WSN and their placement for complete coverage is determined. Also, given a random distribution of the sensor nodes, the approach of selecting a minimum subset of the sensor nodes for complete coverage in the forest fire monitoring system is addressed. A computationally efficient algorithm is developed and implemented in a distributed fashion. It is shown that the optimized WSN continues to offer better coverage of forest fire border coverage even when the sensor nodes start to fail over time, and the optimized WSN has better energy efficiency compared to the standard random deployment of sensor nodes in the forest fire monitoring system.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
