Efficient Keep-Alive Mechanism in Mobile Ad-hoc Generic Access Network (GAN)

簡易檢索 / 詳目顯示

回結果列表

研究生：	廖士杰 Liao, Shih-Chieh
論文名稱：	Efficient Keep-Alive Mechanism in Mobile Ad-hoc Generic Access Network (GAN) 在行動點對點通用存取網路下的有效保持存活機制
指導教授：	陳志成 Chen, Jyh-Cheng
口試委員:
學位類別：	碩士 Master
系所名稱：	電機資訊學院 - 資訊工程學系 Computer Science
論文出版年：	2009
畢業學年度：	97
語文別：	英文
論文頁數：	41
中文關鍵詞：	通用存取網路、存活機制、行動點對點網路
外文關鍵詞：	GAN, Keep-Alive, Ad-hoc
相關次數：	點閱：1 下載：0
分享至:	分享至facebook 分享至twitter

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

The integration of cellular networks and unlicensed-spectrum networks has become an important issue for next generation wireless communications. The 3rd Generation Partnership Project (3GPP) has proposed an architecture called Generic Access Network (GAN) to allow unlicensed-spectrum radios such as wireless LAN (WLAN) or Bluetooth to access cellular networks. Most of the unlicensed-spectrum radios can form an ad-hoc network in which multiple radio links are used to reach the 3GPP core network. However, the forwarding of periodical signalingmessages from ad-hoc network to the 3GPP core network will cause significant overhead. To reduce the total amount of periodical signaling messages, we propose an efficient Keep Alive mechanism to reduce the signaling messages at the transport layer and IP layer in GAN. The simulation results show that our proposed mechanism can significantly reduce the amount of periodical signaling messages and decrease the deregistration rate in GAN.

在下一代無線通訊中，蜂巢式網路(cellular network)與非授權行動接取網路(Generic Access Network)的整合已經變成重要的議題。第三代夥伴合作計畫(3GPP)已提出一個架構，被稱為通用存取網路，它允許非授權頻譜無線訊號，像無線區域網路(WLAN)或藍芽(Bluetooth)，去存取蜂巢式網路。大部分非授權頻譜能夠形成行動點對點網路，在這網路下使用者會有多條連線到3GPP的核心網路，然而轉送從行動點對點網路所發出的周期性控制訊息會造成3GPP核心網路的重大負擔。為了減少在通用存取網路下的周期性控制訊息量，我們提出了一個有效存活機制去減少在傳輸層(transport layer)和網路層(IP layer)訊息量。實驗模擬結果證實我們提出的方法確實有效減少周期性控制訊息量並能減低在通訊存取網路下使用者被撤銷註冊的機率。

Acknowledgments . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ii
Abstract . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . iii
List of Tables . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . vi
List of Figures . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . vii
Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
1. Motivation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
2. Organization of the Thesis . . . . . . . . . . . . . . . . . . . . . . . . . . 2
Background . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3
1. Architecture of Generic Access Network . . . . . . . . . . . . . . . . . . . 3
1.1. Discovery . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5
1.2. Registration . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7
1.3. Keep Alive . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8
1.4. Deregistration . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10
2. Ad-hoc Routing Protocol . . . . . . . . . . . . . . . . . . . . . . . . . . . 10
2.1. Ad-hoc On Demand Distance Vector . . . . . . . . . . . . . . . . . 11
2.2. Destination-Sequenced Distance-Vector . . . . . . . . . . . . . . . 12
iv
Problem Statement . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14
1. Problem Statement . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14
2. Problem Analysis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14
Proposed Method . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 18
1. Proposed Method . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 18
2. Design Principles . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 18
3. Keep Alive Tree Management . . . . . . . . . . . . . . . . . . . . . . . . 19
4. Store and Forward . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 22
5. Abnormal Cases for Keep Alive . . . . . . . . . . . . . . . . . . . . . . . 24
6. Procedure of Each Role . . . . . . . . . . . . . . . . . . . . . . . . . . . . 26
6.1. Initial-KA-select . . . . . . . . . . . . . . . . . . . . . . . . . . . 26
6.2. KA-reselect . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 27
Simulation Results . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 29
1. Simulation Environment . . . . . . . . . . . . . . . . . . . . . . . . . . . 29
1.1. Simulation Parameters . . . . . . . . . . . . . . . . . . . . . . . . 30
2. Simulation Results . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30
3. Discussion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 36
Conclusions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 38
Bibliography . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 40

                                

[1] “The 3rd generation partnership project.” http://www.3gpp.org/.
[2] “Radio Access Network; Generic Access Network (GAN); Stage 2.” 3GPP technical
sepcification of release 8 - TS 43.318 V8.3.0, Aug. 2008.
[3] “Generic Access Network (GAN); Mobile GAN interface layer 3 specification.” 3GPP
technical sepcification of release 8 - TS 44.318 V8.3.0, Sept. 2008.
[4] “Architecture (Stage 2).” UMA technical specification R1.0.4, May 2005.
[5] “Protocols (Stage 3).” UMA technical specification R1.0.4, May 2005.
[6] IEEE, “Std 802.11: Wireless LAN medium access control (MAC) and physical layer
PHY specifications,” Nov. 1997.
[7] IEEE, “Std 802.15: Wireless Personal Area Networks specification,” Jan. 2005.
[8] “Internet Protocol.” IETF RFC 791, Sept. 1981.
[9] “Transmission control protocol.” IETF RFC 793, Sept. 1981.
[10] H. Haverinen,J. Salowey, “EAP SIM Authentication.” IETF draft-haverinen-pppexteap-
sim-06.txt, Oct. 2002.
[11] J. Arkko,H. Haverinen, “ExtensibleAuthentication ProtocolMethod for 3rd Generation
Authentication and Key Agreement (EAP-AKA).” IETF draft-arkko-pppext-eap-aka-
15.txt, Dec. 2004.
[12] Charlie Kaufman, “Internet Key Exchange (IKEv2) Protocol.” IETF draft-ietf-ipsecikev2-
17.txt,Mar. 2005.
[13] Charles E. Perkins and Elizabeth M. Royer, “Ad hoc On-Demand Distance Vector
Routing,” Feb. 1999.
[14] Charles E, Perkins, Pravin Bhagwat, “Highly dynamic Destination-Sequenced
Distance-vector routing (DSDV) for mobile computers,” Aug. 1993.
[15] “User datagram protocol.” IETF RFC 768, Aug. 1980.
[16] “The Network Simualtor - ns2.” http://www.isi.edu/nsnam/ns/.

全文公開日期本全文未授權公開 (校內網路)
全文公開日期本全文未授權公開 (校外網路)

簡易檢索 / 詳目顯示

相關論文