Abstract
Drawing increasing attention, free-space optics (FSO) is a cost-effective technology to support data intensive communications. Cooperative diversity is considered to be an effective means for combating weather turbulence in FSO networks. In this paper, we consider the challenging problem of joint relay selection and power allocation in FSO networks. The objective was to maximize the FSO network-wide throughput under constraints of a given power budget and a limited number of FSO transceivers. The problem is formulated as a mixed integer nonlinear programming (MINLP) problem, which is NP-hard. We first adopt the reformulation-linearization technique (RLT) to derive an upper bound for the original MINLP problem. Due to the relaxation, the solutions obtained from RLT are infeasible. We then propose both centralized and distributed algorithms using bipartite matching and convex optimization to obtain highly competitive solutions. The proposed algorithms are shown to outperform the noncooperative scheme and an existing relay selection protocol with considerable gains through simulations.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
