| المستخلص: |
Mobile Ad hoc Networks (MANETs) are popular wireless technology that grows rapidly in wide range of applications and commercial network devices. These networks suffer from complexity and dynamic topology, so their development faces several challenges among which is the routing process. Many routing algorithms have been proposed for Ad hoc networks. Reactive routing protocols are popular and preferred in the wireless networks because of their less control overhead and scalability, but they suffer from frequent link breakages due to the high-mobility of the nodes. In order to reduce the link breakages that result in more route losses, more control overhead and more consumption of network resources, a new scheme for reactive routing protocol is proposed to get a more stable traffic route. Tree-based mobility-aware routing algorithm based on the well-known Ad-hoc On demand Distance Vector routing protocol (AODV) is proposed: Mobility and Direction Aware Ad-hoc On Demand Distance Vector routing protocol (MDA-AODV) is an attempt to improve the handling of mobility and direction factors in ad-hoc networks. MDA-AODV restricts the route discovery process to a specific group of nodes whose speed values are less than a specific threshold. In the route reply process MDA-AODV selects the best path, through which requests were received, depending on the speed of the participating nodes and their directions. This technique lays the foundation of the MDA-AODV protocol. Qualnet simulator version 7.1, using three offered load simulations (density, packet-rate and CBR connections), was used to investigate the effect and the advantages of MDA-AODV over AODV routing protocol. The simulation results show that, the proposed scheme decreases the consumed energy by (0.35 - 0.75 %). It also accomplishes (37 - 44 %) lower route losses compared to AODV. The delivery ratio is increased by (8.5 - 47 %). Control overhead and end-to-end delay of the proposed protocol is also comparable to that of AODV.
|
