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

Optimum Routing for AODV for Secure Mobility and Distributed Services

Author

Listed:
  • N. Sathishkumar

Abstract

Cellular networks are expected to provide distributed services and broadband access to a continuously growing number of mobile users. An cost effective solution to Internet broadband access for both stationary is must for mobile hosts. To efficiently support the large number of customers in the network, the network is expected to support distributed services. Unfortunately, present networks do not support network services because of the absence of a dynamic routing algorithm that would locate the destination even if the mobile node moves from one cell to another. We have used AODV algorithm to compute the performance of the proposed algorithm. Our conclusions are based on four important performance on Route discovery time.

Suggested Citation

  • N. Sathishkumar, 2017. "Optimum Routing for AODV for Secure Mobility and Distributed Services," 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(6), pages 1391-1395, November.
    • Handle: RePEc:jbh:ijsrcs:v2:y2017:i6:id:hcseit1831500
    Note: Article URL: https://ijsrcseit.com/CSEIT1831500
    as

    Download full text from publisher

    File URL: https://ijsrcseit.com/CSEIT1831500
    File Function: Article URL
    Download Restriction: no
    File URL: https://ijsrcseit.com/paper/CSEIT1831500.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:i6:id:hcseit1831500. 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 (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.