Abstract

An important challenge to enable real-time applications for MANETs is incorporating support for quality of service (QoS), such as delay and bandwidth constraints. To provide quality of service, extensions can be added to the AODV routing protocol while finding the route. These extensions specify the service requirements which must be met by nodes rebroadcasting a route request (RREQ) or returning a route reply (RREP) for a destination. In this paper, we propose an on demand delay and bandwidth based quality of service (QoS) routing protocol (AODV-D) to ensure that delay does not exceed a maximum value and the minimum available bandwidth is required to send the packets. Moreover, our proposed routing protocol will follow the concept of unicast-type two hop local route repair protocol to recover the lost links efficiently while increasing network reliability, increasing utilization, minimizing the number of control messages and shortening the repair delay. The protocol is implemented and simulated using Ns-2 simulator. The simulation studies were carried out for AODV_D , AODV,QS-AODV with different input parameters viz. number of Nodes, Node Mobility Speed; in the output parameters of packet delivery ratio, end-to-end delay and route life time was considered for all the above three protocols. The results have shown that the proposed algorithm AODV-D performed well when compared with AODV and QS-AODV.

Highlights

  • A Mobile ad-hoc network is one of the types of wireless communication networks and their characters and topology are different from other types of networks

  • To provide quality of service, extensions are added to the route request (RREQ) (Fig. 4), route reply (RREP) (Fig. 5) and RERR messages in addition to the extensions needed in the routing table structure of Adhoc On-demand Distance Vector (AODV) protocol (Fig. 6)

  • We review the current research on quality of service (QoS) routing algorithms in MANET

Read more

Summary

Introduction

A Mobile ad-hoc network is one of the types of wireless communication networks and their characters and topology are different from other types of networks. Stability of the route in mobile ad-hoc network is degraded due to node mobility, less signal strength, low memory, battery capacity and processing power. Node Stability mainly considers the following parameters Such as, mobility, packet transmission, battery life, and memory. This paper proposes an efficient QoS-aware routing protocol for provision of end-to-end delay guarantee in mobile ad hoc networks and evaluates the performance of the proposed algorithm by simulation taking different mobility and traffic patterns. The protocol modifies and extends QS-AODV (Lajos Hanzo, Rahim Tafazolli, 2011) to discover a route with least traffic and maintain the required QoS delay constraint throughout the communication process This algorithm selects routes with least traffic and follows alternate route method for route maintenance. The rest of this paper is organized as follows.: An overview of the Previous Research, Proposed Qos Aware Routing Algorithm based on delay and bandwidth estimation, simulations, results and the final section of the paper provided with conclusion and future work

Previous Research
Proposed Qos Aware Routing Algorithm based on delay and bandwidth estimation
Calculation of the Node Traversal Time
Route Discovery Process
Efficient Two Hop Local Route Repair Mechanism
Pseudocode of Route Maintenance
Results
Conclusion
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.