2022 IEEE Wireless Communications and Networking Conference (WCNC) 2022
DOI: 10.1109/wcnc51071.2022.9771852
|View full text |Cite
|
Sign up to set email alerts
|

A Multi-objective based Inter-Layer Link Allocation Scheme for MEO/LEO Satellite Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
18
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 12 publications
(18 citation statements)
references
References 0 publications
0
18
0
Order By: Relevance
“…Inequality (22) indicates that RLS i can not charge in umbra, so the harvested energy in t should not exceed the maximum energy amount that can be collected under sunlight. Equation ( 23) is the energy balance constraint.…”
Section: ) Energy Related Constraintsmentioning
confidence: 99%
See 3 more Smart Citations
“…Inequality (22) indicates that RLS i can not charge in umbra, so the harvested energy in t should not exceed the maximum energy amount that can be collected under sunlight. Equation ( 23) is the energy balance constraint.…”
Section: ) Energy Related Constraintsmentioning
confidence: 99%
“…5, these studies' optimization of each time-slot is independent. Therefore, these works mostly adopt a centralized approach to maximize benefits per time-slot, as in [17]- [19], [22], [23], and neglect the difference of observation tasks, as in [17], [18], [22], [23]. Without the link switching interval, strategies' comparison is meaningless since it is out of reality.…”
Section: Comparison With Other Strategiesmentioning
confidence: 99%
See 2 more Smart Citations
“…Reference [16] proposes an efficient scheme for load balancing by using Knapsack and Zipf. Reference [17] formulates the problem as a constrained, multi-objective linear programming problem to maximize the utilization efficiency between satellites. The authors of [18] analyzed the transmission characteristics of terrestrial and back-haul links to propose a greedy-based user association algorithm and a matching algorithm with user grouping for balancing the load by performing multiple iterations between users and cells.…”
Section: Introductionmentioning
confidence: 99%