應急蜂巢式行動通訊網路的跨網路拓撲設計


Cross Network Topology Design For Contingency Cellular Network


黃冠傑

當大型災害發生時,往往造成傷亡慘重,若能把握於救災黃金72小時內救出受困民眾,則可望挽回更多寶貴的生命,但災區的通訊網路基礎設施時常因災害而遭受嚴重的損毀,無法正常運作。救災工作在缺乏通訊系統的支援下,因溝通協調的困難,大大提高救援的困難度。

我們分析歸納應急通訊系統的七大技術需求,提出一個可快速恢復特定區域通訊服務的網路,並為其設計通訊的拓樸結構。我們稱該網路為應急蜂巢式行動通訊網路(Contingency Cellular Network),簡稱CCN網路。CCN網路利用倖存的連通基地台和斷訊卻沒有損毀的基地台,以無線電連接起來建構一個臨時性的通訊系統,具有建置速度快、使用門檻低等多項特點,災區內擁有行動電話的使用者,可利用本網路作為救災通訊之用。

本研究中,我們以各基地台通訊範圍內的通訊需求人數與災區毀損程度,作為效益參數,在數量有限的應急通訊設備下,連接不同電信業者倖存的基地台,建立應急蜂巢式行動網路的跨網路拓樸,此拓樸除追求最大救災效益外,並顧及通訊品質,避免建立負載失衡的連線。我們將問題塑模為一類似圖論中的K-Maximum Spanning Tree問題,稱為Depth Bounded Mutually Exclusive K-Maximum Profit Spanning Tree問題,並且提供數個快速的啟發式演算法,可在緊急時快速地建立應急蜂巢式行動網路的跨網路拓樸。

When stricken by a large-scale disaster, the efficiency of disaster response operation is very critical to life saving. However, communication systems, such as cellular networks, usually crashed due to various causes that make coordination extremely difficult for many disorganized disaster response workers. 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 analyze 7-ability for emergency communication systems and propose a Contingency Cellular Network (CCN) by connecting disconnected base stations together with wireless links and contingency recovery packages. 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 save many lives.

This thesis addresses the design of forwarding topology using multiple operator’s base stations aiming to maximize the efficiency of disaster response. 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 Cross Network Topology Design problem into a K-Maximum Spanning Tree Problem aiming to maximize disaster operation efficiency. The problem is proven to be NP Hard. We also design some efficient heuristic algorithms to solve the problem when it is needed in urgent.