Unspecified Christos N. Efrem Profile

Christos N. Efrem

SPIE Involvement:

Author

Publications (1)

This will count as one of your downloads.

You will have access to both the presentation and article (if available).

DOWNLOAD NOW

This content is available for download via your institution's subscription. To access this item, please sign in to your personal account.

Email or Username Forgot your username?

Password Forgot your password?

Show

Keep me signed in

No SPIE account? Create an account

Proceedings Article | 11 June 2021 Open Access

Low-complexity optimization algorithm for ground network design in optical satellite networks

Christos Efrem, Nikolaos Lyras, Charilaos Kourogiorgas, Athanasios Panagopoulos, Pantelis-Daniel Arapoglou

Proceedings Volume 11852, 118525Q (2021) https://doi.org/10.1117/12.2600010

Read Abstract +

Free space optics (FSO) is considered a promising technology for satellite communications due to its various advantages over radio-frequency (RF) systems, such as higher throughput, lower energy consumption and smaller mass. Nevertheless, optical satellite communication systems are heavily affected by atmospheric impairments, mainly by clouds. In order to cope with cloud coverage, site diversity technique is employed at the expense of installing extra optical ground stations (OGSs). As a consequence, the interest in ground network optimization is rapidly increasing with the aim to guarantee a given service availability. In this paper, a low-complexity optimization algorithm for ground network design in optical geostationary (GEO) satellite systems is presented, taking into account the spatial correlation between sites. Specifically, the objective is to choose a group of candidate OGSs that minimizes the overall cost of the ground network and meets certain availability requirements for every time period (thus incorporating the temporal variability of cloud coverage). Moreover, an extension of the methodology to optical medium-Earth-orbit (MEO) satellite systems is provided. Lastly, the performance of the proposed algorithm is evaluated via numerical experiments.

DOWNLOAD PAPER

My Library

You currently do not have any folders to save your paper to! Create a new folder below.

Folder Name

Folder Description

View contact details

UPDATE YOUR PROFILE

Is this your profile? Update it now.

Sign into your SPIE.org account

Don’t have a profile and want one?

Create an account on SPIE.org

Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks. You are receiving this notice because your organization may not have SPIE eBooks access.*

*Shibboleth/Open Athens users─please sign in to access your institution's subscriptions.

To obtain this item, you may purchase the complete book in print or electronic format on SPIE.org.

ORGANIZATIONAL
Sign in with credentials provided by your organization.

Organizational Username

Organizational Password

Show/Hide Password

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available

Members:

Non-members: ADD TO CART

Keywords/Phrases

Search In:

Publication Years