Responsive image
博碩士論文 etd-0127113-230953 詳細資訊
Title page for etd-0127113-230953
論文名稱
Title
使用粒子群最佳化演算法來提升階層式細胞傳遞路由協定
Enhancing Hierarchical Cell Relay Routing Protocol by Using Particle Swarm Optimization
系所名稱
Department
畢業學年期
Year, semester
語文別
Language
學位類別
Degree
頁數
Number of pages
61
研究生
Author
指導教授
Advisor
召集委員
Convenor
口試委員
Advisory Committee
口試日期
Date of Exam
2013-01-18
繳交日期
Date of Submission
2013-01-27
關鍵字
Keywords
階層式細胞傳遞路由協定、傳輸半徑、能量消耗、行動隨意網路、粒子群最佳化演算法
Transmission radius, Hierarchical Cell Relay (HCR) scheme, Particle swarm optimization (PSO), Mobile Ad hoc Networks (MANETs), Energy consumption
統計
Statistics
本論文已被瀏覽 5654 次,被下載 562
The thesis/dissertation has been browsed 5654 times, has been downloaded 562 times.
中文摘要
在行動隨意無線網路(mobile ad hoc networks, MANETs)中,節點一般使用最大傳輸半徑,其好處是涵蓋範圍大,傳輸距離遠,若是資料需要節點轉傳也能使轉傳次數減少,節點之間也較不會因為頻繁移動而失去聯繫,因此路徑較不易斷裂;但其壞處是能量消耗較大,無線裝置之間的頻道競爭使網路賭塞的情形較為嚴重。在我們先前提出的階層式細胞傳遞路由協定(Hierarchical Cell Relay, HCR)中,傳輸半徑亦影響細胞大小,而細胞又會影響整體網路的建構,因此更難估計傳輸半徑對整體網路效能的影響。為了使網路效能達到最佳化,我們以粒子群最佳化演算法提升HCR路由協定的效能,當中以能量消耗及傳輸延遲為依據來尋找HCR的最佳傳輸半徑。為了驗證提升後的HCR路由協定擁有較佳的效能,我們將與使用最佳傳輸半徑的HCR與原本的HCR做比較,另外也與跟HCR相似的Adaptive Cell Relay (ACR)路由協定做比較。由網路模擬器模擬結果得知,使用粒子群最佳化演算法找出的最佳傳輸半徑於HCR,能夠減少電量消耗,並且降低傳輸延遲時間。
Abstract
In mobile ad hoc networks (MANETs), maximum transmission radius is generally used for each node. The advantage is that each node can find more other nodes in its transmission range and packets can reach the destination rapidly in fewer hops, but it will incur large power consumption. Hierarchical Cell Relay (HCR), proposed by us, is a hierarchical topology routing protocol in MANET. In order to enhance the performance in HCR, we use Particle Swarm Optimization (PSO) algorithm to find a suitable transmission radius in each different situation. Then, each node uses the suitable transmission radius instead of the maximum transmission radius. We compare the enhanced HCR with the original HCR, and we also compare to another hierarchical topology routing protocol, Adaptive Cell Relay (ACR). The comparison results show that using PSO in HCR can reduce energy consumption, but not affect on packets transmission delay.
目次 Table of Contents
摘要 i
Abstract ii
目錄 iii
圖次 v
表次 vii
字母縮寫對照表 viii
第一章 導論 1
1.1 簡介 1
1.2 IEEE 802.11簡介 1
1.3 無線網路的通訊模式 5
1.4 無線隨意網路背景與介紹 6
1.4.1 主動式路由協定 7
1.4.2 反應式路由協定 7
1.4.3 混合式路由協定 8
1.5 最佳化演算法簡介 8
1.6 研究動機 9
1.7 論文架構 10
第二章 相關背景研究 11
2.1 路由協定背景介紹 11
2.2 HCR及相似路由協定 11
2.2.1 HCR網路架構 12
2.2.2 HCR路由策略 13
2.2.3 路由協定MC與ACR 14
2.3 無線網路傳輸模型簡介 16
2.4 粒子群最佳化演算法簡介 17
2.5 粒子群最佳化演算法相關研究 19
2.6 傳輸半徑最佳化相關研究 19
第三章 利用PSO演算法找尋HCR路由協定之最佳傳輸半徑 21
3.1 PSO演算法流程 21
3.2 在HCR中運用PSO找尋最佳半徑之流程 27
第四章 模擬結果與討論 35
4.1 模擬環境假設及參數設定 35
4.2 模擬工具介紹 37
4.3 模擬結果分析與討論 38
4.3.1 傳輸半徑對網路的影響 38
4.3.2 傳輸半徑在模擬環境1中對網路的影響 40
4.3.3 傳輸半徑在模擬環境2中對網路的影響 42
第五章 結論與未來展望 46
參考文獻 47
參考文獻 References
[1] S. Basagni, I. Chlamtac, V. R. Syrotiuk, and B. A. Woodward, "A distance routing effect algorithm for mobility (DREAM)," 4th Annu. ACM/IEEE Int. Conf. on Mobile Computing and Networking, Dallas, TX, USA, 1998, pp. 76-84.
[2] J. Broch, D. A. Maltz, D. B. Johnson, Y. C. Hu, and J. Jetcheva, "A performance comparison of multi-hop wireless ad hoc network routing protocols," 4th Annu. ACM/IEEE Int. Conf. on Mobile Computing and Networking, Dallas, TX, USA, 1998, pp. 85-97.
[3] X. Du and D. Wu, "Adaptive cell relay routing protocol for mobile ad hoc networks," IEEE Trans. on Vehicular Technology, 2006, vol. 55, pp. 278-285.
[4] X. Du, D. Wu, and W. Liu, Y. Fang, "Multiclass routing and medium access control for heterogeneous mobile ad hoc networks," IEEE Trans. on Vehicular Technology, 2006, vol. 55, pp. 270-277.
[5] W. Feng, H. Alshaer, and J. M. H. Elmirghani, "Energy efficiency: Optimal transmission range with topology management in rectangular ad-hoc wireless networks," Int. Conf. on Advanced Information Networking and Applications, 2009, pp. 301-306.
[6] Z. J. Haas and M. R. Pearlman, "The performance of query control schemes for the zone routing protocol," IEEE/ACM Trans. on Networking, 2001, vol. 9, pp. 427-438.
[7] Z. J. Haas, M. R. Pearlman, and P. Samar, “The zone routing protocol for ad hoc networks,” Published Online, IETF MANET Working Group, INTERNET-DRAFT, July 2002, expiration: Jan. 2003.
[8] T. C. Huang, H. Y. Chi, and S. K. Huang, "Hierarchical cell relay scheme with GPS for mobile ad hoc networks," 10th Int. Symposium on Pervasive Systems, Algorithms, and Networks, 2009, pp. 220-225.
[9] T. C. Huang, C. K. Liao, and C. R. Dow, "Zone-based hierarchical routing in two-tier backbone ad hoc networks," 12th IEEE Int. Conf. on Networks, 2004, vol.2, pp. 650-654.
[10] T. Issariyakul and E. Hossain, Introduction to Network Simulator NS2, Springer Publishing Company, Incorporated, 2010.
[11] X. Jin, L. Bai, Y. Ji, and Y. Sun, "Probability convergence based particle swarm optimization for multiple constrained QoS multicast routing," 4th Int. Conf. on Semantics, Knowledge and Grid, 2008, pp. 412-415.
[12] M. Joa and I. T. Lu, “A peer-to-peer zone-based two-level link state routing for mobile ad hoc networks,” IEEE J. Sel. Areas Communications., vol. 17, no. 8, Aug. 1999, pp. 1415-1425.
[13] D. B. Johnson and D. A. Maltz, Dynamic Source Routing in Ad Hoc Wireless Networks. Boston, MA: Kluwer Academic, 1996.
[14] D. B. Johnson, D. A. Maltz, and Y. C. Hu, “The dynamic source routing for mobile ad hoc networks,” IETF Internet Draft, Jul. 2004.
[15] B. Karp and H. T. Kung, "GPSR: greedy perimeter stateless routing for wireless networks," 6th Annu. Int. Conf. on Mobile computing and networking, Boston, Massachusetts, United States, 2000, pp. 243-254.
[16] J. Kennedy and R. Eberhart, "Particle swarm optimization," IEEE Int. Conf. on Neural Networks, 1995. vol. 4, pp. 1942-1948.
[17] Y.-B. Ko and N. H. Vaidya, "Location-aided routing (LAR) in mobile ad hoc networks," 4th Annu. ACM/IEEE Int. Conf. on Mobile computing and networking, 2000, vol. 6, pp. 307-321.
[18] S. Murphy and J. J. Garcia-Luna-Aceves, “An efficient routing protocol for wireless networks,” ACM J. Mobile Networks Applicat., Special Issue on Routing in Mobile Communication Networks, vol. 1, no. 2, Oct. 1996, pp. 183-197.
[19] M. S. Norouzzadeh, M. R. Ahmadzadeh, and M. Palhang, “Plowing PSO: A novel approach to effectively initializing particle swarm optimization,” 3rd IEEE Int. Conf. on Computer Science and Information Technology, 2010, pp. 705-709.
[20] K. Pahlavan and P. Krishnamurthy, Principles of wireless Networks, Prentice Hall PTR, New Jersey, 2002.
[21] V. D. Park and M. S. Corson, “A highly adaptive distributed routing algorithm for mobile wireless networks,” IEEE INFOCOM, Apr. 1997, pp. 1405-1413.
[22] G. Pei, M. Gerla, and T. W. Chen, "Fisheye state routing: a routing scheme for ad hoc wireless networks," IEEE Int. Conf. on Communications, 2000, vol.1, pp. 70-74.
[23] C. E. Perkins and P. Bhagwat, “Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers,” ACM SIGCOMM, Sep. 1994, pp. 234-244.
[24] C. E. Perkins and E. M. Royer, "Ad-hoc on-demand distance vector (AODV) routing," 2nd IEEE Workshop on Mobile Computing Syst. and Application., Feb. 1999, pp. 90-100.
[25] C. E. Perkins and E. M. Royer, “RFC3561: Ad hoc on-demand distance vector (AODV) routing,” Internet RFCs, Jul. 2003.
[26] H. Raza, P. Nandal, and S. Makker, "Selection of cluster-head using PSO in CGSR protocol," Int. Conf. on Methods and Models in Computer Science (ICM2CS), 2010, pp. 91-94.
[27] K. P. Wang, L. Huang, C. G. Zhou, and W. Pang, "Particle swarm optimization for traveling salesman problem," Int. Conf. on machine learning and cybernetics, 2003, Vol.3, pp. 1583-1585.
[28] X. Xiang, Z. Zhou, and X. Wang, "Robust and Scalable Geographic Multicast Protocol for Mobile Ad-hoc Networks," IEEE Int. Conf. on Computer Communications, 2007, pp. 2301-2305.
[29] K. Xu, X. Hong, and M. Gerla, "An ad hoc network with mobile backbones," IEEE Int. Conf. on Communications, 2002, vol.5, pp. 3138-3143.
[30] The UCB/LBNL/VINT Network Simulator-ns (Version 2). VINT Project. Available: http://www.isi.edu/nsnam/ns/
電子全文 Fulltext
本電子全文僅授權使用者為學術研究之目的,進行個人非營利性質之檢索、閱讀、列印。請遵守中華民國著作權法之相關規定,切勿任意重製、散佈、改作、轉貼、播送,以免觸法。
論文使用權限 Thesis access permission:自定論文開放時間 user define
開放時間 Available:
校內 Campus: 已公開 available
校外 Off-campus: 已公開 available


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

QR Code