在隨意式無線網路上針對目的端移動所作的路徑維護 方宇綸、林浩仁
E-mail: [email protected]
摘 要
由於掌上型電腦(PDA)和筆記型電腦的快速成長，無線網路對現今之電腦及通訊業而言，成為一項極 重要的觀念及技術。
而AD HOC NETWORKS是一種完全經由無線連結的行動節點所建構而成，是無基礎建 設(INFRASTRUCTURELESS)及 無集中式管理的無線網路，主要提供不限量的用戶，能隨時架設無線通訊 網路，每個節點都具備繞送(ROUTING)的功能
，並且能尋找(DISCOVERY)和維護(MAINTENANCE)這繞送資 訊。但移動的節點會改變網路的拓撲，因此要選擇一適合 的繞徑協定(ROUTING PROTOCOL)，來為移動的 節點尋找一溝通的路徑。由此可知，繞徑協定扮演一個很重要的角色
。 近年來，有許多學者致力於研究AD HOC NETWORKS的繞徑協定，如AODV[4]、DSR[5]等皆是。另外，在 其中考量 備份繞徑(BACKUP ROUTE)與多重繞徑(MULTIPLE ROUTE)的方法也陸續被提出。但大部分都是針 對中間的節點移動時 來做探討，卻忽略當一連接建立好，目的端或來源端移動時對網路繞徑協定效能之 影響。本篇論文乃針對增進網路繞徑協 定的效能作探討，以受歡迎的AODV繞徑協定為基礎，考量路徑端 點(SOURCE/DESTINATION)移動的情況下，有關路 徑維護的議題，提出一個有效率的方法，在不增加額外 的OVERHEAD情況下，提高資料封包傳送率，有效的維持網路連 接。
關鍵詞 : 繞徑協定，備份繞徑，多重繞徑，隨意式無線網路，路徑維護。
目錄
第一章緒論 1.1 前言--P1 1.2 研究動機與目的--P2 1.3 論文架構--P3 第二章隨意式無線網路簡介 2.1 引言--P4 2.2 隨意式無線 網路的優缺點與主要用途--P4 2.3 隨意式無線網路的繞徑協定--P5 第三章距離向量為基礎的繞徑協定 3.1 AODV繞境協 定(AD HOC ON-DEMAND DISTANCE VECTOR ROUTING PROTOCOL)--P8 3.2 在隨意式無線網路上之備分繞境協 定(AODV-BR)--P10 3.3 在隨意式無線網路上有效率的多重繞徑協定(MNH)--P11 第四章端點移動之路徑維護方法 4.1網路拓 撲情況變動之分析--P13 4.2識別目的端移動之演算法--P14 4.3路徑修復過程--P18 4.4相關欄位設定--P20 第五章模擬與效能 評估 5.1模擬環境--P21 5.2實驗結果--P23 5.2.1隨機拓撲之效能評估--P24 5.2.2半隨機拓撲之效能評估--P27 5.2.3 四種繞徑演 算法在節點分佈稀疏與密集時之效能--P30 第六章結論--P35 參考文獻--P36
參考文獻
[ 1]E. M. ROYER AND C. K. TOH, "A REVIEW OF CURRENT ROUTING PROTOCOLS FOR WIRELESS AD HOC NETWORKS,"
IEEE PERSONAL COMMUNICATIONS, VOLUME:6, ISS. 2 , PP.46-55, APR. 1999.
[ 2]C. C. CHIANG, "ROUTING ON CLUSTERED MULTIHOP MOBILE WIRELESS NETWORKS WITH FADING CHAN -NEL,"
PROC. IEEE SICON '97, PP.197-211, APR. 1997.
[ 3]S. MURTHY AND J. J. GARCIA-LUNA-ACEVES, "AN EFFICIENT ROUTING PROTOCOL FOR WIRELESS NE -TWORKS,"
ACM MOBILE NETWORKS AND APP. J. SPECIAL ISSUE ON ROUTING IN MOBILE COMMUNICA -TION NETWORKS, PP.183-197, OCT. 1996.
[ 4]C. E. PERKINS AND E. M. ROYER, "AD HOC ON-DEMAND DISTANCE VECTOR ROUTING," MOBILE COMP -UTING SYSTEMS AND APPLICATIONS, 1999. PROCEEDINGS. WMCSA '99. SECOND IEEE WORKSHOP ON , PP.90-100, FEB. 1999.
[ 5]D. B. JOHNSON AND D. A. MALTZ, AND J. BROCH "DYNAMIC SOURCE ROUTING IN AD HOC WIRELESS NETWORKS(DSR)," MOBILE AD-HOC NETWORK WORKING GROUP, IETF INTERNET-DRAFT ,FEB. 2002.
[ 6]R. DUBE ET AL., "SIGNAL STABILITY-BASED ADAPTIVE ROUTING (SSA) FOR AD-HOC MOBILE NETWO -RKS," IEEE PERS.
COMMUN., PP.36-45, FEB. 1997.
[ 7]S. J. LEE AND M. GERLA., "AODV-BR: BACKUP ROUTING IN AD HOC NETWORKS," IN PROCEEDINGS OF THE IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE (WNMC),PP.1311-1316,2000 [ 8]M. H. JIANG AND R. H. JAN,
"AN EFFICIENT MULTIPLE PATHS ROUTING PROTOCOL FOR AD HOC NE -TWORKS," INFORMATION NETWORKING,PROCEEDINGS 15TH INTERNATIONAL CONFERENCE ON IEEE, PP. 544-549, 2001.
[ 9]C. M. CHUNG, Y. H. WANG AND C. C. CHUANG, "AD HOC ON-DEMAND BACKUP NODE SETUP ROUTING PROTOCOL,"
INFORMATION NETWORKING, 2001. PROCEEDINGS. 15TH INTERNATIONAL CONFERENCE PP. 933 -937, 2001.
[10]S. J. LEE AND M. GERLA, "SPLIT MULTIPATH ROUTING WITH MAXIMALLY DISJOINT PATHS IN AD H -OC NETWORKS,"
COMMUNICATIONS, ICC 2001. IEEE INTERNATIONAL CONFERENCE , VOLUME: 10 , PP. 3201 -3205, 2001.
[11]K. MARINA AND S. R. DAS, "ON-DEMAND MULTIPATH DISTANCE VECTOR(AOMDV) ROUTING IN AD HOC
NETWORKS," PROCEEDINGS OF THE INTERNATIONAL CONFERENCE FOR NETWORK PROCOTOLS(ICNP),RIV -ERSIDE, NOV. 2001.
[12]S. TANENBANM, "COMPUTER NETWORKS," THIRD EDITION, PRENTICE HALL.2000.
[13]W. I. KIM, D. H. KWON AND Y. J. SUH, "A RELIABLE ROUTE SELECTION ALGORITHM USING GLOBA -L POSITIONING SYSTEMS IN MOBILE AD-HOC NETWORKS," COMMUNICATIONS, 2001. ICC 2001.IEEE INTERNATIONAL CONFERENCE, VOLUME: 10, PP.3191 -3195, 2001.
[14]C. E. PERKINS, E. M. ROYER AND S. R. DAS, " AD HOC ON-DEMAND DISTANCE VECTOR ROUTING", IETF INTERNET DRAFT (WORK IN PROGRESS), JAN, 2002.
[15]K. FALL AND K. VARADHAN, "THE NS MANUAL (FORMERLY NS NOTE AND DOCUMENTATION)" APRIL, 20 -02.
(HTTP://WWW.ISI.EDU/NSNAM/NS)
