Analysis of Shortest Path Routing for Large Multi-Hop Wireless Networks

  • Authors

    • Ms S.Girija
    • Mrs S.Kayathri
    • Ms S.Meena
    2018-07-15
    https://doi.org/10.14419/ijet.v7i3.10.15630
  • Use about five key words or phrases in alphabetical order, Separated by Semicolon.

  • Abstract

    In the concurrent system, each node avails as a packet over the network depends on the length of the node. The length of the node generated through straight line routing algorithm. The cost of routing depends on the shortest path routing algorithm. The shortest path is determined by the cost of a distance from one node to another over the network. The capacity of a network is balanced and maintained by the straight routing. The traffic and cost is balanced over the network by using the algorithms.

     

     

     

  • References

    1. [1] Deep Medhi Karthik Ramasamy, Network Routing, 2nd Edition, Morgan Kaufmann.

      [2] Hai Liu, Yiu-Wing Leung, Xiaowen Chu, AdHoc and Sensor Wireless Networks: Architectures, Algorithms and Protocols.

      [3] Jeffrey S. Beasley, Networking (Networking Techngy), 2nd Edition, Kindle Edition.

      [4] MIiguel Elias Mitre Campista, Rubinstein Marcelo Goncalves Rubinstein Advanced Routing Protocols for Wireless Network

      [5] Chai K Toh,â€Ad Hoc Mobile Wireless Networks Protocols and Systemsâ€, 1st Edition, Kindle Edition.

      [6] James Shelton, How To Set Up Your Wireless Router, Kindle Edition

  • Downloads

  • How to Cite

    S.Girija, M., S.Kayathri, M., & S.Meena, M. (2018). Analysis of Shortest Path Routing for Large Multi-Hop Wireless Networks. International Journal of Engineering & Technology, 7(3.10), 59-61. https://doi.org/10.14419/ijet.v7i3.10.15630

    Received date: 2018-07-14

    Accepted date: 2018-07-14

    Published date: 2018-07-15