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

ACCUMNET : Optimal Routing Algorithms for Multi-Channel Multi-Hop Networks

Author

Listed:
  • B.Arulmozhi
  • P.Agalya
  • A. Sivasankari

Abstract

In this paper, we tend to gift a routing and channel assignment protocol for multi-channel multi-hop wireless networks. We tend to contemplate a multi-hop network, wherever a mobile host might connect with associate access purpose victimization multi-hop wireless routes, via alternative mobile hosts or wireless routers. In addition, we tend to take into account a multi-channel network wherever multiple non-overlapping (orthogonal) channels area unit on the market, and every host or router will dynamically choose a channel to enhance performance. During this system, we tend to investigate the optimum routing downside in signal transmission from supply to destination for the multi-hop network. We tend to use the technique of rate less code that is employed to accumulate the information with every packet within the transmission. This could decrease the entire energy; scale back delays in transmission for transmission information from the supply to the destination. Proposed system allows vital performance through the shortest path routing victimization Floyd-Warshall algorithmic rule.

Suggested Citation

  • B.Arulmozhi & P.Agalya & A. Sivasankari, 2018. "ACCUMNET : Optimal Routing Algorithms for Multi-Channel Multi-Hop Networks," 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. 4(3), pages 01-06, February.
    • Handle: RePEc:jbh:ijsrcs:v4:y2018:i3:id:hcseit184301
    Note: Article URL: https://ijsrcseit.com/CSEIT184301
    as

    Download full text from publisher

    File URL: https://ijsrcseit.com/CSEIT184301
    File Function: Article URL
    Download Restriction: no
    File URL: https://ijsrcseit.com/paper/CSEIT184301.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:v4:y2018:i3:id:hcseit184301. 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.