| Summary: | 碩士 === 國立中興大學 === 資訊科學研究所 === 90 === An Ad-Hoc network is a collection of wireless mobile hosts that can dynamically organize into a wireless network without the support of any infrastructure or centralized administration such as the base stations. The data transmission in Ad-Hoc networks can be achieved via the nearby mobile hosts interchanging message information. Routing is a very important key research issue in Ad-Hoc wireless network. Under the identity and limited resources of Ad-Hoc wireless network such as move arbitrarily, limited network bandwidth, limited memory capacity and limited battery power, the efficiency of routing schemes in Ad-Hoc wireless networks become more important and challenging than in traditional networks. Much research has been done on designing Ad-Hoc routing protocols and some well known protocols are also being implemented in practical situations. However, one major drawback in existing state-of-the-art protocols, such as the AODV routing protocol, is the time-varying nature of the wireless channels among the mobile hosts is ignored. This is a serious design drawback because the varying channel quality can lead to very poor overall route quality, in turn result in low data throughput. We propose a new Ad-Hoc routing algorithm that dynamically change the routing paths according to the channel conditions. Extensive simulation results indicate that our proposed protocol are more efficient.
|
|---|
