Organizing Multipath Routing in Cloud Computing Environments

Tolba, Amr

doi:10.14569/ijacsa.2017.080158

Cited by 2 publications

(2 citation statements)

References 23 publications

(28 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Very Good (VG) [9,10] Good (G) [6,9] Moderate Good (MG) [5,6] Fair (F) [4,5] Moderate Poor (MP) [3,4] Poor…”

Section: Linguistic Variables Grey Numbersmentioning

confidence: 99%

See 1 more Smart Citation

Hybrid Interval Type-2 Fuzzy AHP and COPRAS-G-based trusted neighbour node Discovery in Wireless Sensor Networks

N.V.,

K.S.

2023

JMC

View full text Add to dashboard Cite

In Wireless Sensor Networks (WSNs), reliable and rapid neighbour node discovery is considered as the crucial operation which frequently needs to be executed over the entire lifecycle. Several neighbour node discovery mechanisms are proposed for reducing the latency or extending the sensor nodes’ lifetime. But majority of the existing neighbour node discovery mechanisms failed in addressing the critical issues of real WSNs related to energy consumptions, constraints of latency, uncertainty of node behaviors, and communication collisions. In this paper, Hybrid Interval Type-2 Fuzzy Analytical Hierarchical Process (AHP) and Complex Proportional Assessment using Grey Theory (COPRAS-G)-based trusted neighbour node discovery scheme (FAHPCG) is proposed for better data dissemination process. In specific, Interval Type 2 Fuzzy AHP is applied for determining the weight of the evaluation criteria considered for neighbour node discovery, and then Grey COPRAS method is adopted for prioritizing the sensor nodes of the routing path established between the source and destination. It adopted the merits of fuzzy theory for handling the uncertainty and vagueness involved in the change in the behavior of sensor nodes during the process of neighbour discovery. It is proposed with the capability of exploring maximized number of factors that aids in exploring the possible dimensions of sensor nodes packet forwarding potential during the process of neighbour node discovery. The simulation results of the proposed FAHPCG scheme confirmed an improved neighbour node discovery rate of 23.18% and prolonged the sensor nodes lifetime to the maximum of 7.12 times better than the baseline approaches used for investigation.

show abstract

“…Very Good (VG) [9,10] Good (G) [6,9] Moderate Good (MG) [5,6] Fair (F) [4,5] Moderate Poor (MP) [3,4] Poor…”

Section: Linguistic Variables Grey Numbersmentioning

confidence: 99%

“…They may be compromised, or bogus information may be injected. The nodes influenced by a threat from outside may not be considered reliable as they do not convey the original sensed information [5].…”

Section: Introductionmentioning

confidence: 99%

Hybrid Interval Type-2 Fuzzy AHP and COPRAS-G-based trusted neighbour node Discovery in Wireless Sensor Networks

N.V.,

K.S.

2023

JMC

View full text Add to dashboard Cite

show abstract

The Disjoint Multipath Challenge: Multiple Disjoint Paths Guaranteeing Scalability

et al. 2021

View full text Add to dashboard Cite

The multipath challenge is a research line in continuous development because of its multiple benefits, however, these benefits are overshadowed by scalability, which goes down considerably when the paths are multiple and disjoint. The disjointness aggregates an extra value to the multiple paths, but it also implies more complex mathematical operations that increase the computational cost. In fact, diverse proposals exist that try to increase scalability by limiting the number of paths obtained to the minimum possible (two-disjoint paths), which is enough for backup applications but not for other purposes. This paper presents an algorithm that solves these drawbacks by discovering multiple disjoint paths among multiple nodes in an efficient way, while keeping bounded the computational cost and ensuring scalability. The proposed algorithm has been validated thoroughly by performing a theoretical analysis, bolstered afterwards by an exhaustive experimental evaluation. The collected results are promising, our algorithm reduces the time spent to obtain the disjoint paths regarding its competitors between one and three orders of magnitude, at the cost of a slight decrease in the number of paths discovered.

show abstract

Organizing Multipath Routing in Cloud Computing Environments

Cited by 2 publications

References 23 publications

Hybrid Interval Type-2 Fuzzy AHP and COPRAS-G-based trusted neighbour node Discovery in Wireless Sensor Networks

Hybrid Interval Type-2 Fuzzy AHP and COPRAS-G-based trusted neighbour node Discovery in Wireless Sensor Networks

The Disjoint Multipath Challenge: Multiple Disjoint Paths Guaranteeing Scalability

Contact Info

Product

Resources

About