Finding Disjoint Paths in Boolean-Valued Networks

Shcherba, Evgeny V.; Litvinov, George A.

doi:10.1109/telfor.2018.8611961

Cited by 3 publications

(11 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…According to the derivation of the above formula, we can draw a conclusion: if there is no extra path to choose, the paths can overlap, It is say the more the number of paths finally selected by the route, the higher the data security. This is different from the References 15‐21 that the paths must be disjoint. Therefore, in this transmission model, the security of FMPST algorithm is higher than traditional schemes.…”

Section: Fmpst Algorithmmentioning

confidence: 77%

“…The scheme in References 13,14 can find multiple paths, when the link fails, the standby paths can be turned on, but they can not reduce the data eavesdropping rate. Most of the multi‐path routing are improved on the basis of Dijkstra algorithm to find multiple disjoint paths such as References 15‐21. Disjoint multipath routing has additional advantages in data reliability and security, but which has obvious shortcomings.…”

Section: Related Workmentioning

confidence: 99%

“…The Reference 17 will exclude some paths that transmission cost exceeds the threshold. The model of Reference 19 is used in Boolean network, and the model is an actually directed graph. References 21,29 are limited by time or the probability of malicious node.…”

Section: Experimental Simulation Analysismentioning

confidence: 99%

“…Assuming that the number of nodes in the original topology is n and the number of links is m , all the topology in Table 2 are running topology. In addition, the path number in the FMPST algorithm belongs to the input parameter, which is different algorithm from the References 17,19,21,29. Unless otherwise specified, the following experimental results are carried out under the condition of path input =

+ \infty

.…”

Section: Experimental Simulation Analysismentioning

confidence: 99%

See 3 more Smart Citations

A secure multi‐path transmission algorithm based on fountain codes

Liu

et al. 2022

Trans Emerging Tel Tech

View full text Add to dashboard Cite

Cyber security is the basis of ensuring reliable network transmission. In addition to encrypting the data, dividing the data into multiple paths for transmission is also an important way to improve the security. However, the development of semantic analysis algorithms leads to the fact that the eavesdroppers can restore the data as long as they obtain the data on the part of the paths, which reduces the security of multi-path transmission. Additionally, in the environment of poor communication quality, retransmission mechanism leads to long transmission delay. To solve the above problems, this article proposes a secure multi-path transmission algorithm based on fountain codes-FMPST. According to the safety level of data, the forwarding nodes are dynamically selected.Making use of the non-feedback characteristic of fountain codes can not only reduce data delay, but also evaluate the channel packet loss rate by random forest model. FMPST can calculate the number of packets by packet loss rate, which makes it difficult for eavesdroppers to obtain enough packets to decrypt.The experiments show that compared with other multi-path transmission algorithms, FMPST can improve the data security more than three times and reduce the communication delay by at least 50%.

show abstract

Section: Fmpst Algorithmmentioning

confidence: 77%

Section: Related Workmentioning

confidence: 99%

Section: Experimental Simulation Analysismentioning

confidence: 99%

+ \infty

.…”

Section: Experimental Simulation Analysismentioning

confidence: 99%

See 2 more Smart Citations

A secure multi‐path transmission algorithm based on fountain codes

Liu

et al. 2022

Trans Emerging Tel Tech

View full text Add to dashboard Cite

show abstract

“…Временная сложность алгоритма O(Kn 3 ) определяется сложностью поиска одного пути с максимальной по мощности репутацией. В качестве альтернативного способа поиска множества безопас-ных путей для многопутевого расширения протокола маршрутизации OLSR можно также использовать модифицированный алгоритм Бандари с сопоставимой сложностью [9], который позволяет найти K вершинно непересекающихся путей с максимальной совокупной репутацией, вычисляемой как пересечение глобальной репутации всех путей, входящих в искомое множество.…”

Section: алгоритм поиска множества безопасных маршрутовunclassified