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

被引：0

作者：

Ghosh, Dhruba ^{[1
]}

Kumar, Sunil ^{[1
]}

Bhulania, Paurush ^{[1
]}

机构：

[1] Amity Univ, Noida, Uttar Pradesh, India

来源：

PROCEEDINGS OF THE SECOND INTERNATIONAL CONFERENCE ON COMPUTER AND COMMUNICATION TECHNOLOGIES, IC3T 2015, VOL 2 | 2016年 / 380卷

关键词：

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

D O I：

10.1007/978-81-322-2523-2_47

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

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.

引用

页码：489 / 497

页数：9

共 50 条

[1] RETRACTED: Analysis of the Shortest Path in Spherical Fuzzy Networks Using the Novel Dijkstra Algorithm (Retracted Article)
Ullah, Zafar
Bashir, Huma
Anjum, Rukhshanda
AlQahtani, Salman A.
Al-Hadhrami, Suheer
Ghaffar, Abdul
[J]. MATHEMATICAL PROBLEMS IN ENGINEERING, 2021, 2021
[2] A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing
Peyer, Sven
Rautenbach, Dieter
Vygen, Jens
[J]. JOURNAL OF DISCRETE ALGORITHMS, 2009, 7 (04) : 377 - 390
[3] A Novel Shortest Path Routing Algorithm for Wireless Data Collection in Transportation Networks
Senturk, Izzet Fatih
Kebe, Gaoussou Youssouf
[J]. 2019 4TH INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND ENGINEERING (UBMK), 2019, : 280 - 284
[4] On the Applications of Dijkstra's Shortest Path Algorithm in Software Defined Networks
Grbac, Tihana Galinac
Domazet, Nikola
[J]. INTELLIGENT DISTRIBUTED COMPUTING XI, 2018, 737 : 39 - 45
[5] Modification of Floyd-Warshall's Algorithm for Shortest Path Routing in Wireless Sensor Networks
Khan, Pritam
Konar, Gargi
Chakraborty, Niladri
[J]. 2014 Annual IEEE India Conference (INDICON), 2014,
[6] Modification of Floyd-Warshall's Algorithm for Shortest Path Routing in Wireless Sensor Networks
Khan, Pritam
Konar, Gargi
Chakraborty, Niladri
[J]. 2014 Annual IEEE India Conference (INDICON), 2014,
[7] On the Study of Shortest-path Problem on Coal-transportation Networks using Dijkstra's Algorithm
Chang, Hao-Yen
Wang, Ping-Feng
Chen, Hon-Chan
Chen, Ye-Zheng
Chen, Da-Ren
[J]. 2019 IEEE INTERNATIONAL CONFERENCE ON CONSUMER ELECTRONICS - TAIWAN (ICCE-TW), 2019,
[8] An improved weighted sum-fuzzy Dijkstra's algorithm for shortest path problem (iWSFDA)
Dudeja, Chanchal
Kumar, Pawan
[J]. SOFT COMPUTING, 2022, 26 (07) : 3217 - 3226
[9] An improved weighted sum-fuzzy Dijkstra’s algorithm for shortest path problem (iWSFDA)
Chanchal Dudeja
Pawan Kumar
[J]. Soft Computing, 2022, 26 : 3217 - 3226
[10] A novel connectivity algorithm based on shortest path for wireless sensor networks
El Khediri, Salim
Thaljaoui, Adel
Dallali, Adel
Harakti, Souli
Kachouri, Abdennaceur
[J]. 2018 1ST INTERNATIONAL CONFERENCE ON COMPUTER APPLICATIONS & INFORMATION SECURITY (ICCAIS' 2018), 2018,

← 1 2 3 4 5 →