Title: Layout Optimization for Pointtopoint Wireless Optical Networks via Simulated Annealing
1Layout Optimization for Point-to-point Wireless
Optical Networks via Simulated Annealing
Genetic Algorithm
2Guideline
- Problem Specification System Modeling
- Simulated Annealing
- Genetic Algorithm
- Results Conclusion
3Problem Specification System Modeling
- Introduction to wireless optical networks
- Problem specification
- System modeling
4Wireless Optical Networks
5Wireless Optical Networks
- Advantages
- Speed
- Cost
- Convenience
- Limitation
- Weather
- Moving buildings
- Flying Objects
6Problem Specification
- Configuration
- How to optimize the layout for a given area with
given topology for possible laser locations and
potential user locations?
7System Modeling
- Combinational Optimization Problem
- Configuration
- Two dimensional
- Potential subscriber
- Possible locations for base station(laser)
- System topology
- System constrains
8Simulated Annealing
Imperfect order, Perfect
order, has has higher energy
minimum energy
How to reach the low energy state anneal
the material. get it very hot gives atoms energy
to move around. cool it very slowly gently
restricts range of motion till everything freezes
into a low energy configuration.
9Simulated Annealing
10Simulated Annealing
Start with the system in a known configuration,
at known energy E T temperature hot frozen
false while ( ! frozen ) repeat Perturb
system slightly (e.g., move a particle) Compute
.E ,change in energy due to perturbation if (?E
lt 0 ) then accept this perturbation, this is
the new system config else accept maybe, with
probability exp(-?E/KT) until (the system is
in thermal equilibrium at this T) If (?E still
decreasing over the last few temperatures) then
T 0.9 T // cool the temperature do more
perturbations else frozen true return (final
configuration as low-energy solution)
11Simulated Annealing Implementation
- Configuration
- Cost function
- Move set
- Cooling schedule
- Thermal equilibrium
- When to freeze
- Melt
12Simulated Annealing Implementation
- Ray Tracing
- Data Structure
- Testing Annealer
13Simulated Annealing Result
14Simulated Annealing Result
15Simulated Annealing Result
16Simulated Annealing Result
17 Genetic Algorithm
- Selection
- Crossover
- Mutation
- Elitism
- Scaling
18Genetic Algorithm
19Genetic Algorithm Result
20Genetic Algorithm Result
21Genetic Algorithm Result
22Results Conclusion
- Scalability
- Accuracy
- Performance
- Applicability
- Future Work