大型災害頻傳傷亡慘重，若能把握於救災黃金72小時內救出受困民眾，則可望挽回更多寶貴的生命，但災區通訊網路基礎設施常因災害而遭受嚴重損毀，無法正常運作。救災工作在缺乏通訊系統的支援下，因溝通協調的困難而紊亂無章、效率低落。 本研究提出一個可快速恢復特定區域通訊服務的網路，並為其設計通訊的拓撲結構。我們稱該網路為應急蜂巢式行動通訊網路(Contingency Cellular Network)，簡稱CCN網路。CCN網路利用無線電連接災區行動電話網路中斷訊但結構未損的基地台建構而成，具有建置速度快、使用門檻低等多項特點，可支援災區救援的緊急通訊。 本研究中，我們以各毀損基地台通訊範圍內的通訊需求人數與災區毀損程度，作為效益參數，嘗詴在蜂巢式網路的格網架構以及數量有限的緊急通訊設備下，選擇效益較高的位置點配置緊急通訊設備，建立應急蜂巢式行動網路的網路拓撲，此拓撲除追求最大救災效益外，並顧及通訊品質，避免建立負載失衡的連線。我們將問題塑模為一類似圖論中的K-Minimum Cost Spanning Tree (K-Cardinality Tree or KCT)問題，稱為Depth Bounded K-Maximum Profit Spanning Tree問題，並提供數個快速的啟發式演算法，可在緊急時快速地建立應急蜂巢式行動網路拓撲。 / When a catastrophic natural disaster occurs, the efficiency of disaster response operation is critical to life saving. However, communication systems, such as cellular networks, usually crashed due to various causes that make coordination difficult for many disorganized disaster response workers extremely. Unfortunately, rapid deployment of many existing emergency communication systems relies on a good transportation system, which is usually not available in a catastrophic natural disaster. We propose a Contingency Cellular Network (CCN) by connecting disconnected base stations together with wireless links and portable power generators. CCN can support existing mobile phone users with limited capability. Such a system can support a large number of voluntary workers in the early hours of a catastrophic natural disaster, thus saving many lives. Communication traffics, either voice or data, are forwarded hop-by-hop to the external network that remains operational. The efficiency and effeteness of CCN is obviously depends on the topology of such a forwarding network. This thesis addresses the design of forwarding topology aiming to maximize its efficiency. We take the degree of emergency degree of the damage, population of each stricken as the priority measure as well as the amount of emergency recovery resources as the constraint to determine the topology. We model the CCN topology design problem into a Depth Bounded K-Maximum Spanning Tree Problem. The problem is proven NP-hard and we designed an efficient heuristic algorithm (DBTB) to solve it. We also model CCN topology design problem into a Hop Concerned K-Maximum Spanning iii Tree Program and designed a HCTB algorithm to solve it. The simulation results show that DBTB algorithm can control tree depth effectively but HCTB can gain more profit.

當發生大規模的地震或強烈的颱風等重大天然災害時，通訊系統常常隨著電力與交通系統的損毀而癱瘓。由歷年大型災變中多數災區內之行動通訊系統全面中斷即可印證行動通訊系統其實是極為脆弱的，然而有效運作的通訊系統卻是災情傳遞、資源調度及救災是否順利的關鍵因素。本文所探討的應急通訊系統利用倖存的連通基地台和斷訊卻沒有損毀的基地台，以無線電連接起來建構一個臨時性的通訊系統，稱為應急蜂巢式行動通訊網路(Contingency Cellular Network，CCN)。由於各地災情狀況不完全相同，CCN的建構順序必須考慮災區的輕重緩急、時間的急迫等因素依序建構。因此當CCN拓樸規劃完成後，根據CCN拓樸、各地災情嚴重程度以及拓樸中基地台間的相對距離(運輸時間)進行基地台建構排程規劃，以達到最大的總救災效益。 本文考慮各基地台所能發揮的救災效益、所需建構時間、以及運輸工具從任一基地台到另一基地台所需運輸時間，提出兩個適合CCN拓樸樹狀結構的考慮資源運輸路徑之最佳化排程模型CCNDS-AC和CCNDS-UC。CCNDS-AC限制建構順序必須從連網台往下循序建構，但CCN-UC則否。因發生突發性大型天然災害時，可容許的計算時間相當短暫，因此提出了兩個快速的啟發式演算法DS-ACG與DS-UCB，可在短時間內求出一組相當逼近於最佳解的建構排程順序，與DS-UCB相互比較。本文以電腦模擬的方式進行小規模實驗與大規模實驗評估，並且用Genetic Algorithm來比較啟發式演算法的效能。結果顯示DS-UCB明顯優於DS-ACG及Genetic Algorithm。在小規模實驗中DS-UCB可求得與最佳解的總救災效益誤差平均約0.9%的近似最佳解建構順序。而在大規模實驗下， DS-UCB與十萬個解中的最佳解─pseudo optimal solution相較，總救災效益平均高出約16.7%，而總救災時間平均約少了19.4%。 / When stricken by a large-scale disaster, the efficiency of disaster response operation is very critical to life saving. However, cellular networks were usually crashed in earthquake, typhoons or other natural disasters due to power outage or backhaul breakage. Unfortunately, the efficiency of communication system is a critical factor to the success of disaster response operation. We designed a contingency cellular network (CCN) by connecting physically intact but service-disrupted base stations together with wireless links. Since the transportation capacity may be very limited, scheduling of CCN deployment order according to the demand of disaster operation and traveling time between base stations becomes an important issue. We propose two optimization models: CCN Deployment Scheduling Antecessor Constrained Problem (CCNDS-AC) and CCN Deployment Scheduling Unconstrained Problem (CCNDS-UC), aiming to maximize the efficiency of disaster response operation. Both problems are proven to be NP Hard. We also designed two rapid heuristic algorithms, DS-ASG and DS-UCB to solve the problems respectively when it is needed in urgent. Finally, we evaluated the proposed algorithms against optimal solutions (in small cases only) as well as genetic algorithm by simulation. The experimental results show that DS-UCB outperforms all other algorithms. In small scale cases, the profit obtained by DS-UCB is only 0.9% smaller than what the optimum solution can get. In large scale cases, as compared to the pseudo optimum solution, which is the best solution among 100,000 solutions, DS-UCB outperforms pseudo optimum solutions in profit by 16.7%, and in traveling time by 19.4%, both in average.

