2020
DOI: 10.1155/2020/8822985
|View full text |Cite
|
Sign up to set email alerts
|

Routing Strategy for LEO Satellite Networks Based on Membership Degree Functions

Abstract: The deployment of Mobile Edge Computing (MEC) servers on Low Earth Orbit (LEO) satellites to form MEC satellites is of increasing concern. A routing strategy is the key technology in MEC satellites. To solve the uncertainty problem of LEO satellite link information caused by complex space environments, a routing strategy for LEO satellite networks based on membership degree functions is proposed. First, a routing model based on uncertain link information is established. In particular, the membership function i… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
2
2
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(1 citation statement)
references
References 30 publications
(28 reference statements)
0
1
0
Order By: Relevance
“…A routing model based on the membership function of uncertain links in mobile edge computing satellites networks has been proposed and solved using a grey wolf optimization algorithm to select a link with the minimum comprehensive value of the metrics delay, packet loss rate, and bandwidth. The comprehensive evaluation of a link is given as where , , and are the membership degree functions of the delay, packet loss rate, and bandwidth [ 46 ]. The shortest path routing approach was proposed to service delay-sensitive traffic and other traffic separately [ 47 ].…”
Section: Related Workmentioning
confidence: 99%
“…A routing model based on the membership function of uncertain links in mobile edge computing satellites networks has been proposed and solved using a grey wolf optimization algorithm to select a link with the minimum comprehensive value of the metrics delay, packet loss rate, and bandwidth. The comprehensive evaluation of a link is given as where , , and are the membership degree functions of the delay, packet loss rate, and bandwidth [ 46 ]. The shortest path routing approach was proposed to service delay-sensitive traffic and other traffic separately [ 47 ].…”
Section: Related Workmentioning
confidence: 99%