2019
DOI: 10.1007/978-3-030-34869-4_41
|View full text |Cite
|
Sign up to set email alerts
|

An Evolutionary Approach to Multi-point Relays Selection in Mobile Ad Hoc Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 6 publications
0
1
0
Order By: Relevance
“…The problem of global minimization of the MPR set size has been formulated as an integer linear programming (ILP) that can be solved efficiently for relatively small or medium-size networks [8]. The MPR set selection algorithm is formulated as ILP in [8], [9] or as genetic algorithm [10]. However, the global minimum is not practical as it requires centralized coordination, and high computational power for large networks, and therefore not scalable.…”
Section: A Related Workmentioning
confidence: 99%
“…The problem of global minimization of the MPR set size has been formulated as an integer linear programming (ILP) that can be solved efficiently for relatively small or medium-size networks [8]. The MPR set selection algorithm is formulated as ILP in [8], [9] or as genetic algorithm [10]. However, the global minimum is not practical as it requires centralized coordination, and high computational power for large networks, and therefore not scalable.…”
Section: A Related Workmentioning
confidence: 99%