Search

In the last decade, concealed by uncertain atmosphere, many algorithms have been studied deeply to workout the shortest path problem. In this paper, we compared the shortest path problem with various existing algorithms. Finally, we concluded the best algorithm for certain environment.

An elongation of the single-valued neutrosophic set is an interval-valued neutrosophic set. It has been demonstrated to deal indeterminacy in a decision-making problem. Real-world problems have some kind of uncertainty in nature and among them; one of the influential problems is solving the shortest path problem (SPP) in interconnections. In this contribution, we consider SPP through Bellman’s algorithm for a network using interval-valued neutrosophic numbers (IVNNs). We proposed a novel algorithm to obtain the neutrosophic shortest path between each pair of nodes. Length of all the edges is accredited an IVNN. Moreover, for the validation of the proposed algorithm, a numerical example has been offered. Also, a comparative analysis has been done with the existing methods which exhibit the advantages of the new algorithm.

Real-life decision-making problem has been demonstrated to cover the indeterminacy through single valued neutrosophic set. It is the extension of interval valued neutrosophic set. Most of the problems of real life involve some sort of uncertainty in it among which, one of the famous problem is finding a shortest path of the network. In this paper, a new score function is proposed for interval valued neutrosophic numbers and SPP is solved using interval valued neutrosophic numbers. Additionally, novel algorithms are proposed to find the neutrosophic shortest path by considering interval valued neutrosophic number, trapezoidal and triangular interval valued neutrosophic numbers for the length of the path in a network with illustrative example. Further, comparative analysis has been done for the proposed algorithm with the existing method with the shortcoming and advantage of the proposed method and it shows the effectiveness of the proposed algorithm.

Over the past few years, we have seen the spread of wireless networks in institutions, businesses, and private homes. Their wide variety, market availability, and ease of implementation have made this wireless technology more popular than wired networks. Nevertheless, enterprises are still demanding better quality of service to meet the needs of sensitive applications and avoid data loss. The SDN approach provides the ability to manage QoS dynamically via a controller. In this paper, we developed a secure model based on dynamic access control and the detection of unreliable access points. We also proposed QoS management in a wireless network by adopting the SDN approach to address connection problems and efficiently utilize resources. By employing these tools and techniques, we can narrow down all possible options to one single best choice. By comparing the results, our model validates its effectiveness in minimizing latency, jitter, packet loss, and transaction delay and offers a good opinion score.

AbstractIn this paper, inspired by the concept of generalized single-valued neutrosophic graphs(GSVNG) of the first type, we define yet another generalization of neutrosophic graph called the generalized interval-valued neutrosophic graph of 1 type (GIVNG1) in addition to our previous work on complex neutrosophic graph (CNG1) in [47]. We will also show a matrix representation for this new generalization. Many of the fundamental properties and characteristics of this new concept is also studied. Like the concept CNG1 in [47], the concept of GIVNG1 is another extension of generalized fuzzy graphs 1 (GFG1) and GSVNG1.

In this paper, we discuss the minimum spanning tree (MST) problem of an undirected neutrosophic weighted connected graph in which a single-valued neutrosophic number, instead of a real number/fuzzy number, is assigned to each arc as its arc length. We define this type of MST as neutrosophic minimum spanning tree (NMST). We describe the utility of neutrosophic numbers as arc lengths and its application in different real world MST problems. Here, a new algorithm for designing the MST of a neutrosophic graph is introduced. In the proposed algorithm, we incorporate the uncertainty in Kruskal algorithm for designing MST using neutrosophic number as arc length. A score function is used to compare different NMSTs whose weights are computed using the addition operation of neutrosophic numbers. We compare this weight of the NMST with that of an equivalent classical MST with real numbers as arc lengths. Compared with the existing algorithms for NMST, the proposed algorithm is more efficient due to the fact that the addition operation and the ranking of neutrosophic number can be done in straightforward manners. The proposed algorithm is illustrated by numerical examples.

This main purpose of this paper is to develop an algorithm to find the shortest path on a network in which the weights of the edges are represented by bipolar neutrosophic numbers. Finally, a numerical example has been provided for illustrating the proposed approach.

In this paper, we first define the concept of bipolar single neutrosophic graphs as the generalization of bipolar fuzzy graphs, N-graphs, intuitionistic fuzzy graph, single valued neutrosophic graphs and bipolar intuitionistic fuzzy graphs.