2022
DOI: 10.1109/jsen.2022.3212275
|View full text |Cite
|
Sign up to set email alerts
|

An Adaptive Multipath Routing Method Based on Improved GA and Information Entropy

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(2 citation statements)
references
References 31 publications
0
2
0
Order By: Relevance
“…In this section, we conduct a comparative analysis of the EMRAR algorithm against three other algorithms: CADC proposed in [ 15 ], AMRBEC proposed in [ 29 ], and IQMRP proposed in [ 35 ]. Figure 5 presents a performance comparison of these four algorithms in terms of AAL, PDR, and NRE under different data transmission rates with a fixed ∆ value of 3% and an adjacent node density of 20.…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…In this section, we conduct a comparative analysis of the EMRAR algorithm against three other algorithms: CADC proposed in [ 15 ], AMRBEC proposed in [ 29 ], and IQMRP proposed in [ 35 ]. Figure 5 presents a performance comparison of these four algorithms in terms of AAL, PDR, and NRE under different data transmission rates with a fixed ∆ value of 3% and an adjacent node density of 20.…”
Section: Discussionmentioning
confidence: 99%
“…[ 28 ] allocates reserved disjointed multipath to different data types according to the QoS capabilities of different paths, ensuring high delivery rates for integrity-sensitive data and low latency for delay-sensitive data. To mitigate energy consumption and prolong the lifetime, an adaptive multipath routing scheme based on balanced energy consumption is proposed in the literature [ 29 ]. This approach jointly considers the path energy, distance, hops, and the lowest energy node, dynamically adjusting the amount of data transmission among multiple paths according to the change in energy information entropy of each path.…”
Section: Related Workmentioning
confidence: 99%