Relay Placement for FSO Multihop DF Systems With Link Obstacles and Infeasible Regions

Bingcheng Zhu, Julian Cheng, Mohamed-Slim Alouini, Lenan Wu

Research output: Contribution to journalArticlepeer-review

27 Scopus citations


Optimal relay placement is studied for free-space optical multihop communication with link obstacles and infeasible regions. An optimal relay placement scheme is proposed to achieve the lowest outage probability, enable the links to bypass obstacles of various geometric shapes, and place the relay nodes in specified available regions. When the number of relay nodes is large, the searching space can grow exponentially, and thus, a grouping optimization technique is proposed to reduce the searching time. We numerically demonstrate that the grouping optimization can provide suboptimal solutions close to the optimal solutions, but the average searching time linearly grows with the number of relay nodes. Two useful theorems are presented to reveal insights into the optimal relay locations. Simulation results show that our proposed optimization framework can effectively provide desirable solution to the problem of optimal relay nodes placement. © 2015 IEEE.
Original languageEnglish (US)
Pages (from-to)5240-5250
Number of pages11
JournalIEEE Transactions on Wireless Communications
Issue number9
StatePublished - May 19 2015

Bibliographical note

KAUST Repository Item: Exported on 2020-10-01
Acknowledgements: This research is supported by an NSERC Discovery Grant. The associate editor coordinating the review of this paper and approving it for publication was N. C. Sagias.


Dive into the research topics of 'Relay Placement for FSO Multihop DF Systems With Link Obstacles and Infeasible Regions'. Together they form a unique fingerprint.

Cite this