臺灣博碩士論文加值系統

　　在現今的社會，於我們周圍幾乎是大廈林立的環境，而處於這樣的建築之內，一旦發生火災之緊急事件，容易使逃生更加的困難，因而造成無法挽回的損失及傷害。根據內政部消防署的統計資料得知去年(民國105年)為近五年來火災發生次數最高的一年，且以建築物火災次數最高，所以對於建築物之逃生疏散為一重要的課題。
　　現今無線感測網路廣泛應用於許多方面，例如生態環境的監測、森林火災防護、健康醫療、居家照護等。
　　本論文即以無線感測網路為基礎來做逃生緊急引導之路徑規劃，考量了節點之容納人數限制、緊急事件發生時有人所在之節點及其人數狀況、走道之容納人數限制以及經過走道所需花費時間等因素，並以線性規劃(Linear Programming，LP)來建立模型，求出疏散所需最長之時間，將其最小化，且以負載平衡為目標。對於碰到人數超出最理想之規劃路線的區域容量的情況，本論文提出一啟發式演算法來進行調整，盡量維持原規劃之最佳逃生路徑，將調整的路徑變化降至最低。

　　Nowadays, we are always in the environment with high buildings. In such buildings, it will be more difficult to get out from the buildings in case of emergency, and bring about severe loss and damage. According to the statistical information of fire disease by National Fire Agency, the last year(2016) was the highest number of fire disease in the last 5 years, and the architectural fire disease was the most frequent of all the type of fire disease. Therefore, the evacuation of fire disease for buildings is the significant issue today.
　　Nowadays, wireless sensor network is widely used, such as ecological environment monitoring, forest fire protection, health care, home care and so on.
　　In this paper, we propose a scheme for distributed emergency guiding based on wireless sensor networks. We take account of the capacity of regions, the region that the people at and how many people there when emergency occurs, the capacity of corridors, and the travel time of corridors. We model it by linear programming to find out the time that the longest path to the exit, and our goal is minimizing it, and achieving the target of load-balancing. We propose a heuristic algorithm to resolve the problem of congestion, when the number of people over the capacity of regions.

1.　緒論 1
1.1.　研究背景 1
1.2.　研究動機 7
1.3.　研究目的 7
2.　文獻探討 9
2.1.　無線感測網路簡介 9
2.2.　無線網路種類規格比較 12
2.3.　無線感測網路之路由簡介 15
2.4.　線性規劃 16
2.5.　模擬退火演算法 17
3.　研究方法 21
3.1.　研究架構 22
3.2.　研究作法 22
3.2.1.　環境假設 22
3.2.2.　方法－線性規劃 23
3.2.3.　方法－模擬退火演算法 25
3.2.4.　拓樸模擬 30
4.　研究結果與分析 31
4.1　疏散時擁擠度比較 32
4.2　各時間點已逃生之人數比較 39
5.　結論 46
參考文獻 47

[1] 室崎益輝(1993)。 建築防災・安全。日本東京: 鹿島出版會，40-44
[2] 丁育群(1987)。高層建築防火設施規劃設計之研究。中國文化大學實業計劃研究所博士論文
[3]王博仁(2009)。災難區域人群疏散路徑之動態導引。朝陽科技大學資訊工程系碩士論文
[4] 內政部消防署(2017)。全國火災次數起火原因及火災損失統計表(1060420更新)。
[5] 內政部消防署(2017)。105年火災統計分析。
http://www.nfa.gov.tw/Uploads/1/0307_105%E5%B9%B4%E5%85%A8%E5%9C%8B%E7%81%AB%E7%81%BD%E7%B5%B1%E8%A8%88%E5%88%86%E6%9E%90_po%E4%B8%8A%E7%BD%B2%E7%B6%B2.pdf
[6] 內政部消防署(2016)。火災統計。
[7] 科技大觀園。無線感測網路技術：無線感測器網路平台及應用
https://scitechvista.nat.gov.tw/zh-tw/articles/c/0/2/10/1/1380.htm
[8] 科技台灣。12-24 ZigBee無線傳輸
http://www.hightech.tw/index.php/2012-06-06-14-12-38/27-wireless-communication/370-zigbee
[9] E.W. Dijkstra(1959).A note on two problems in connexion with graphs.Numerische Math,vol 1,no 1, 269-271
[10] C. E. Perkins, and P. Bhagwat(1994).Highly dynamic destination-sequenced Distance-Vector routing(DSDV) for mobile computers.in Proc. Conf. Commun. Archit.Protocols Appl.(SIGCOMM), 234-244
[11] C. E. Perkins, and E. M. Royer(Feb,1999).Ad-hoc on-demand distance vector routing. in Proc. 2nd IEEE Workshop Mobile Computing Syst. Appl(WMCSA), 99-100
[12] T. He, F. Ren, C. Lin, and S. Das(Jun, 2008).Alleviating congestion using traffic-aware dynamic routing in wireless sensor networks. in Proc. 5th Annu. IEEE Commun. Soc.Conf. Sensor.Mesh Ad Hoc Commun. Netw.(SECON), 233-241
[13] Q. Cao,T. Abdelzaher, T. He, and R. Kravets(May, 2007).Cluster-based forwarding for reliable end-to-end delivery in wireless sensor networks. in Proc. 26th IEEE Int. Conf. Comput. Commun.(INFOCOM), 1928-1936