機會驅動多重接取系統之省能路由選擇協定｜國立臺灣科技大學博碩士論文系統

簡易檢索 / 詳目顯示

回結果列表

研究生：	洪嘉陽 Jia-Yang Hung
論文名稱：	機會驅動多重接取系統之省能路由選擇協定 Power-Efficient Route Discovery Protocol (PERDP) for ODMA Systems
指導教授：	鄭瑞光 Ray-Guang Cheng
口試委員:	陳金蓮 Jean-Lien Chen 曹孝櫟 Shiao-Li Tsao 楊人順 Jen-Shun Yang
學位類別：	碩士 Master
系所名稱：	電資學院 - 電子工程系 Department of Electronic and Computer Engineering
論文出版年：	2005
畢業學年度：	93
語文別：	中文
論文頁數：	111
中文關鍵詞：	機會驅動多重接取、無線蜂巢網路、多重躍進、轉傳、省能路由、路由選擇、連結機率
外文關鍵詞：	ODMA, route discovery, path connection probability
相關次數：	點閱：257 下載：1
分享至:	分享至facebook 分享至twitter

查詢本校圖書館目錄查詢臺灣博碩士論文知識加值系統勘誤回報

機會驅動多重接取(Opportunity Driven Multiple Access, 簡稱為ODMA)是一種利用多重躍進(multi-hop)轉傳(relay)訊息的協定，在多重躍進的無線網路中，每個用戶可藉由路由選擇機制建立一條路徑，將欲傳送的訊息藉由該路徑上的其他用戶轉傳至目的端，相對於直接傳送，利用轉傳可使傳送距離縮短，因此用戶能夠使用較低的傳送功率傳送訊息來降低功率消耗。然而，目前ODMA所遭遇的問題有：一、用戶必須耗費功率在轉傳其他用戶的訊息；二、在ODMA的路由建立上，使用的路由協定如，動態資源路由協定(Dynamic Source Routing，簡稱為DSR) 雖能建立起ODMA連結，卻無法得到整體最低功率消耗解以及降低網路上的路由訊息量。
省能路由(Power-Efficient Routing，簡稱為PER)機制針對無法得到整體最低功率消耗解問題，作者以數值分析求得一個ODMA連結的最低功率消耗路徑解，並據以推導出達到此解所需要的最佳轉傳用戶數與轉傳訊息所需的最低傳送功率。PER機制的最低功率消耗路徑解是基於單一直線的連結，每個轉傳用戶剛好是位在最佳的傳送距離之上，然而在實際的情形中，用戶的位置可能會有偏差，因此PER機制亦以最佳的傳送功率為基準，利用功率增幅與縮減來限定一功率範圍，藉此彌補用戶的位置偏差，並且利用此功率範圍來指定可轉傳訊息的用戶，達到降低路由訊息量，只是PER機制未做此功率範圍大小的深入研究。
在本論文中，我們針對PER機制未解決的功率範圍問題，提出省能路由選擇協定(Power-Efficient Route Discovery Protocol，簡稱為PERDP) ，此協定在滿足系統所需最小成功連結機率的前提下，讓用戶儘可能減少在路由選擇過程所需傳送的路由訊息量，藉以降低用戶的功率消耗。
PERDP的理論基礎建立在可靠的ODMA連結機率預測，我們基於幾何層面做連結機率的數值分析。PERDP則在最佳的RelayUE數目的條件下，以滿足良好的連結性為前提，指定特定區域上的用戶當做轉傳的用戶，達到降低整體網路的路由訊息量與功率消耗。本論文利用模擬驗證ODMA連結機率的數值分析的正確性，並且將PERDP與傳統的DSR及PER機制相比較，模擬結果顯示，當三種機制均滿足90%成功連結機率與高UE密度的前提下，PERDP所需的路由訊息量約僅為DSR的20.2%，PER的23.6%，由於採用PERDP可以大量降低路由選擇過程的路由訊息量，因此可以有效的降低用戶的功率消耗。

Opportunity Driven Multiple Access (ODMA) is a cellular multi-hop relaying protocol proposed for Universal Mobile Telecommunications System (UMTS). In ODMA, user data are exchanged between a sending user equipment (UE) and Node B by being relayed through intermediate UEs and thus, the sending UE can significantly reduce its transmission power. The price paid is that the sending UE has to establish a routing path to Node B prior to data exchange, which introduces extra signaling overhead and thus, shorten the battery life of UEs. The power-efficient routing (PER) mechanism solves the relay issue of ODMA, which utilizes an analytical solution to decide the optimum number of relaying UEs and the optimum transmission power of a source UE and relaying UEs required in the minimum-power ODMA path. In this thesis, we first propose an analytical method to derive the path connection probability according to a given set of routing parameters. A power-efficient route discovery protocol (PERDP) is then proposed to prevent from flooding ineffective route requests (RREQs) and thus, reduce the signaling overhead during ODMA route discovery. Simulation results demonstrate the accuracy of the analysis and the superiority of the proposed PERDP. It was found that signaling overhead of the proposed PERDP is 20.2% and 23.6% lower than that of dynamic source routing (DSR) and PER, respectively, for ensuring a 90% path connectivity probability in high UE density environment.

