訊號覆蓋是一個很重要的議題，從網際網路的普及到近年來物聯網的蓬勃發展，在任何一處都能收到訊號成了很重要的使用者體驗，全區覆蓋的技術需求就會大大提升，常見的演算法有基因演算法(Genetic Algorithm，GA)、禁忌搜尋演算法(Tabu Search，TS)、爬山演算法(Hill Climbing，HC)、模擬退火法(SimulatedAnnealing，SA)，然而這些演算法直接用於複雜環境中，會有著計算過久的問題或只能得到局部最佳解，我們不追求最佳解，轉而考慮的面相有時間、佈建數量、合理性，所以會更偏向簡易且快速的演算法。
本論文製作的系統藉由設備的訊號強度(Received Signal Strength Indicator，RSSI) 有效距離，提出了在任何複雜且三維空間的環境下，都能順利模擬出全區覆蓋的建置演算法，演算法的部分包含基本建置演算法與補點演算法，用快速的演算法建置大部分的區域，再利用隨機灑點的方式找到適合的補點位置，以快速及合理的方式完成自動部屬，自動建置設備的位置也盡量避免太過於接近讓佈建結果感覺不合理。

The Internet of Things became popular in recent years. Signal cover became a big
issue. It is important for the user to receive the signal in any place. Greatly improved, common algorithms include Genetic Algorithm (GA), Tabu Search (TS), Hill Climbing (HC), and Simulated Annealing (SA). These algorithms are directly used in complex environments. There will be problems like calculating too long or can only get local best solutions. We are not deal with the best solution. We are going to consider the time, the number of constructions, and the rationality for some simple algorithms.
This study presents an algorithm that can simulating the coverage of the whole region in any complex three-dimensional environment by the effective distance of the Received Signal Strength Indicator (RSSI) of the device. The algorithm includes the basic construction algorithm and the complementary point algorithm. The fast algorithm is used to build most of the area and the random point is used to find the suitable compensation point position. To complete the automatic subordinate in a quick and reasonable way and make sure
the position are not too close to make error.

[1] Gartner, Inc., ”Gartner Says 8.4 Billion Connected ”Things” Will Be in Use in 2017, Up 31 Percent From 2016” February 2017.
[2] Wang, C. S., Kao, L. F. (2012, August). The optimal deployment of wi-fi wireless access points using the genetic algorithm. In Genetic and Evolutionary Computing (ICGEC), 2012 Sixth International Conference on (pp. 542-545). IEEE.
[3] Leu, F. Y., Liu, P. S. (2010, September). A channel assignment and AP deployment scheme for concentric-hexagon based multi-channel wireless networks. In Network-Based Information Systems (NBiS), 2010 13th International Conference on (pp. 504-509). IEEE.
[4] Kar, K., Banerjee, S. (2003, March). Node placement for connected coverage in sensor networks. In WiOpt’03: Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (pp. 2-pages).
[5] Eisenblatter, A., Geerdes, H. F., Siomina, I. (2007, June). Integrated access point placement and channel assignment for wireless LANs in an indoor office environment. In World of Wireless, Mobile and Multimedia Networks, 2007. WoWMoM 2007. IEEE International Symposium on a (pp. 1-10). IEEE.
[6] Farkas, Károly and Huszák, Árpád and Gódor, Győző (2013) Optimization of Wi-Fi Access Point Placement for Indoor Localization. Journal IIT (Informatics IT Today), 1 (1). pp. 28-33. ISSN 1339–147X38
[7] Puspitasari, N. F., Al Fatta, H., Wibowo, F. W. (2016). Layout Optimization of Wireless Access Point Placement using Greedy and Simulated Annealing Algorithms. network, 2, 3.
[8] Kirkpatrick, S., Gelatt, C. D., Vecchi, M. P. (1983). Optimization by simulated annealing. science, 220(4598), 671-680.
[9] Bahl, P., Padmanabhan, V. N. (2000). RADAR: An in-building RF-based user location and tracking system. In INFOCOM 2000. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE (Vol. 2, pp. 775-784). Ieee.