Abstract
In many scenarios, real and non-real time applications share resources and co-exist, hence there is a high requirement for improved network traffic and bandwidth management. In this paper, we have designed a model to address the problem of Quality of Service (QoS) routing and packet scheduling in multi-hop wireless networks. We have proposed a routing algorithm which is an extension of the OSPF algorithm. This algorithm considers the QoS constraints of the flow and uses the OSPF algorithm to find the shortest path satisfying the QoS constraints. If the algorithm is not able to find a route then the flow is blocked. We have also incorporated packet scheduling algorithms in our model for increased efficiency in transmitting the flows. An optimal packet length has been computed for data flows. QualNet network simulator has been used for simulating our model and we have compared the results with and without packet scheduling and we have found that the proposed algorithm outperforms traditional routing algorithms.
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 callDisclaimer: 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.
