2019
DOI: 10.1007/978-3-030-14118-9_10
|View full text |Cite
|
Sign up to set email alerts
|

Optimal Shortest Path in Mobile Ad-Hoc Network Based on Fruit Fly Optimization Algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
0
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 8 publications
(1 citation statement)
references
References 10 publications
0
0
0
Order By: Relevance
“…The following necessary steps are describing the fruit fly characteristics of searching for a source node which is described in [25]. The random initial position of a mobile sink is in (0, 0) coordinates such that, ๐ผ๐‘›๐‘–๐‘ก ๐‘‹ ๐‘Ž๐‘ฅ๐‘–๐‘  = 0; ๐ผ๐‘›๐‘–๐‘ก ๐‘Œ ๐‘Ž๐‘ฅ๐‘–๐‘  = 0 (7) the regulated direction of the mobile sink and the distance of the source search were determined by each CH individual's fitness score.…”
Section: Fruit Fly Optimization Algorithmmentioning
confidence: 99%
“…The following necessary steps are describing the fruit fly characteristics of searching for a source node which is described in [25]. The random initial position of a mobile sink is in (0, 0) coordinates such that, ๐ผ๐‘›๐‘–๐‘ก ๐‘‹ ๐‘Ž๐‘ฅ๐‘–๐‘  = 0; ๐ผ๐‘›๐‘–๐‘ก ๐‘Œ ๐‘Ž๐‘ฅ๐‘–๐‘  = 0 (7) the regulated direction of the mobile sink and the distance of the source search were determined by each CH individual's fitness score.…”
Section: Fruit Fly Optimization Algorithmmentioning
confidence: 99%