English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

The Cooperative Rate-Splitting (CRS) scheme, proposed evolves fromconventional Rate Splitting (RS) and relies on forwarding a portion of the RSmessage by the relaying users. In terms of secrecy enhancement, it has beenshown that CRS outperforms its non-cooperative counterpart for a two-userMultiple Input Single Output (MISO) Broadcast Channel (BC). Given the massiveconnectivity requirement of 6G, we have generalized the existing securetwo-user CRS framework to the multi-user framework, where the highest-securityusers must be selected as the relay nodes. This paper addresses the problem ofmaximizing the Worst-Case Secrecy Rate (WCSR) in a UAV-aided downlink networkwhere a multi-antenna UAV Base-Station (UAV-BS) serves a group of users in thepresence of an external eavesdropper (Eve). We consider a practical scenario inwhich only imperfect channel state information of Eve is available at theUAV-BS. Accordingly, we conceive a robust and secure resource allocationalgorithm, which maximizes the WCSR by jointly optimizing both the SecureRelaying User Selection (SRUS) and the network parameter allocation problem,including the RS transmit precoders, message splitting variables, time slotsharing and power allocation. To circumvent the resultant non-convexity owingto the discrete variables imposed by SRUS, we propose a two-stage algorithmwhere the SRUS and network parameter allocation are accomplished in twoconsecutive stages. With regard to the SRUS, we study both centralized anddistributed protocols. On the other hand, for jointly optimizing the networkparameter allocation we resort to the Sequential Parametric ConvexApproximation (SPCA) algorithm. Our numerical results show that the proposedsolution significantly outperforms the existing benchmarks for a wide range ofnetwork loads in terms of the WCSR.

Secrecy Rate of the Cooperative RSMA-Aided UAV Downlink Relying on Optimal Relay Selection