Name
Abstract | ||
|---|---|---|
Optimal relay placement is studied for free-space optical multi-hop communication when obstacles and infeasible regions exist. We propose an optimization framework to find the optimal relay locations in the specified available regions and make laser links bypass obstacles of various shapes. A grouping optimization technique is proposed to reduce the optimization time when the number of relays is large, and we numerically demonstrate that this technique can provide solutions close to the optimal solutions, and its average searching time grows linearly with the number of relays. Simulation results show that our proposed optimization framework can effectively provide good solution to the problem of optimal relay placement in limited available regions, and enable the laser links to bypass obstacles in order to achieve minimum end-to-end outage probability. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1109/GLOCOM.2014.7037124 | GLOBECOM |
Keywords | Field | DocType |
relay networks (telecommunication),optimisation,optimal fso relay nodes placement,infeasible regions,optimization time reduction,grouping optimization technique,optical links,average searching time,free-space optical multihop communication,laser link obstacles,minimum end-to-end outage probability,probability,optimization,lasers,linear programming,fading,shape | Mathematical optimization,Fading,Computer science,Linear programming,Outage probability,Relay | Conference |
ISSN | Citations | PageRank |
2334-0983 | 3 | 0.48 |
References | Authors | |
5 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bingcheng Zhu | 1 | 13 | 2.69 |
| Julian Cheng | 2 | 1409 | 145.12 |
| Lenan Wu | 3 | 700 | 62.18 |