中文摘要...........................................................I
英文摘要.........................................................III
誌謝..............................................................IV
圖表索引........................................................VIII
第一章  簡介.......................................................1
1.1   研究背景.....................................................1
1.1.1  機會驅動多重接取系統概述
(Overview of Opportunity Driven Multiple Access , ODMA）...........1
1.1.2  功率察覺路由演算法
（Power-Aware Routing (PAR) Algorithm）............................3
1.1.2.1  基於位置資訊的分散式網路演算法
（A Distributed Position-Based Network Algorithm）.................3
1.1.2.2	  位置輔助功率察覺路由演算法
（A Location-aided Power-aware Routing Algorithm）.................5
1.1.2.3	  基於圓錐的拓樸控制的分散式演算法
（A Distributed Cone-Based Topology Control Algorithm）............6
1.1.2.4	  ODMA路由程序與路由控制訊息
（ODMA Routing Procedures and Routing Control Information）........7
      1.1.2.5  機會驅動多重接取系統之省能路由機制
             （A Power-Efficient Routing (PER) Mechanism for ODMA Systems）..........................................................8
1.2   研究動機....................................................10
第二章  省能路由選擇協定
(Power-Efficient Route Discovery Protocol, PERDP).................11
2.1   系統模型....................................................11
2.2   理論基礎....................................................12
2.2.1  功率與距離的轉換….........................................12
2.2.2  成功建立連結的機率分析.....................................15
   2.2.2.1  1-hop.................................................15
   2.2.2.2  2-hop.................................................17
   2.2.2.3  3-hop.................................................19
   2.2.2.4  N-hop.................................................21
2.3  協定設計路由機制.............................................21
  2.3.1  1-hop....................................................22
  2.3.2  2-hop....................................................29
  2.3.3  3-hop....................................................30
  2.3.4  N-hop....................................................33
第三章  系統模擬與分析............................................35
  3.1  RelayUE分佈區域之驗證......................................36
3.1.1  1-hop......................................................36
    3.1.2  2-hop..................................................37
    3.1.3  3-hop..................................................38
    3.1.4  推導至N-hop............................................40
  3.2  成功建立連結機率之驗證.....................................41
    3.2.1  1-hop..................................................42
    3.2.2  2-hop..................................................43
    3.2.3  3-hop..................................................45
3.3  總路由訊息量與總傳送功率消耗之比較...........................46
    3.3.1  1-hop..................................................46
    3.3.2  2-hop..................................................48
    3.3.3  3-hop..................................................50
第四章  結論......................................................53
參考文獻..........................................................54
附錄 A  重疊區域形狀判別..........................................56
附錄 B  重疊區域面積推導..........................................58
作者簡介..........................................................97

                                

[1] 3GPP TSG-RAN, “Opportunity Driven Multiple Access,” 3GPP Technical Report, 3G TR 25.924, v1.0.0, December 1999.
[2] 3rd Generation Partnership Project (3GPP), Technical Specification Group (TSG) Radio Access Network (RAN), “Physical Layer Items Not For Inclusion In Release ’99” 3G TR 25.833, v3.0.0, December 2003.
[3] H. Homla and A. Toskala, “WCDMA for UMTS: Radio access for third generation mobile communications,” John Wiley, 2002.
[4] T. J. Harold and A. R. Nix, “Intelligent relaying for future personal communications systems,” in Proc. IEE Colloquium Capacity Range Enhancement Tech. 3G, 2000, pp. 9/1–9/5.
[5] O. Teyeb, “Overview of multihop cellular networks,” Future Adaptive Communication Environment (FACE) Project Report, June 2003.
[6] T. Rouse, I. Band and S. McLaughlin, "Capacity and Power Investigation of Opportunity Driven Multiple Access (ODMA) Networks in TDD-CDMA Based Systems", in Proc. IEEE ICC 2002, New York, Apr. 2002, pp. 3202-3206.
[7] T. Rouse, S. McLaughlin and H. Haas, “Coverage-Capacity Analysis of Opportunity Driven Multiple Access (ODMA) in UTRA TDD,” in Proc. IEE 3G Mobile Communication Technologies, pp. 252–256, March 2001.
[8] T. J. Harold and A. R. Nix, “Capacity enhancement using intelligent relaying for future personal communications systems,” in Proc. VTC Fall, 2000, Paper 4.3.1.1, pp. 2115–2120.
[9] V. Rodoplu and T. H. Meng, “Minimum energy mobile wireless networks,” IEEE J. Selected Areas in Communications, vol. 17, no. 8, pp. 1333–1344, August 1999.
[10] Yuan Xue and Baochun Li, “A location-aided power-aware routing protocol in mobile ad hoc networks,” Global Telecommunications Conference, 2001. GLOBECOM '01. IEEE , vol. 5 , pp. 2837 – 2841, Nov. 2001.
[11] R. Wattenhofer, L. Li, P. Bahl, and Y. M. Wang, “Distributed topology control for power efficient operation in multihop wireless ad hoc networks,” IEEE INFOCOM 2001, April 2001.
[12] Vodafone Group, “ODMA routing with procedures for mobile originated calls, mobile terminated calls, and location update,” Tdoc TSGR2#2(99) 179, 3GPP RAN WG2, March 1999.
[13] Vodafone Group, “Routing control information in an ODMA relay node,” Tdoc TSGR2#2(99) 180, 3GPP RAN WG2, March 1999.
[14] R. G. Cheng, H. M. Cheng, P. Lin, “A Power-Efficient Routing (PER) Mechanism for ODMA Systems,” IEEE WirelessCom, 2005.
[15] 3GPP TSG-RAN, “User Equipment (UE) procedures in idle mode and procedures for cell reselection in connected mode,” 3GPP Technical Specification, 3G TS 25.304, v6.5.0, March 2005.
[16] T. S. Rappaport, “Wireless Communications Principles and Practice,” 2nd Edition, Prentice Hall PTR, 2002.
[17] T. Rouse, S. McLaughlin and I. Band, “Congestion-Based Routing Strategies in Multihop TDD-CDMA Networks,” IEEE J. Selected Areas in Communications, vol. 23, no. 3, pp. 668–681, March 2005.

簡易檢索 / 詳目顯示

相關論文