A Dynamic On-demand Multicast Routing Protocol for Adjusting Mesh Size in a Wireless Ad Hoc Network

碩士 === 國立臺灣科技大學 === 資訊管理系 === 91 === A wireless ad hoc network is characterized by the highly-dynamic topology with limited bandwidth, memory, and power. How to design an efficient routing protocol in this environment is a challenge. Most prior works in a wireless ad hoc networ...

Full description

Bibliographic Details
Main Authors: Yang Tso Shih, 楊左詩
Other Authors: 賴源正
Format: Others
Language:zh-TW
Published: 2003
Online Access:http://ndltd.ncl.edu.tw/handle/84908559212047271718
Description
Summary:碩士 === 國立臺灣科技大學 === 資訊管理系 === 91 === A wireless ad hoc network is characterized by the highly-dynamic topology with limited bandwidth, memory, and power. How to design an efficient routing protocol in this environment is a challenge. Most prior works in a wireless ad hoc network focused on developing an unicast routing protocol. However, recently multicast routing becomes an important issue because the applications using this technique become popular. As a result, several multicast routing protocols in ad hoc networks have been proposed. Among these proposed multicast routing protocols, ODMRP(On Demand Multicast Routing Protocol) has the best performance. Therefore, we modify ODMRP and propose a Dynamic On-demand Multicast Routing Protocol, called D-ODMRP. It can appropriately adjust mesh size depending on whether the network state is stable or not. For reducing overhead and packet delivery latency, the multicast source adopts a dynamic broadcasting mechanism against the rapid change of network topology. We compare the performance of D-ODMRP and ODMRP through NS-2. Regardless of any load, D-ODMRP can achieve high packet delivery ratio as ODMRP, while the former has a less overhead than the latter. In high loaded case, D-ODMRP has the shortest packet delivery latency. These simulation results show that D-ODMRP has the better performance than ODMRP.