IDEAS home Printed from https://ideas.repec.org/a/jbh/ijsrcs/v2y2017i4idhcseit1172486.html

MultPath Routing Algorithm for Multi-Constrained QoS Routing in MANETs

Author

Listed:
  • K. Uday Kumar Reddy
  • P. Gnanedra Kumar
  • M. Rudra Kumar

Abstract

Vehicular ad hoc networks (VANETs) is an emerging technology which has received lot of attention due to its potential to improve vehicle and road safety, traffic control, efficiency as well as convenience for users. VANET is a sub category of mobile ad hoc network (MANET). A lot of research in VANET is done on routing, broadcasting, Quality of Security (QoS) and security. This paper proposes a novel path planning algorithm for efficient routing. The proposed system will traditionally distribute the work load over alternate paths in order avoid congestion and reduce travel cost. It will also ensures reliable routing with less bandwidth requirement and high packet delivery ratio as it avoids packet loss. VANET may be affected by attacks on routing leading to altering messages and routes which will affect QoS parameters. The proposed algorithm will deal with providing security measures over the routing process. Therefore we obtain routing algorithm subject to multiple QoS constrains for secure VANET communication.

Suggested Citation

  • K. Uday Kumar Reddy & P. Gnanedra Kumar & M. Rudra Kumar, 2017. "MultPath Routing Algorithm for Multi-Constrained QoS Routing in MANETs," International Journal of Scientific Research in Computer Science, Engineering and Information Technology, International Journal of Scientific Research in Computer Science, Engineering and Information Technology, vol. 2(4), pages 632-636, August.
    • Handle: RePEc:jbh:ijsrcs:v2:y2017:i4:id:hcseit1172486
    Note: Article URL: https://ijsrcseit.com/CSEIT1172486
    as

    Download full text from publisher

    File URL: https://ijsrcseit.com/CSEIT1172486
    File Function: Article URL
    Download Restriction: no
    File URL: https://ijsrcseit.com/paper/CSEIT1172486.pdf
    File Function: Full text
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:jbh:ijsrcs:v2:y2017:i4:id:hcseit1172486. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Pankaj Sharma (USA) (email available below). General contact details of provider: https://ijsrcseit.com/home .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.