淡江大學覺生紀念圖書館 (TKU Library)
進階搜尋


下載電子全文限經由淡江IP使用) 
系統識別號 U0002-2606200709385900
中文論文名稱 無線隨意網路下資料傳遞不間斷的傳遞架構之研究
英文論文名稱 The architecture of data continued-transmission in mobile Ad-Hoc Networks
校院名稱 淡江大學
系所名稱(中) 資訊管理學系碩士班
系所名稱(英) Department of Information Management
學年度 95
學期 2
出版年 96
研究生中文姓名 劉柏秀
研究生英文姓名 Po-Hsiu Liu
學號 693521196
學位類別 碩士
語文別 中文
口試日期 2007-06-09
論文頁數 43頁
口試委員 指導教授-李鴻璋
委員-劉艾華
委員-金力鵬
委員-廖岳祥
中文關鍵字 無線隨意網路  Ad-Hoc Network  Backup Routing  Co-channel interference  Continued-transmission 
英文關鍵字 Ad-hoc Network  Back Routing  on-demand routing  co-channel interference  Continued-transmission 
學科別分類 學科別社會科學管理學
學科別社會科學資訊科學
中文摘要 無線隨意網路 - Mobile Ad-Hoc Networks(MANETs)是由一群無固定基礎建設的行動通訊裝置集合而成,由於沒有固定的無線網路基礎建設,在傳遞資料上便顯得比較困難。而隨選路由通訊協定(On-Demand Routing Protocol)與表格驅動路由通訊協定(Table-Driven Routing Protocol)是二種有效的尋找路徑方法,Ad-hoc On-Demand Distance Vector Routing(AODV)、Dynamic Source Routing(DSR)、DSDV(Destination-Sequenced Distance-Vector Routing)與ZRP(Zone Routing Protocol)都是其中最具代表性的方法。然而,不論是隨選路由通訊協定或是表格驅動路由通訊協定都是專注在如何獲得有效的路由路徑,卻忽略了當路由失效時,重建路徑所浪費的時間與資源。
因為在無線隨意網路下裝置會隨意的移動,所以網路的拓樸會時常變化、一直的變化,也因此路由失效的機率將增加,使得路徑重建的次數也隨之升高,因此所浪費的路由重建時間與封包的傳遞是相當可觀的。而且當傳遞的資料是即時性的資料(Real time data)型態時,也會因為延遲時間的長短而出現問題,所以當傳遞資料時,中斷再傳遞的情形在無線隨意網路下常常發生,卻不是每種資料型態都可以接受的。
本文提出一種以預防性的備用路由(Backup Routing)方式,推測傳輸路由可能將要中斷或是Delay,而在中斷或Delay之前預先找好另一條路由路徑,並在發生中斷之前,改變原先的傳遞路徑到已經找到的備用路徑以達到資料的持續傳輸。經研究發現,同樣在五十個裝置而且通訊範圍是五十公尺的情況下,傳遞不斷訊的時間增加了47%,在通訊範圍增加至一百公尺時,傳遞不間斷的通訊時間增加53%,在通訊範圍增加至一百五十公尺時,傳遞不間斷的通訊時間增加63%。
英文摘要 In Mobile Ad Hoc Networks, On-Demand Routing Protocols are effective routing protocols. Ad-hoc On-Demand Distance Vector Routing (AODV) [1], Dynamic Source Routing (DSR)[2] , DSDV(Destination-Sequenced Distance-Vector Routing) and ZRP(Zone Routing Protocol)are the most typical methods.
These methods are focus on how the routing path to find but ignore that when the routing path is invalid, the resource wasted in rerouting is very much, and may cause a delay. When we transmit important data packets, high transmission performance is necessary. So if we know the tolerance of the important data packets, we have to prevent the broken occur as best as we can.
We provide a scheme, back routing on-demand, to prevent and delay or broken and search a new routing path On-Demand in advance. Before delay or broken, we can change the routing path in advance and expect to continue transmitting. And the scheme can extend the transmission time to not to break and improve the total transmission time. When the communication distance is 50 meters and total nodes are 50, the transmission time improves 47%. Extend to 100 meters, it improves 53% and it improves 63% when the one-hop distance extends to 150 meters. When the nodes increase, the transmission time improves better.
論文目次 目 錄
一、緒論 1
1.1. 研究背景與動機 1
1.2. 研究目的 10
1.3. 研究架構 10
二、文獻探討 11
2.1. AD-HOC ON-DEMAND DISTANCE VECTOR ROUTING(AODV) 14
2.2. DYNAMIC SOURCE ROUTING(DSR) 18
2.3. AODV與DSR之比較 22
三、實驗方法 25
3.1. 路由探索階段 25
3.2 資料傳遞階段 26
四、模擬與分析 30
五、結論 38
REFERENCE 40

