資訊管理學報
黃勇嘉;黃三益;
頁: 53-77
日期: 2009/01
摘要: 當行動網路的傳輸電路發生障礙而導致大批基地台倒台時，如果鄰近尚有能持續運作的基地台，那他們便能接替這些倒台基地台的任務，繼續提供附近地區用戶的行動通信接續服務，縮小因傳輸電路障礙而導致行動通信中斷的區域範圍。因此，行動通訊基地台的專線電路若能在障礙發生之前，預先作好路由分散配置，便能避免區域性的行動通信全面中斷，減少話務損失。當然，電路調訂人員若能在專線電路申租之時，即著手進行路由分散配置，更能提升效率，免去事後重覆調訂之工作負擔，對行動通信的維運有非常大的助益。 本研究採用圖形結構來模擬現行的行動網路、提出數種路由選擇策略，並訂定調訂路由的評估標準。一條好的調訂路由應滿足「分散績效」要儘可能高、「搜尋時間」要儘可能短，並儘可能堅持「最少中繼段」。最後我們利用電信公司現有的路由資料來評估各種路由選擇策略，根據實驗的結果我們提出在不同環境下該使用何種路由選擇策略的建議。 本論文所研究的問題是屬於如何改善電波涵蓋品質的範疇，但是目前從事這類研究領域的學者或專家所提出的文獻中，尚未發現從傳輸電路的角度來加以探討，可說是被忽略的部分。而本研究提出的調訂路由選擇模型能在不增加企業的電路設備投資，不增加維運人力成本，不影響行通設備的正常維運下，在大批倒台時達到最少的話務損失，這是本論文的最大貢獻。
關鍵字: 基地台專線電路;理想調訂路由;路由分散配置;電波涵蓋品質;最短路徑演算法;A*演算法;行動網路;
Abstract: When a large number of base stations fail due to the breakdown of some transmission circuit in a mobile cellular network, base stations located in neighboring areas may take over those malfunctioned base stations and continue to provide the access service of mobile communications for users in surrounding areas, thereby reducing the area in which mobile communications are out of service. Therefore, if leased circuits in base stations could complete the route distribution configuration prior to the onset of malfunction, it could decrease the impact of circuit breakdown and traffic loss. Also, the efficiency would be improved if the circuit assignment personnel could complete the job when determining the leased lines for a newly installed base station, so as to avoiding reassignment in the future and subsequently reducing the cost. In this study, we use a graph structure to represent the present mobile cellular network and develop various route-selection strategies. We define the ”Optimal Route Assignment” for a newly constructed base station, which refers to the route assignment that causes the least disconnection area when any circuit in the network is broken. We show that A* algorithm can be used to achieve optimal route assignment. However, the computing the optimal route using the A* algorithm is time consuming. Measures such as computation time and least hops are incorporated in designing other heuristic strategies for route assignment. These strategies are parametric and we carried out experiments by adjusting and controlling parameters using real routing data. The experimental results demonstrate that there is no single winner among the proposed strategies. We identify a number of best strategies for different operating regions.
Keywords: Private Leased Circuit of Base Stations;Optimal Route Assignment;Distributed Route Configuration;Radio Coverage Quality;Shortest Path Algorithm;A* Algorithm;Mobile Cellular Network;
瀏覽次數: 14316 下載次數: 299
引用 導入Endnote
頁: 53-77
日期: 2009/01
摘要: 當行動網路的傳輸電路發生障礙而導致大批基地台倒台時，如果鄰近尚有能持續運作的基地台，那他們便能接替這些倒台基地台的任務，繼續提供附近地區用戶的行動通信接續服務，縮小因傳輸電路障礙而導致行動通信中斷的區域範圍。因此，行動通訊基地台的專線電路若能在障礙發生之前，預先作好路由分散配置，便能避免區域性的行動通信全面中斷，減少話務損失。當然，電路調訂人員若能在專線電路申租之時，即著手進行路由分散配置，更能提升效率，免去事後重覆調訂之工作負擔，對行動通信的維運有非常大的助益。 本研究採用圖形結構來模擬現行的行動網路、提出數種路由選擇策略，並訂定調訂路由的評估標準。一條好的調訂路由應滿足「分散績效」要儘可能高、「搜尋時間」要儘可能短，並儘可能堅持「最少中繼段」。最後我們利用電信公司現有的路由資料來評估各種路由選擇策略，根據實驗的結果我們提出在不同環境下該使用何種路由選擇策略的建議。 本論文所研究的問題是屬於如何改善電波涵蓋品質的範疇，但是目前從事這類研究領域的學者或專家所提出的文獻中，尚未發現從傳輸電路的角度來加以探討，可說是被忽略的部分。而本研究提出的調訂路由選擇模型能在不增加企業的電路設備投資，不增加維運人力成本，不影響行通設備的正常維運下，在大批倒台時達到最少的話務損失，這是本論文的最大貢獻。
關鍵字: 基地台專線電路;理想調訂路由;路由分散配置;電波涵蓋品質;最短路徑演算法;A*演算法;行動網路;
Route Assignment for Distributed Leased Lines in Mobile Cellular Network
Abstract: When a large number of base stations fail due to the breakdown of some transmission circuit in a mobile cellular network, base stations located in neighboring areas may take over those malfunctioned base stations and continue to provide the access service of mobile communications for users in surrounding areas, thereby reducing the area in which mobile communications are out of service. Therefore, if leased circuits in base stations could complete the route distribution configuration prior to the onset of malfunction, it could decrease the impact of circuit breakdown and traffic loss. Also, the efficiency would be improved if the circuit assignment personnel could complete the job when determining the leased lines for a newly installed base station, so as to avoiding reassignment in the future and subsequently reducing the cost. In this study, we use a graph structure to represent the present mobile cellular network and develop various route-selection strategies. We define the ”Optimal Route Assignment” for a newly constructed base station, which refers to the route assignment that causes the least disconnection area when any circuit in the network is broken. We show that A* algorithm can be used to achieve optimal route assignment. However, the computing the optimal route using the A* algorithm is time consuming. Measures such as computation time and least hops are incorporated in designing other heuristic strategies for route assignment. These strategies are parametric and we carried out experiments by adjusting and controlling parameters using real routing data. The experimental results demonstrate that there is no single winner among the proposed strategies. We identify a number of best strategies for different operating regions.
Keywords: Private Leased Circuit of Base Stations;Optimal Route Assignment;Distributed Route Configuration;Radio Coverage Quality;Shortest Path Algorithm;A* Algorithm;Mobile Cellular Network;
瀏覽次數: 14316 下載次數: 299
引用 導入Endnote