Responsive image
博碩士論文 etd-0724104-144720 詳細資訊
Title page for etd-0724104-144720
論文名稱
Title
行動通訊網路中同時搜尋演算法與效能分析
Performance Analysis of Concurrent Search in Mobile Networks
系所名稱
Department
畢業學年期
Year, semester
語文別
Language
學位類別
Degree
頁數
Number of pages
46
研究生
Author
指導教授
Advisor
召集委員
Convenor
口試委員
Advisory Committee
口試日期
Date of Exam
2004-07-13
繳交日期
Date of Submission
2004-07-24
關鍵字
Keywords
行動通訊網路、同時搜尋演算法、效能分析
Mobile Networks, Concurrent Search, Performance Analysis
統計
Statistics
本論文已被瀏覽 5659 次,被下載 2137
The thesis/dissertation has been browsed 5659 times, has been downloaded 2137 times.
中文摘要
在行動通訊網路下,位置管理負責追蹤行動用戶。一般來說,位置管理提供位置更新及傳呼兩種方式。Gau與Haas首先提出的concurrent search(CS)演算法可同時確定網路中使用者的位置。我們利用離散馬可夫鏈的理論,對CS演算法做效能分析。特別的是,我們對行動用戶在網路中的位置分布採取最壞情況,也就是所有行動用戶皆均勻分布於網路的所有細胞中。我們對於平均傳呼延遲、通話阻斷機率和系統容量進行分析。我們將會以模擬結果證實理論分析跟CS演算法模擬值是相當接近的。
Abstract
In mobile communications networks, a location management scheme is responsible for tracking mobile users. Typically, a location management scheme consists of a location update scheme and a paging scheme. Gau and Haas first proposed the concurrent search(CS) approach that could simultaneously locate a number of mobile users in mobile communications networks. We propose to use the theory of the discrete-time Markov chain to analyze the performance of the concurrent search approach. In particular, we concentrate on the worst case in which each mobile user appears equally likely in all the cells of the network. We analyze the average paging delay, the call blocking probability and the system size. We show that our analytical results are consistent with the simulation results of the concurrent search.
目次 Table of Contents
誌 謝 I
中文摘要 II
Abstract III
第一章 緒論 1
1-1 行動管理的背景 2
1-2文獻探討 7
1-3 研究動機 7
1-4文章組織 8
第二章 Concurrent Search的演算法 9
2-1演算法設計與模型建立 9
2-2 優先權的解決方式 11
2-3 例子說明 12
2-4 模擬結果 14
第三章 理論分析 16
3-1 理論分析的模型 16
3-1-1 理論分析的模型建立 16
3-1-2 轉移機率 20
3-1-3 狀態說明 24
3.2 系統效能計算 27
3-2-1 通話阻礙機率 27
3-2-2 系統大小和平均傳呼延遲 28
3.3 理論分析的流程圖 30
第四章 模擬結果 33
4-1 理論值的分析 33
第五章 結論 40
5-1 總結 40
5-2 未來努力的方向 40
參考文獻 41
Index 44
參考文獻 References
[1] A. Abutaleb and Victor O. K. Li, “Paging strategy optimization in personal communication systems,” ACM/Kluwer Wireless Networks, Vol. 3, No. 3, 1997, p. 195-204.
[2] Ian F. Akyildiz, Joseph S. M. Ho, Yi-Bing Lin, “Movement-Based Location Update and Selective Paging for PCS Networks,” IEEE/ACM Transactions on Networking, vol. 4, no. 4, p. 629-638, December 1995.
[3] Ian F. Akyildiz, Yi-Bing Lin, Wei-Ru Lai and Rong-Jaye Chen, “A New Random Walk Model for PCS Networks, ” IEEE Journal On Selected Areas In Communications, Vol. 18, No. 7, July 2000, p. 1254-1260.
[4] L. P. Araujo, J. R. B. de Marca, “Paging and location update algorithms for cellular systems,” IEEE Transactions on Vehicular Technology, Vol. 49, No. 5, September 2000, p. 1606-1604.
[5] Rung-Hung Gau, Haas, Z.J., “Concurrently Searching for Mobile User in Cellular Networks,” IEEE/ACM Transactions on Networking, Vol. 12, No. 1, February 2004, p.117-130.
[6] Donald Gross and Carl M. Harris, Fundamentals of Queueing Theory, 1998, John Wiley and Sons, Inc.
[7] Joseph S. M. Ho and Ian F. Akyildiz, “Mobile user location update and paging under delay constraints”, ACM-Baltzer J. Wireless Networks, April 1995, p.413-425.