大型自然災害會癱瘓通訊系統嚴重影響到救災效率，本論文旨在快速提出一個建構排程供應急通訊系統佈建。無線通訊系統的成熟極大的為使用者帶來便利性，但當發生大規模的地震或強烈颱風等重大天然災害時，通訊系統卻常常因架構原因，隨著電力與交通系統的損毀而癱瘓。由歷年大型災變中多數災區內之行動通訊系統全面中斷即可印證行動通訊系統其實是極為脆弱，而有效運作的通訊系統卻是災情傳遞、資源調度以及互助協調是否順利的關鍵因素。 本篇論文所探討的應急通訊系統是利用僅存的連通基地台和斷訊卻沒有損毀的基地台建構一個臨時性的網路，稱為應急蜂巢式行動網路(contingency cellular network，CCN)。由於災區的交通系統可能癱瘓，因此CCN的建構需視各種運輸能力而規劃，而各個地方受災情況不盡相同，CCN的建構順序也須辨明輕重緩急依序建構，網路拓樸的規劃是本研究團隊的另一研究主題，本文主在探討如何在網路拓樸已知情況下進行CCN建構排程以達到最大的救災效益，因此我們提出一適合CCN樹狀結構的最佳化排程模型，以追求救災效益的最大化，這些模型可供使用者(救災指揮單位)系統化的解決CCN建構排程問題。 模型包含CCN樹狀拓樸、基地台數目、基地台建構時間、基地台重要度、拓樸連線集合和建構工作組數。在此模型下提出一個考慮各基地台的時效性以及重要性而進行快速排程的演算法，此演算法透過計算排程總救災效益決定優劣。分三階段實驗。三階段實驗皆可在數秒內得出接近最佳解的排程。 / When stricken by a large-scale disaster, the efficiency of disaster response operation is very critical to life saving. We propose to build a contingency cellular network to support emergency communication in large scale natural disasters by connecting disconnected base stations. This paper addresses the deployment scheduling problem. The advance of mobile communication technologies has brought great convenience to users. Cellular phone becomes the first communication tool most people would use in emergency. However, cellular networks were usually crashed due to earthquake, typhoons or other natural disasters due to power outage or backhaul broken. Unfortunately, the efficiency of communication system is a critical factor to the success of disaster response operation such as resource allocation as well as coordination of rescue and relief operations. We designed a contingency cellular network (CCN) by connecting physically intact but service-disrupted base stations together with wireless links. As the disaster area's transport system may be paralyzed, the construction of CCN may have to rely on air transportation such as helicopter or even airdrop. Since the transportation capacity may be very limited, scheduling of CCN deployment order according to the demand of disaster operation becomes an important issue. We model the CCN Deployment Scheduling Problem into a combinatorics optimization problem aiming to maximize disaster operation efficiency. The problem is proven NP Hard. Thus, we design an efficient heuristic algorithm to solve the problem when it is needed in urgent.