隨意無線網路中的跳頻分時多工進出系統在干擾環境下利用多點中繼及湧泉碼之廣播規約研究

Broadcast Protocols Using Multipoint Relays And Fountain Codes for FH/TDMA Ad Hoc Networks Under Jamming Environment

彭鉦堡(Jheng-Bao Peng)

指導教授 ： 李世凱

元智大學/電機通訊學院/通訊工程學系/碩士(2011年)

https://doi.org/10.6838/YZU.2011.00261

摘要

本篇論文主要針對在隨意無線網路中多跳中繼節點的廣播規約研究。我們探討一主要廣播台的下行中繼廣播行為，廣播台的廣播封包經過湧泉編碼以利廣播行為，中繼節點採用跳頻分時多工進出FH/TDMA機制。論文中並假設網路中的干擾行為造成封包損壞分成兩種：區塊干擾及位元干擾。在區塊干擾的情況下，除了洪水機制和最佳化連結狀態路由機制外，我們提出權重連結狀態路由機制；和洪水機制相比，此機制可以減少網路中繼的重傳量；和最佳化連結狀態路由機制相比，此機制可以減少網路中繼的重傳延遲。我們提出虛擬連結的概念以對付位元干擾。模擬結果顯示我們提出的機制與概念在隨意無線網路的廣播行為上具有不錯的性能表現。

關鍵字

隨意無線網路 ； 跳頻 ； 干擾 ； 多點中繼 ； 湧泉碼 ； 廣播

並列摘要

This thesis mainly discusses the protocols for broadcasting through multihop multipoint relays in wireless ad hoc networks. A base station broadcasts packets, which are first fountain encoded, downlink to all ad hoc nodes through multipoint relays. For simplicity, the relays transmit their packets according to the schedule of FH/TDMA. We assume two jamming cases which cause packet damaged. One is block jamming and the other is bit jamming. Besides the well-known flooding protocol and the optimized link state routing (OLSR) protocol under block jamming, we propose a weighted link state routing protocol. Compared with the flooding protocol, the proposed protocol can effectively decrease the total number of retransmitted packets sent by the relays in the network. Compared with the OLSR protocol, the proposed protocol can effectively decrease the retransmission delay in average for all nodes in the network. Under bit jamming, we propose the concept of virtual link to achieve higher resisting ability to jamming and hence lower number of retransmitted packets in the network. Simulation results verify our proposed ideas which provide good performance in the wireless ad hoc network.

並列關鍵字

Multipoint Relays ； Fountain Codes ； Broadcast ； Ad Hoc Networks ； FH/TDMA ； Jamming

參考文獻

[2] Franc﹐ois Ingelrest and David Simplot-Ryl, Ivan Stojmenovi’,“Broadcasting in Hybrid Ad Hoc Networks”, IEEE Communications, Jan. 2005

[3] K. M. Alzoubi, P. J. Wan, and O. Frieder. New distributed algorithm for connected dominating set in wireless ad hoc networks. Proc. HICSS-35,2002

[4] G. Calinescu, I. Mandoiu, P. J. Wan, and A. Zelikovsky. Selecting for-warding neighbors in wireless ad hoc networks. Proc. ACM DIALM’2001,pp. 34–43, Dec. 2001.

[5] R. Bruno, M. Conti, and E. Gregori, “Mesh Networks: Commodity Multihop

[6] Thomas Clausen and Philippe Jacquet “Optimized Link State Routing Protocol”, Internet Draft 03, 2003