[8] Bhaskar Krishnamachari, Rung-Hung Gau, Stephen B. Wicker, and Zygmunt J. Haas, "Optimal Sequential Paging in Cellular Networks," ACM/Kluwer Wireless Networks, Vol. 10, Issue 2, March 2004, p. 121-131.
[9] Jie Li, Yi Pan, and Xiaohua Jia, “Analysis of Dynamic Location Management for PCS Networks,” IEEE Transactions on Vehicular Technology, Vol. 51, No. 5, September 2002, p. 1109-1119.
[10] Yi-Bing Lin and Imrich Chlamtac, Wireless and Mobile Network Architectures, 2001, John Wiley and Sons, Inc.
[11] Yi-Bing Lin and Wen-Nung Tsai, “Location Tracking with Distributed
HLR’s and Pointer Forwarding,” IEEE Transactions on Vehicular Technology,
Vol. 47, No. 1, February 1998, p. 58-64.
[12] G. L. Lyberopoulos, J. G. Markoulidakis, D. V. Polymeros, D. F. Tsirkas and E. D. Sykas, “Intelligent paging strategies for third generation mobile telecommunication systems,” IEEE Transactions on Vehicular Technology, Vol. 44, No. 3, August 1995, p. 543-553.
[13] Magnus Madfors, Kenneth Wallstedt, Sverker Magnusson, Hakan Olofsson, Per-Ola Backman, and Stefan Engstrom, “High Capacity with Limited Spectrum in Cellular Systems,” IEEE Communications Magazine, August 1997, p.38-45.
[14] M. A. Marsan, “Packet Delay Analysis in GPRS Systems,” IEEE INFOCOM, April 2003, p.970-978.
[15] Meo, M., Marsan, M.A., Batetta, C, “Resource Management Policies in GPRS Wireless Internet Access Systems”, IEEE Computer Society, 2002, p.707-716.
[16] D. Munoz-Podrguez, “Cluster paging for traveling subscribers,” IEEE Vehicular Technology Conference 1990.
[17] D. Plassmann, “Location management strategies for mobile cellular networks of 3rd generation,” IEEE Vehicular Technology Conference, June 1994, p.649-653.
[18] Ramin Rezaiifar and Armand M. Makowski, “From Optimal Search Theory to Sequential Paging in Cellular Networks,” IEEE Journal on Selected Areas in Communications, Vol. 15, No. 7, September 1997, p. 1253-1264.
[19] Christopher Rose and Roy Yates, “Minimizing the average cost of
paging under delay constraints,” ACM/Kluwer Wireless Networks, Vol. 1, No. 2, 1995, p. 211-219.
[20] Szu-Lin Su, Kuo-Tay Chen, “Two-Stage Ensemble Paging Strategy for Cellular Communication Systems,” IEEE Communications Letters, Vol. 6, No. 10, October 2002, p.425-427.
[21] W. Wang, I. Akyildiz, and G. Stuber, “Effective Paging Schemes with Delay Bounds as QoS Constraints in Wireless Systems,” ACM/Kluwer Wireless Networks, Vol. 7, No. 5, September 2001, p. 455-466.
[22] Vincent W. -S. Wong and Victor C. M. Leung, “Location management for next-generation personal communications networks,” IEEE Network, Vol. 14, No. 5, September 2000, p. 18-24
電子全文 Fulltext
本電子全文僅授權使用者為學術研究之目的,進行個人非營利性質之檢索、閱讀、列印。請遵守中華民國著作權法之相關規定,切勿任意重製、散佈、改作、轉貼、播送,以免觸法。
論文使用權限 Thesis access permission:校內校外完全公開 unrestricted
開放時間 Available:
校內 Campus: 已公開 available
校外 Off-campus: 已公開 available


紙本論文 Printed copies
紙本論文的公開資訊在102學年度以後相對較為完整。如果需要查詢101學年度以前的紙本論文公開資訊,請聯繫圖資處紙本論文服務櫃台。如有不便之處敬請見諒。
開放時間 available 已公開 available

QR Code