We apologize for a recent technical issue with our email system, which temporarily affected account activations. Accounts have now been activated. Authors may proceed with paper submissions. PhDFocusTM
CFP last date
20 November 2024
Call for Paper
December Edition
IJCA solicits high quality original research papers for the upcoming December edition of the journal. The last date of research paper submission is 20 November 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

Article:Highly Ensured QOS Routing in Mobile Ad Hoc Networks Based on Multiple Constraints

by D.S. Thenmozhi, Dr. R. Lakshmipathi
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 8 - Number 4
Year of Publication: 2010
Authors: D.S. Thenmozhi, Dr. R. Lakshmipathi
10.5120/1199-1702

D.S. Thenmozhi, Dr. R. Lakshmipathi . Article:Highly Ensured QOS Routing in Mobile Ad Hoc Networks Based on Multiple Constraints. International Journal of Computer Applications. 8, 4 ( October 2010), 23-29. DOI=10.5120/1199-1702

@article{ 10.5120/1199-1702,
author = { D.S. Thenmozhi, Dr. R. Lakshmipathi },
title = { Article:Highly Ensured QOS Routing in Mobile Ad Hoc Networks Based on Multiple Constraints },
journal = { International Journal of Computer Applications },
issue_date = { October 2010 },
volume = { 8 },
number = { 4 },
month = { October },
year = { 2010 },
issn = { 0975-8887 },
pages = { 23-29 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume8/number4/1199-1702/ },
doi = { 10.5120/1199-1702 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T19:56:37.758364+05:30
%A D.S. Thenmozhi
%A Dr. R. Lakshmipathi
%T Article:Highly Ensured QOS Routing in Mobile Ad Hoc Networks Based on Multiple Constraints
%J International Journal of Computer Applications
%@ 0975-8887
%V 8
%N 4
%P 23-29
%D 2010
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Routing protocols for mobile ad hoc networks have been explored extensively in the past years. Most of the work is aimed at finding a shortest path between the source and the destination, without considering the network performance influencing factors like present network traffic, movements and application requirements etc. In the present world many applications that involve Mobile Ad hoc NETworks (MANETs) contain multimedia data that require Quality of Service (QoS) support for effective transmission. Basically meeting QoS is a mesh of multiple parameters. Many research works so far concentrated QoS routing based on single constraint only. QoS routing based on multiple constraints has been proven to be NP-Complete. Hence, hardly any exact algorithms were proposed for this problem. In this paper a new approach for QoS routing is given based on multiple constraints. In MANETs routing based on Ad hoc On Demand Distance Vector (AODV) protocol provides efficient route establishment between nodes with minimal control overhead and reduced route acquisition latency. In this paper the normal AODV is extended to perform QoS routing based on bandwidth requirement and link stability constraints. Simulation results show that QoS performance of extended AODV is improved in the considerable manner.

References
  1. Z. Fan, “QoS routing using lower layer information in ad hoc networks,” in Proc. Personal, Indoor and Mobile Radio Communications Conf., pp. 135-139, Sep. 2004.
  2. Y. Yang and R. Kravets, “Contention-aware admission control for ad hoc networks,” IEEE Trans. Mobile Comput., vol. 4, pp. 363-377, Aug 2005.
  3. L. Hanzo and R. Tafazolli, “ A Survey of QoS Routing Solutions for Mobile Ad Hoc Networks,”IEEE Communications Surveys, vol. 9, No. 2, 2nd Quarter, 2007.
  4. C. E. Perkins and E. M. Royer and S. R. Das, ”Ad Hoc on Demand Distance Vector (AODV) Routing,” Internet Draft, draft-ietf-manet-aodv-08.txt, 2001.
  5. Kishor S. Trivedi, “Probability and Statistics with Reliability, Queueing and Computer Science Applications,” PHI, 2005.
  6. C. Perkins and P. Bhagwat, “Highly dynamic destination sequenced distance vector routing (DSDV) for mobile computers,” in Proc. ACM SIGCOMM'94, pp. 234-244.
  7. I. Rubin and Y.C. Liu, “Link stability models for QoS ad hoc routing algorithms,” in Proc. 58th IEEE Vehicular Technology Conf., Vol. 5, pp. 3084-3088, Oct. 2003.
  8. S. Singh, M. Woo, and C.S. Raghavendra, “Power-aware routing in mobile ad hoc networks,” in Proc. Int. Conf. Mobile Computing and Networking, pp. 181-190, 1998.
  9. F. Kuipers and P. VanMieghem, “Conditions that impact the complexity of QoS routing,” IEEE/ACM Trans. Networking, vol 13, no. 4, pp. 717-730, 2005.
  10. D.S. Thenmozhi and R. Lakshmipathi, “Quality of Service Enhanced Routing in Mobile Ad hoc Networks,” IJCSIS, Vol 8, No. 5, pp. 34-40, 2010.
  11. S. Murthy and J. J. Garcia-Luna-Aceves, ”An efficient routing protocol for wireless networks,” ACM Mobile Networks Applicat. J., Special Issue on Routing in Mobile Communication Networks,1996.
  12. V. D. Park and M. S. Corson, “A Highly adaptive distributed routing algorithm for mobile wireless networks,” in Proc. IEEE INFOCOM'97, pp. 1405-1413.
  13. D. Johnson and D. Maltz, “Dynamic source routing in ad hoc wirelesss networks,” Mobile Computing. E. Imielinski and H. Korth, Eds. Norwell, MA. Kluwer, 1996.
  14. C. K. Toh, “Associativity-based routing for ad hoc mobile networks,” Wireless Personal Commun., vol. 4, pp. 103-139,1997.
  15. Z. J. Haas and M. R. Pearlman, “The performance of query control schemes for the zone routing protocol,” in Proc. IEEE Symp. Computers and Communication, 1998.
  16. S. McCanne, S. Floyd, S. Fall, K. Varadhan: The Network Simulator NS2 (1995). The VINT Project, available at http://www.isi.edu/nsnam/ns.
Index Terms

Computer Science
Information Sciences

Keywords

Quality of Service bandwidth estimation contention link stability random destination statistical approach multi-constraint simulations

Powered by PhDFocusTM