contents
DESCRIPTION
Hybrid Discrete-Continuous Optimization for the Frequency Assignment Problem in Satellite Communications System Kata KIATMANAROJ, Christian ARTIGUES, Laurent HOUSSIN (LAAS), Fr édéric MESSINE (IRIT). Contents. Problem definition Discrete optimization Continuous optimization Hybrid method - PowerPoint PPT PresentationTRANSCRIPT
![Page 1: Contents](https://reader035.vdocuments.us/reader035/viewer/2022070407/568142d6550346895daf2ddd/html5/thumbnails/1.jpg)
Hybrid Discrete-Continuous Optimization for the Frequency Assignment Problem in Satellite
Communications System
Kata KIATMANAROJ, Christian ARTIGUES, Laurent HOUSSIN (LAAS), Frédéric MESSINE (IRIT)
1INCOM-2012
![Page 2: Contents](https://reader035.vdocuments.us/reader035/viewer/2022070407/568142d6550346895daf2ddd/html5/thumbnails/2.jpg)
ContentsContents
• Problem definition• Discrete optimization• Continuous optimization• Hybrid method• Conclusions and perspectives
2INCOM-2012
![Page 3: Contents](https://reader035.vdocuments.us/reader035/viewer/2022070407/568142d6550346895daf2ddd/html5/thumbnails/3.jpg)
Problem definitionProblem definition
• To assign a limited number of frequencies to as many users as possible within the service area
3INCOM-2012
![Page 4: Contents](https://reader035.vdocuments.us/reader035/viewer/2022070407/568142d6550346895daf2ddd/html5/thumbnails/4.jpg)
Problem definitionProblem definition
• To assign a limited number of frequencies to as many users as possible within the service area
• Frequency is a limited resource!– Frequency reuse -> co-channel interference– Intra-system interference
4INCOM-2012
![Page 5: Contents](https://reader035.vdocuments.us/reader035/viewer/2022070407/568142d6550346895daf2ddd/html5/thumbnails/5.jpg)
Problem definitionProblem definition
• To assign a limited number of frequencies to as many users as possible within the service area
• Frequency is a limited resource!– Frequency reuse -> co-channel interference– Intra-system interference
• Graph coloring problem– NP-hard
5INCOM-2012
![Page 6: Contents](https://reader035.vdocuments.us/reader035/viewer/2022070407/568142d6550346895daf2ddd/html5/thumbnails/6.jpg)
Problem definitionProblem definition
• Interference constraints
6
ij
i
j
k
Binary interference Cumulative interference
INCOM-2012
![Page 7: Contents](https://reader035.vdocuments.us/reader035/viewer/2022070407/568142d6550346895daf2ddd/html5/thumbnails/7.jpg)
Problem definitionProblem definition
• Satellite beam & antenna gain
7INCOM-2012
![Page 8: Contents](https://reader035.vdocuments.us/reader035/viewer/2022070407/568142d6550346895daf2ddd/html5/thumbnails/8.jpg)
Discrete optimization
8INCOM-2012
![Page 9: Contents](https://reader035.vdocuments.us/reader035/viewer/2022070407/568142d6550346895daf2ddd/html5/thumbnails/9.jpg)
Discrete optimizationDiscrete optimization
• Integer Linear Programming• Greedy algorithms
9INCOM-2012
![Page 10: Contents](https://reader035.vdocuments.us/reader035/viewer/2022070407/568142d6550346895daf2ddd/html5/thumbnails/10.jpg)
Discrete optimizationDiscrete optimization
• Integer Linear Programming (ILP)
10INCOM-2012
![Page 11: Contents](https://reader035.vdocuments.us/reader035/viewer/2022070407/568142d6550346895daf2ddd/html5/thumbnails/11.jpg)
Discrete optimizationDiscrete optimization
• Greedy algorithms– User selection rules– Frequency selection rules
11INCOM-2012
![Page 12: Contents](https://reader035.vdocuments.us/reader035/viewer/2022070407/568142d6550346895daf2ddd/html5/thumbnails/12.jpg)
Discrete optimizationDiscrete optimization
• Greedy algorithms– User selection rules– Frequency selection rules
12INCOM-2012
![Page 13: Contents](https://reader035.vdocuments.us/reader035/viewer/2022070407/568142d6550346895daf2ddd/html5/thumbnails/13.jpg)
Discrete optimizationDiscrete optimization
13INCOM-2012
• Performance comparison: ILP vs. Greedy
![Page 14: Contents](https://reader035.vdocuments.us/reader035/viewer/2022070407/568142d6550346895daf2ddd/html5/thumbnails/14.jpg)
Discrete optimizationDiscrete optimization
14INCOM-2012
• ILP performances
![Page 15: Contents](https://reader035.vdocuments.us/reader035/viewer/2022070407/568142d6550346895daf2ddd/html5/thumbnails/15.jpg)
Continuous optimization
15INCOM-2012
![Page 16: Contents](https://reader035.vdocuments.us/reader035/viewer/2022070407/568142d6550346895daf2ddd/html5/thumbnails/16.jpg)
Continuous optimizationContinuous optimization
• Beam moving algorithm– For each unassigned user
• Continuously move the interferers’ beams from their center positions-> reduce interference
• Non-linear antenna gain• Minimize the move• Not violating interference constraints
16INCOM-2012
![Page 17: Contents](https://reader035.vdocuments.us/reader035/viewer/2022070407/568142d6550346895daf2ddd/html5/thumbnails/17.jpg)
Continuous optimizationContinuous optimization
17
i
j
k
x
INCOM-2012
• Matlab’s solver fmincon
![Page 18: Contents](https://reader035.vdocuments.us/reader035/viewer/2022070407/568142d6550346895daf2ddd/html5/thumbnails/18.jpg)
Continuous optimizationContinuous optimization
18
i
j
k
x
INCOM-2012
• Matlab’s solver fmincon
![Page 19: Contents](https://reader035.vdocuments.us/reader035/viewer/2022070407/568142d6550346895daf2ddd/html5/thumbnails/19.jpg)
Continuous optimizationContinuous optimization
19
i
j
k
x
INCOM-2012
• Matlab’s solver fmincon
![Page 20: Contents](https://reader035.vdocuments.us/reader035/viewer/2022070407/568142d6550346895daf2ddd/html5/thumbnails/20.jpg)
Continuous optimizationContinuous optimization
20
i
j
k
x
INCOM-2012
• Matlab’s solver fmincon
![Page 21: Contents](https://reader035.vdocuments.us/reader035/viewer/2022070407/568142d6550346895daf2ddd/html5/thumbnails/21.jpg)
Continuous optimizationContinuous optimization
21
i
j
k
x
INCOM-2012
• Matlab’s solver fmincon
![Page 22: Contents](https://reader035.vdocuments.us/reader035/viewer/2022070407/568142d6550346895daf2ddd/html5/thumbnails/22.jpg)
Continuous optimizationContinuous optimization
22INCOM-2012
• Matlab’s solver fmincon• Parameters: k, MAXINEG, UTVAR
![Page 23: Contents](https://reader035.vdocuments.us/reader035/viewer/2022070407/568142d6550346895daf2ddd/html5/thumbnails/23.jpg)
Hybrid discrete-continuous optimization
23INCOM-2012
![Page 24: Contents](https://reader035.vdocuments.us/reader035/viewer/2022070407/568142d6550346895daf2ddd/html5/thumbnails/24.jpg)
Hybrid methodHybrid method
24INCOM-2012
• Beam moving results with k-MAXINEG-UTVAR = 7-2-0
![Page 25: Contents](https://reader035.vdocuments.us/reader035/viewer/2022070407/568142d6550346895daf2ddd/html5/thumbnails/25.jpg)
Hybrid methodHybrid method
25INCOM-2012
• Beam moving results with k-MAXINEG-UTVAR = 7-2-0
![Page 26: Contents](https://reader035.vdocuments.us/reader035/viewer/2022070407/568142d6550346895daf2ddd/html5/thumbnails/26.jpg)
Hybrid methodHybrid method
26INCOM-2012
• Closed-loop implementation
![Page 27: Contents](https://reader035.vdocuments.us/reader035/viewer/2022070407/568142d6550346895daf2ddd/html5/thumbnails/27.jpg)
Conclusions and further studyConclusions and further study
• Greedy algorithm vs. ILP• Beam Moving algorithm benefit• Closed-loop implementation benefit vs. time
• Further improvements
27INCOM-2012
![Page 28: Contents](https://reader035.vdocuments.us/reader035/viewer/2022070407/568142d6550346895daf2ddd/html5/thumbnails/28.jpg)
Thank you
28INCOM-2012