行動隨意網路(MANET)因為是隨意的動態網路架構，所以傳送端(Source Node)如何以快速、安全及有效率的使用網路資源將訊息傳送到目的端(Destination Node)會是一大考驗。而所有傳送端到接收端的傳送路徑找尋，均藉由廣播的方式來取得，也因此在不同的MANET網路條件及運用下，選擇適合的廣播協定就相當重要了。
本文就行動隨意網路在廣播協定運用所遭遇的問題作探討並對各典型的廣播協定作分類並選取個別演算法作深入介紹；分別有簡單氾濫廣播法、距離可調整的廣播協定(Distance Adaptive Broadcasting for Ad Hoc Networks- DAD)、相對位階可調整的廣播協定Relative Degree Adaptive Flooding Broadcasting Algorithm (RDAB)、以第一相鄰節點(1 Hop)叢集並選取適合的閘門節點的演算法、可調適廣播演算法 (Scalable Broadcast Algorithm(SBA))及鄰居節點及延遲時間可調適廣播演算法 (Flooding based on One hop Neighbor Information and Adaptive Holding(FONIAH))。
在各項繞徑協定中，最常使用氾濫法(flooding)的廣播來尋找目的節點，但同樣的卻也製造了大量的網路封包及流量。為解決此一問題，而有各式各樣的優化方法因此而生，但各方法均有其優點及缺點。本文除提出改良自Relative Degree Adaptive Flooding Broadcasting Algorithm (RDAB)的Enhanced廣播演算法(Enhanced RDAB)外，於結論則提出未來可能精進方向 – 觀察節點移動速度及節點密度等指標而隨時調整網路所使用的演算法，以達到最佳化廣播方式或根據運用環境，選用適合的演算法。

Mobile Ad hoc network (MANET) is a network without infrastructure. In such a network, it is challenging to send the data with an expressive, secure and effective way.

To find route from source to destination, it is necessary to broadcast message to the whole network. Therefore, it is very important to find a proper broadcasting protocol for different application of MANET.

In this thesis, we will discuss the problem encountered in the application of broadcasting protocol. The representative broadcasting protocols are classified. For each of them, we will choose and introduce specific algorithm.

Flooding is the most used routing protocol to find destination node. A lot of packets are generated by this protocol. To solve this problem, many improved methods were propounded and each one of them has its own advantage and disadvantage. In this thesis, we will discuss a protocol named RDAB (Relative Degree Adaptive Flooding Broadcasting Algorithm) and propose a new method named Enhanced RDAB. In our conclusion, we will give a direction for future improvement.

