Go Heuristics for Coverage of Dense Wireless Sensor Networks
M. A. El-Dosuky, M. Z. Rashad, T. T. Hamza, and A.H. EL-Bassiouny

TL;DR
This paper introduces a novel algorithm inspired by Go game heuristics to optimize coverage in dense wireless sensor networks, demonstrating promising results as an effective optimization approach.
Contribution
It applies Go game heuristics to wireless sensor network coverage, presenting a new algorithm validated through experiments.
Findings
The Go heuristic-based algorithm improves coverage efficiency.
The approach is promising for dense sensor network optimization.
Validation shows significant coverage enhancement.
Abstract
This paper collects heuristics of Go Game and employs them to achieve coverage of dense wireless sensor networks. In this paper, we propose an algorithm based on Go heuristics and validate it. Investigations show that it is very promising and could be seen as a good optimization. Keywords: Go Heuristics, Wireless Sensor Networks, Coverage, Density
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMobile Ad Hoc Networks · Energy Efficient Wireless Sensor Networks · Opportunistic and Delay-Tolerant Networks
