Go Heuristics for Coverage of Dense Wireless Sensor Networks

2012/06/22 by M. A. El-Dosuky, M. Z. Rashad, El-Dosuky, M. A. +7
Computer Science · #Energy Efficient Wireless Sensor Networks #FOS: Computer and information sciences #Mobile Ad Hoc Networks #Networking and Internet Architecture (cs.NI) #Opportunistic and Delay-Tolerant Networks #cs.NI

paper · pdf · doi:10.48550/arxiv.1206.5313

arxiv created 2012/06/22 · openalex publication_date 2012/06/22 · arxiv updated 2012/06/26 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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

Citations

• Exposure in wireless Ad-Hoc sensor networks
• The capacity of wireless networks

Related

• Coverage Related Issues in Networks
• OPTICS Based Coverage in Wireless Sensor Network
• Optimal Covering with Mobile Sensors in an Unbounded Region
• The Tradeoff Between Coverage and Computation in Wireless Networks
• Distributed Construction of the Critical Geometric Graph in Dense Wireless Sensor Networks