在一個無線行動隨建即連網路上，對網路上的各個點廣播訊息是經常發生的。一個有效的廣播通訊協定要能幫助訊息快速及可靠的散播而且要能降低多餘的再廣播。 在這篇論文當中，我們提出了三個廣播排程協定，一個是中央集中排程的協定，它需要知道整個網路各點的拓撲。其它二個是分散式的排程，他們只需要知道附近鄰居的資訊。其中一個是適用於比較靜態的網路，另一個可用於動態的網路。我們所提出的三個廣播排程協定都可以降低再廣播的比例而且能快速地完成廣播的動作。前二個協定能達到百分之百的收到率，第三個協定也有良好的收到率。在我們的論文中,我們將所提出的廣播排程協定與其它的協定就再廣播的比例、收到率及平均完成廣播的時間作詳細的比較、分析及討論。 In this thesis, we consider the issue of broadcasting protocols in a mobile ad hoc network (MANET). The objective of a broadcasting protocol is to deliver the broadcasted message to all network nodes. Flooding in MANET has poor performance because it leads to se-rious packets collision, contention, and redundancy, which results in the waste of limited network bandwidth. Our goal is to design broadcasting protocols to improve the broadcast performance. In this thesis, we propose three broadcasting protocols, one is centralized protocol and two are distributed ones. In the three protocols, we use two basic schemes, the ”set-covering” scheme and ”independent-transmission-set” scheme, to choose the relay nodes and arrange a proper transmission sequence for each node. In the centralized proto-col, we assume the topology of the network is known in advance. The centralized protocol runs at source node and has a collision-free broadcast schedule. In the two distributed pro-tocols, one is used for low mobility and the other one is used for topology changing rapidly. We assume each node having the knowledge of its two-hop neighbors in both distributed protocols. Simulation results show that the proposed broadcasting protocols can decrease a great deal of redundant forwarding packets to save the limited network bandwidth
