Skip to main content
SpringerLink
Log in
Book cover

Proceedings of the Second International Conference on Computer and Communication Technologies pp 489–497Cite as

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

  • Conference paper
  • First Online:

Part of the book series: Advances in Intelligent Systems and Computing ((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.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  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. Bellman, R.: On the theory of dynamic programming. Proc. Natl. Acad. Sci. 38, 716–719 (1952)

    Article  MATH  Google Scholar 

  3. Bellman, R.: Dynamic Programming. Princeton University Press, Princeton, NJ (1957)

    MATH  Google Scholar 

  4. Bellman, R.: On a routing problem. Q. Appl. Math. 16(1), 87–90 (1958)

    MATH  Google Scholar 

  5. Berge, C.: Theorie des Graphes et ses Applications. Dunod, Paris (1958)

    Google Scholar 

  6. Berge, C., Ghouila-Houri, A.: Programming, Games, and Transportation Networks. John Wiley and Sons, NY (1965)

    Google Scholar 

  7. Dantzig, G.B., Thapa, N.M.: Linear Programming 2: Theory and Extensions. Springer Verlag, Berlin (2003)

    Google Scholar 

  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. Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1, 269–271 (1959)

    Article  MATH  MathSciNet  Google Scholar 

  10. Dreyfus, S.: An appraisal of some shortest-path algorithms Operations Research 17, 395–412 (1969)

    MATH  Google Scholar 

  11. Gass, S.I., Harris, C.M.: Encyclopedia of operations research and management science. Kluwer, Boston, Mass (1996)

    Book  MATH  Google Scholar 

  12. Microsoft Shortest Path Algorithms Project: research.microsoft.com/research/sv/SPA/ex.html

  13. Smith, D.K.: Networks and Graphs: Techniques and Computational Methods. Horwood Publishing Limited, Chichester, UK (2003)

    Book  Google Scholar 

  14. Sniedovich, M.: Dynamic Programming. Marcel Dekker, NY (1992)

    MATH  Google Scholar 

  15. Winston, W.L.: Operations Research Applications and Algorithms, 4th edn. Brooks/Cole, Belmont, CA (2004)

    Google Scholar 

  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. Gocheva-Ilieva, S.: Bellman’s Optimality Principle. snow@uni-plovdiv.bg

    Google Scholar 

  18. Kirk, J.: MATLAB Central. www.mathworks.com

Download references

Author information

Authors and Affiliations

  1. Amity University, Noida, Uttar Pradesh, India

    Dhruba Ghosh, Sunil Kumar & Paurush Bhulania

Authors
  1. Dhruba Ghosh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sunil Kumar
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Paurush Bhulania
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Dhruba Ghosh .

Editor information

Editors and Affiliations

  1. Dept. of Computer Science and Engineering, Anil Neerukonda Institute of Technology and Sciences, Vishakapatnam, India

    Suresh Chandra Satapathy

  2. Department of CSE, CMR Technical Campus, Hyderabad, India

    K. Srujan Raju

  3. Computer Science & Engineering, Kalyani University, Nadia, West Bengal, India

    Jyotsna Kumar Mandal

  4. Electronics and Communication Engineering, Shri Ramswaroop Memorial Group of Professional Colleges, Lucknow, Uttar Pradesh, India

    Vikrant Bhateja

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer India

About this paper

Cite this paper

Ghosh, D., Kumar, S., Bhulania, P. (2016). A Novel Solution of Dijkstra’s Algorithm for Shortest Path Routing with Polygonal Obstacles in Wireless Networks Using Fuzzy Mathematics. In: Satapathy, S., Raju, K., Mandal, J., Bhateja, V. (eds) Proceedings of the Second International Conference on Computer and Communication Technologies. Advances in Intelligent Systems and Computing, vol 380. Springer, New Delhi. https://doi.org/10.1007/978-81-322-2523-2_47

Download citation

  • DOI: https://doi.org/10.1007/978-81-322-2523-2_47

  • Published:

  • Publisher Name: Springer, New Delhi

  • Print ISBN: 978-81-322-2522-5

  • Online ISBN: 978-81-322-2523-2

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation