無線隨意網路下資料傳遞不間斷的傳遞架構之研究

無線隨意網路 - 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%。

關鍵字

無線隨意網路； Ad-Hoc Network ； Backup Routing ； Co-channel interference ； Continued-transmission

並列摘要

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.

並列關鍵字

Ad-hoc Network ； Back Routing ； on-demand routing ； co-channel interference ； Continued-transmission

參考文獻

[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.

[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

國際替代計量

無線隨意網路下資料傳遞不間斷的傳遞架構之研究

全文下載

主題瀏覽