[1] Foroohar Foroozan, Kemal Tepe, “A High Performance Cluster-Based Broadcasting Algorithm for Wireless Ad Hoc Networks Based on a Novel Gateway Selection Approach”, PE-WASUN’05, page 65-70 , 2005.
[2] Yu-Chee Tseng, Sze-Yao Ni, Yuh-Shyan Chen and Jang-Ping Sheu, “The Broadcast Storm Problem in a Mobile Ad Hoc Network”, Wireless Networks 8, page 153-167, 2002.
[3] Brad Williams and Tracy Camp, “Comparison of Broadcasting Techniques Mobile Ad Hoc Networks”, MOBIHOC’02, page 194-205, June 9-11, 2002.
[4] Charles E. Perkins, Elizabeth M. Belding-Royer, and Samir R. Das, “Ad hoc On-Demand Distance Vector (AODV) Routing”, draft-ietf-manet- aodv-11.txt, June 2002(expired).
[5] R.Purtoosi, H.Taheri, A.Mohammadi and F.Foroozan, “A Light-Weight Contention-Based Clustering Algorithm for Wireless Ad Hoc Networks”, The 4th International Conference on Computer and Information Technology (CIT2 004), Wuhan, China, Sept 2004, pp.627-632.
[6] Stefan Pleisch and Mahesh Balakrishnan, Ken Birman and Robbert van Renesse,“Efficient Flooding in Mobile Adhoc Networks”, page 1-12, MobiHoc’06, May 22–25.
[7] Min Sheng, Jiandong Li and Yan Shi,“Relative Degree Adaptive Flooding Broadcast Algorithm for Ad Hoc Networks”, page 216-222, IEEE TRANSACTIONS ON BROADCASTING, VOL. 51, NO. 2, JUNE 2005.
[8] Wei Peng, Xicheng Lu, “AHBP: An Efficient Broadcast Protocol for Mobile Ad Hoc Networks”, Journal of Computer Science and Technology, March 2001, Vol.16, No.2, pp.114-125
[9] Andrew S. Tanenbaum, “Computer Networks”, Page 355-357, Prentice Hall, 4th Edition.
[10] W. Peng and X. Lu, “On the reduction of broadcast redundancy in mobile ad hoc networks,” in Proc. MOBIHOC, 2000.
[11] Dimitri Bertsekas and Robert Gallager, “Data Networks”, Page 369, Prentice Hall, 2nd Edition.
[12] Xiaohu Chen, Michalis Faloutsos, Srikanth Krishnamurthy, Distance Adaptive (DAD) Broadcasting for Ad Hoc Networks
[13] J. Sucec and I. Marsic. An efficient distributed network-wide broadcast algorithm for mobile ad hoc networks. CAIP Technical Report 248 - Rutgers University, September 2000.
[14] J. Boleng. Normalizing mobility characteristics and enabling adaptive protocols for ad hoc networks. In Proceedings of the IEEE Local and Metropolitan Area Networks Workshop (LANMAN), pages 9–12, 2001.
[15] Sung-Hee Lee and Young-Bae Ko, ”An Efficient Neighbor Knowledge Based Broadcasting for Mobile Ad Hoc Networks”, ICCS 2006, Part II, LNCS 3992, Page 1097-1100, 2006.
[16] 台灣大學 電信研究所 “A Radio-Link Adaptive Routing Protocol for Mobile Ad Hoc Networks” 2006.
[17] E.M. Royer, C.K. Toh, “A review of current routing protocol for ad hoc mobile wireless networks”, IEEE Personal Communications, April 1999.
[18] Zygmunt J. Haas, Marc R. Pearlman, and Prince Samar,“The Bordercast Resolution Protocol(BRP) for Ad Hoc Networks”, draft-ietf-manet- zone-brp-02.txt, July, 2002.
[19] R.Jurdak “Wireless Ad Hoc and Sensor Networks: A Cross-Layer Design Perspective”, Springer, 2007, Pages 75-82.
[20] 呂坤憲 “An Introduction to Mobile Ad Hoc Networks”
[21] 李世勤 “採取主動式路徑維護方法之A-AODV繞徑協定”, 台灣科技大學電子所，2004, Pages 16-17
[22] Zygmunt J. Haas, Marc R. Pearlman, and Prince Samar, “The Zone Routing Protocol(ZRP) for Ad Hoc Networks”, draft-ietf-manet-zone-zrp-04.txt, July, 2002.
[23] Zygmunt J. Haas, Marc R. Pearlman, and Prince Samar, “The Intrazone Routing Protocol(IARP) for Ad Hoc Networks”, draft-ietf-manet-zone-zrp-04.txt, July, 2002.
[24] Zygmunt J. Haas, Marc R. Pearlman, and Prince Samar, “The Interzone Routing Protocol(IERP) for Ad Hoc Networks”, draft-ietf-manet-zone-zrp-04.txt, July, 2002.
[25] Zygmunt J. Haas, Marc R. Pearlman, and Prince Samar, “The Bordercast Resolution Protocol(BRP) for Ad Hoc Networks”, draft-ietf-manet- zone-brp-02.txt, July, 2002.
[26] C. Siva Ram Murthy and B. S. Manoj, “Ad Hoc Wireless Networks-Architectures and Protocols”, Prentice Hall, 2004.
[27] Gang Ding, Zafer Sahinoglu, Philip Orlik, Jinyun Zhang, and Bharat Bhargava, “Tree-Based Data Broadcast in IEEE 802.15.4 and ZigBee Networks”
[28] Mashud Kabir, “Region-Based Adaptation of Diffusion Protocols in MANETs”, 2003, Page 17.