圖 目 錄
圖 1. 主從式無線區域網路 2
圖 2. 無線隨意網路架構 3
圖 3. PROGAGATION OF RREQ IN AODV 16
圖 4. REVERSE PATH FORMATION. 17
圖 5. PATH OF THE RREP TO THE SOURCE IN AODV 17
圖6. BUILDING OF THE ROUTE RECORD DURING ROUTE DISCOVERY. 21
圖 7. PROGAGATION OF THE ROUTE REPLY WITH THE ROUTE RECORD. 21
圖 8. ROUTING DISCOVERY IN OTR. 26
圖 9. REROUTING. 28
圖 10. 較短的REROUTING PATH. 30
圖 11. 50 NODES IN 1000*1000 METERS 32
圖 12. 80 NODES IN 1000*1000 METERS. 33
圖 13. 100 NODES IN 10000*1000 METERS. 34
圖 14. COMMUNICATION DISTANCE IS 50 METERS. 35
圖 15. COMMUNICATION DISTANCE IS 100 METERS. 36
圖 16. COMMUNICATION DISTANCE IS 150 METERS. 36

表 目 錄
表 1. DSR與AODV的比較 23
表 2. THE TOLERANCE OF THE VOICE COMMUNICATION USERS 27
表 3. THE ACTION AFTER NODES SENDING OR RECEIVING 29
表 4. 模擬參考一覽表 31
參考文獻 [1]A. Boukerche ,“A Performance Comparison of Routing Protocols for Ad Hoc Networks.”
[2]C.-C. Chiang, “Routing in Clustered Multihop, Mobile Wireless Networks with Fading Channel”, In Proceedings of IEEE SICON 1997, April. 1997, pp. 197-211.
[3]C. E. Perkins and E. M. Royer, “Ad-hoc On-Demand Distance Vector Routing”, In Proceedings of 2nd IEEE Workshop on Mobile Computing System And Applications, February 1999, pp. 90-100.
[4]C.E. Perkins and P. Bhagwat, “Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers”, In Proceedings of the SIGCOMM 1994 Conference on Communications Architectures, Protocols and Applications, August 1994, pp. 234-244
[5]D. B. Johnson and D. A. Maltz, “Dynamic Source Routing in Ad Hoc Wireless Networks"
[6]E. M. Royer and C-K. Toh, “A Review of Current Routing Protocols for Ad Hoc Mobile Wireless Networks”, IEEE Personal Communications, April 1999, pp. 46-55
[7]Internet Engineering Task Force Mobile Ad hoc Networks Working Group Charter, Chaired by Joseph Macker and M. Scott Corson, http://www.ietf.org/html.charters/manet-charter.html
[8]J. Broch, David A. Maltz, David B. Johnson, and Jorjeta Jetcheva. “A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols,” in Proc.Mobicom'98, 1998
[9]J. Broch, D. B. Johnson, and D. A. Maltz, “The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks.”
[10]J.C. Chuang and N.R.Sollenberger, “Performance of Autonomous Dynamic Channle Assignment and Power Control for TDMA/FDMA wireless Access,” IEEE JSAC,vol.12,no.8,Oct. 1994.
[11]Murthy and J. J. Garcia-Luna-Aceves, “An Efficient Routing Protocol for Wireless Networks,” ACM Mobile Networks and App. J., Special Issue on Routing in Mobile Communication Networks, Oct. 1996, pp. 183–97.
[12]Nasipuri, R. Burleson, B. Hughes, and J. Roberts. “Performance of a Hybrid Routing Protocol for Mobile Ad Hoc Networks”, In IEEE International Conference on Computer Communication and Networks (ICCCN2001), Phoenix, AZ, October 2001, pp. 296-302.
[13]P. Johansson, T. Larsson, N. Hedman, B. Mielczarek, and M. Degermark. "Scenario-based Performance Analysis of Routing Protocols for Mobile Ad-hoc Networks", Mobicom, August 1999.
[14]P.O. Huang, Y.S. Chen and C.Y. Chang “Dynamic Channel Assignment and Reassignment for Exploiting Channel,” In Journal of Information, Technology, and Society, 2001 pp. 41-58.
[15]Shih-Lin Wu,Yu-Chee Tseng, and Jang-Ping Sheu, "Intelligent Medium Access for Mobile Ad Hoc Networks with Busy Tones and Power Control." IEEE Journal on Selected Areas in Communications, Vol.18,No.9,Sep. 2000
[16]S. R. Das, C.E. Perkins, and E. M. Royer "Performance Comparison of Two On-demand Routing Protocols for Ad Hoc Networks", Infocom, March 2000
[17]王致龍, “Cost Evaluation for supporting voice calls in dual-mode wireless communication networks with multicasting” 2006.
[18]Wireless LAN Medium Access Control (MAC) and Physical Layer(PHY) Specifications , ISO/IEC 8802-11:1999(E) , ANSI/IEEE Std802.11 1999 edition , Aug. 1999.
[19]Internet Engineering Task Force Mobile Ad hoc Networks Working Group Charter, Chaired by Joseph Macker and M. ScottCorson.
http://www.ietf.org/html.charters/manet-charter.html.
論文使用權限
  • 同意紙本無償授權給館內讀者為學術之目的重製使用,於2007-07-03公開。
  • 同意授權瀏覽/列印電子全文服務,於2007-07-03起公開。


  • 若您有任何疑問,請與我們聯絡!
    圖書館: 請來電 (02)2621-5656 轉 2281 或 來信