A Novel Solution of Dijkstra’s Algorithm for Shortest Path Routing with Polygonal Obstacles in Wireless Networks Using Fuzzy Mathematics

Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 380)

Abstract

This paper centralizes the idea of shortest path routing using a new approach to Dijkstra’s algorithm. Our new algorithm gives best solution as compared to the previously proposed algorithms using fuzzy mathematics with well-defined explanation in terms of complexity. The algorithm is valid for negative-weight graphs as well as a number of obstacles in the path of routing. It will search out the shortest path for routing and the shortest route which costs minimum. The minimum cost consuming shortest route is valuable routing for Ultra Large Scale Integrated chip.

Keywords

Advanced research projects agency network Fuzzy mathematics Interior gateway routing protocol Netchange Very large-scale integration Ultra large-scale integration 

References

  1. 1.
    Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flow Theory, Algorithms, and Applications. Prentice-Hall, Englewood-Cliffs, NJ (1993)Google Scholar
  2. 2.
    Bellman, R.: On the theory of dynamic programming. Proc. Natl. Acad. Sci. 38, 716–719 (1952)MATHCrossRefGoogle Scholar
  3. 3.
    Bellman, R.: Dynamic Programming. Princeton University Press, Princeton, NJ (1957)MATHGoogle Scholar
  4. 4.
    Bellman, R.: On a routing problem. Q. Appl. Math. 16(1), 87–90 (1958)MATHGoogle Scholar
  5. 5.
    Berge, C.: Theorie des Graphes et ses Applications. Dunod, Paris (1958)Google Scholar
  6. 6.
    Berge, C., Ghouila-Houri, A.: Programming, Games, and Transportation Networks. John Wiley and Sons, NY (1965)Google Scholar
  7. 7.
    Dantzig, G.B., Thapa, N.M.: Linear Programming 2: Theory and Extensions. Springer Verlag, Berlin (2003)Google Scholar
  8. 8.
    SCI.OP-RESEARCH: Changing minimization to maximization, do the following problems change? SCI.OP-RESEARCH Digest 11(13), Mon 5 April 2004. www.deja.com/group/sci.op-research (2004)
  9. 9.
    Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1, 269–271 (1959)MATHMathSciNetCrossRefGoogle Scholar
  10. 10.
    Dreyfus, S.: An appraisal of some shortest-path algorithms Operations Research 17, 395–412 (1969)MATHGoogle Scholar
  11. 11.
    Gass, S.I., Harris, C.M.: Encyclopedia of operations research and management science. Kluwer, Boston, Mass (1996)MATHCrossRefGoogle Scholar
  12. 12.
    Microsoft Shortest Path Algorithms Project: research.microsoft.com/research/sv/SPA/ex.html
  13. 13.
    Smith, D.K.: Networks and Graphs: Techniques and Computational Methods. Horwood Publishing Limited, Chichester, UK (2003)CrossRefGoogle Scholar
  14. 14.
    Sniedovich, M.: Dynamic Programming. Marcel Dekker, NY (1992)MATHGoogle Scholar
  15. 15.
    Winston, W.L.: Operations Research Applications and Algorithms, 4th edn. Brooks/Cole, Belmont, CA (2004)Google Scholar
  16. 16.
    Mohammadi, M.B, Hooshmand, R.A, Fesharaki, F.H: A new approach for optimal placement of PMUs and their required communication infrastructure in order to minimize the cost of the WAMs. IEEE Trans. Smart Grid (99) (2015)Google Scholar
  17. 17.
    Gocheva-Ilieva, S.: Bellman’s Optimality Principle. snow@uni-plovdiv.bgGoogle Scholar
  18. 18.
    Kirk, J.: MATLAB Central. www.mathworks.com

Copyright information

© Springer India 2016

Authors and Affiliations

  1. 1.Amity UniversityNoidaIndia

Personalised recommendations