Monitoring in Wireless Sensor Networks: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

24 December 2023

  • curprev 14:5414:54, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 1,962 bytes +1,962‎ Created page with "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 uniforml..."
Retrieved from "https://simplesci.org/wiki/Monitoring_in_Wireless_Sensor_Networks"