Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
| Hi-index | 0.00 |
A mobile ad hoc network (MANET) is a collection of self-organized mobile nodes that are capable of communicating with each other without the aid of any established infrastructure or centralized administration. Routing algorithm has been a challenge task in the wireless ad hoc network for a long time due to the dynamic nature of network topology. A recent trend in ad hoc network routing is the reactive on-demand philosophy where routes are established only when required. The on-demand routing protocol for ad hoc network is appealing because of its low routing overhead and its effectiveness when the frequency of route reestablishment and the demand of route queries are not high. However, considering the increasing demand of Quality-of-Service (QoS) requirements in many applications, the current on-demand routing protocols used for ad-hoc network should be adapted appropriately to effectively meet the stringent QoS requirements of specific multimedia traffic. This work thus proposes a routing protocol wherein an adaptive backup route maintenance algorithm and a prediction-based congestion-avoiding alternative route construction mechanism are embedded to insure the high packet delivery for multimedia traffic in the volatile environments of a MANET. Meanwhile, a priority scheduler is used to make scheduling decisions so that the packet loss rate can be further reduced. The results of a series of simulations exhibit the practicability and feasibility of our approaches.