Sign inSubmit
computersciencejournal.org is not ours. This journal is published only at thescipub.com/jcs. Report a suspicious emailcomputersciencejournal.org is not ours · Report
ArticleMetrics
Research Article · Free to read · Published 7 March 2011

An Effective Contention Aware Stable Path Finding Approach to Provide Quality of Service in Mobile Ad hoc Networks

D. S. Thenmozhi & M. Rajaram

Journal of Computer Science, Volume 7, Issue 3, pp. 352–358 · doi.org/10.3844/jcssp.2011.352.358

6,740 accesses4,952 downloads0 citations (Crossref)Metrics
Cite Check for updates

Abstract

Problem statement: The application of Mobile Ad hoc NETworks (MANETs) has been increasing every day. Most applications that attract interest for use in current wired networks (e.g. video conferencing, on line movies and camera enabled instant messenger) would attract interest for MANETs also. Many applications that use MANETs include multimedia data that require Quality of Service (QoS) support for effective transmission. Basically meeting QoS is a mesh of multiple parameters. QoS routing based on multiple independent constraints has been proven to be NPcomplete. Hence, hardly any exact algorithms were proposed for this kind of problems. In this study we propose a new approach for QoS routing based on multiple constraints. Approach: QoS support can be achieved by finding a route satisfying the application requirements. This needs an admission control along the route to prevent new flows from consuming too many resources and disrupting the guarantees made to existing flows. In our work, the normal AODV is extended to perform QoS routing based on bandwidth requirement and link stability constraints. Link stability parameter is considered in an opportunistic way so that effective path meeting the required bandwidth and will last for complete session is established. Results: Simulation results show that our contention aware, link stability based route finding technique performs better than AODV in terms of throughput and control message overhead. It improves packet delivery ratio greatly without affecting the overall end-to-end throughput of existing flows. Conclusion: This multi constraint based AODV performs path finding with less overhead by adopting passive approach of listening to the medium. Hierarchical treatment of the metrics enables QoS robustness hence reduces subsequent route finding latency.

Licence and reuse

Free to read. This article carries the publisher’s copyright, as printed on it: © 2011 Science Publications. It is free to read; ask us before reusing it.

How to reuse this article

Responses (0)

Have a comment on this research? Sign in to respond. Responses are moderated and published with your name and affiliation; the authors are invited to reply. How we use your dataWrite a response

About this article

Cite this article

Thenmozhi, D. S. & Rajaram, M. (2011). An Effective Contention Aware Stable Path Finding Approach to Provide Quality of Service in Mobile Ad hoc Networks. Journal of Computer Science, 7(3), 352–358. https://doi.org/10.3844/jcssp.2011.352.358

Licence
© Science Publications
Issue
Volume 7, Issue 3
Policies
Editorial independenceUse of generative AIData availabilityAppeals and complaints
Version
Version of record
An Effective Contention Aware Stable Path Finding Approach to Provide Quality of Service in Mobile Ad hoc NetworksJournal of Computer Science · Volume 7, Issue 3 · pp. 352–358 · © Science PublicationsDownload