Editing Monitoring in Wireless Sensor Networks

Title: Monitoring in Wireless Sensor Networks

Research Question: How can we design an efficient and distributed algorithm to partition sensors in a wireless sensor network (WSN) into k covers such that as many areas are monitored as frequently as possible?

Methodology: The researchers proposed three algorithms to solve the SET K-COVER problem: randomized, distributed greedy, and centralized greedy. The randomized algorithm assigns each sensor to a cover chosen uniformly at random. The distributed greedy algorithm allows each sensor to assign itself to the cover with the minimum intersection between the areas it monitors and the areas monitored by the cover thus far. The centralized greedy algorithm is similar to the distributed greedy, but an area in the intersection is weighted based on how likely it is to be covered by some other sensor later on.

Results: The researchers found that the deterministic algorithms perform well with respect to the best approximation algorithm possible. Simulations indicated that the deterministic algorithms perform far above their worst-case bounds, consistently covering more than 72% of what is covered by an optimal solution. The randomized algorithm, in particular, seems quite practical.

Implications: These algorithms can significantly increase the longevity of sensor networks by activating groups of sensors in rounds, allowing sensors to conserve battery power and extend their lifetime. The algorithms are fast, easy to use, and, according to simulations, provide substantial improvements in network coverage. This research has important implications for the design and management of wireless sensor networks, particularly in areas such as environment monitoring and healthcare.

Link to Article: https://arxiv.org/abs/0311030v1
Authors: 
arXiv ID: 0311030v1

[[Category:Computer Science]]
[[Category:Sensor]]
[[Category:Algorithm]]
[[Category:Algorithms]]
[[Category:Greedy]]
[[Category:Distributed]]