A Heuristic Algorithm for the Weighted-Critical-Square-Grid Coverage Problem in Wireless Sensor Networks
碩士 === 國立雲林科技大學 === 電機工程系 === 107 === In wireless sensor networks, the goal of the critical-square-grid coverage problem is to cover all the critical square grids with a minimum number of sensors. The goal of the weighted-critical-square-grid coverage problem is to cover some weighted critical squar...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2018
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/v3t2y9 |