806 research outputs found
Joint Beamforming and Power Allocation for Satellite-Terrestrial Integrated Networks With Non-Orthogonal Multiple Access
In this paper, we propose a joint optimization design for a non-orthogonal multiple access (NOMA)-based satellite-terrestrial integrated network (STIN), where a satellite multicast communication network shares the millimeter wave spectrum with a cellular network employing NOMA technology. By assuming that the satellite uses multibeam antenna array and the base station employs uniform planar array, we first formulate a constrained optimization problem to maximize the sum rate of the STIN while satisfying the constraint of per-antenna transmit power and quality-of-service requirements of both satellite and cellular users. Since the formulated optimization problem is NP-hard and mathematically intractable, we develop a novel user pairing scheme so that more than two users can be grouped in a cluster to exploit the NOMA technique. Based on the user clustering, we further propose to transform the non-convex problem into an equivalent convex one, and present an iterative penalty function-based beamforming (BF) scheme to obtain the BF weight vectors and power coefficients with fast convergence. Simulation results confirm the effectiveness and superiority of the proposed approach in comparison with the existing works
Artificial Noise-Aided Biobjective Transmitter Optimization for Service Integration in Multi-User MIMO Gaussian Broadcast Channel
This paper considers an artificial noise (AN)-aided transmit design for
multi-user MIMO systems with integrated services. Specifically, two sorts of
service messages are combined and served simultaneously: one multicast message
intended for all receivers and one confidential message intended for only one
receiver and required to be perfectly secure from other unauthorized receivers.
Our interest lies in the joint design of input covariances of the multicast
message, confidential message and artificial noise (AN), such that the
achievable secrecy rate and multicast rate are simultaneously maximized. This
problem is identified as a secrecy rate region maximization (SRRM) problem in
the context of physical-layer service integration. Since this bi-objective
optimization problem is inherently complex to solve, we put forward two
different scalarization methods to convert it into a scalar optimization
problem. First, we propose to prefix the multicast rate as a constant, and
accordingly, the primal biobjective problem is converted into a secrecy rate
maximization (SRM) problem with quality of multicast service (QoMS) constraint.
By varying the constant, we can obtain different Pareto optimal points. The
resulting SRM problem can be iteratively solved via a provably convergent
difference-of-concave (DC) algorithm. In the second method, we aim to maximize
the weighted sum of the secrecy rate and the multicast rate. Through varying
the weighted vector, one can also obtain different Pareto optimal points. We
show that this weighted sum rate maximization (WSRM) problem can be recast into
a primal decomposable form, which is amenable to alternating optimization (AO).
Then we compare these two scalarization methods in terms of their overall
performance and computational complexity via theoretical analysis as well as
numerical simulation, based on which new insights can be drawn.Comment: 14 pages, 5 figure
Rate-splitting multiple access for non-terrestrial communication and sensing networks
Rate-splitting multiple access (RSMA) has emerged as a powerful and flexible
non-orthogonal transmission, multiple access (MA) and interference management
scheme for future wireless networks. This thesis is concerned with the application of
RSMA to non-terrestrial communication and sensing networks. Various scenarios
and algorithms are presented and evaluated.
First, we investigate a novel multigroup/multibeam multicast beamforming strategy
based on RSMA in both terrestrial multigroup multicast and multibeam satellite
systems with imperfect channel state information at the transmitter (CSIT). The
max-min fairness (MMF)-degree of freedom (DoF) of RSMA is derived and shown
to provide gains compared with the conventional strategy. The MMF beamforming
optimization problem is formulated and solved using the weighted minimum mean
square error (WMMSE) algorithm. Physical layer design and link-level simulations
are also investigated. RSMA is demonstrated to be very promising for multigroup
multicast and multibeam satellite systems taking into account CSIT uncertainty
and practical challenges in multibeam satellite systems.
Next, we extend the scope of research from multibeam satellite systems to satellite-
terrestrial integrated networks (STINs). Two RSMA-based STIN schemes are
investigated, namely the coordinated scheme relying on CSI sharing and the co-
operative scheme relying on CSI and data sharing. Joint beamforming algorithms
are proposed based on the successive convex approximation (SCA) approach to
optimize the beamforming to achieve MMF amongst all users. The effectiveness and
robustness of the proposed RSMA schemes for STINs are demonstrated.
Finally, we consider RSMA for a multi-antenna integrated sensing and communications (ISAC) system, which simultaneously serves multiple communication users
and estimates the parameters of a moving target. Simulation results demonstrate
that RSMA is beneficial to both terrestrial and multibeam satellite ISAC systems by
evaluating the trade-off between communication MMF rate and sensing Cramer-Rao
bound (CRB).Open Acces
Coding, Multicast and Cooperation for Cache-Enabled Heterogeneous Small Cell Networks
Caching at the wireless edge is a promising approach to dealing with massive content delivery in heterogeneous wireless networks, which have high demands on backhaul. In this paper, a typical cache-enabled small cell network under heterogeneous file and network settings is considered using maximum distance separable (MDS) codes for content restructuring. Unlike those in the literature considering online settings with the assumption of perfect user request information, we estimate the joint user requests using the file popularity information and aim to minimize the long-term average backhaul load for fetching content from external storage subject to the overall cache capacity constraint by optimizing the content placement in all the cells jointly. Both multicast-aware caching and cooperative caching schemes with optimal content placement are proposed. In order to combine the advantages of multicast content delivery and cooperative content sharing, a compound caching technique, which is referred to as multicast-aware cooperative caching, is then developed. For this technique, a greedy approach and a multicast-aware in-cluster cooperative approach are proposed for the small-scale networks and large-scale networks, respectively. Mathematical analysis and simulation results are presented to illustrate the advantages of MDS codes, multicast, and cooperation in terms of reducing the backhaul requirements for cache-enabled small cell networks
Policy issues in interconnecting networks
To support the activities of the Federal Research Coordinating Committee (FRICC) in creating an interconnected set of networks to serve the research community, two workshops were held to address the technical support of policy issues that arise when interconnecting such networks. The workshops addressed the required and feasible technologies and architectures that could be used to satisfy the desired policies for interconnection. The results of the workshop are documented
Optimal and Robust Transmit Designs for MISO Channel Secrecy by Semidefinite Programming
In recent years there has been growing interest in study of multi-antenna
transmit designs for providing secure communication over the physical layer.
This paper considers the scenario of an intended multi-input single-output
channel overheard by multiple multi-antenna eavesdroppers. Specifically, we
address the transmit covariance optimization for secrecy-rate maximization
(SRM) of that scenario. The challenge of this problem is that it is a nonconvex
optimization problem. This paper shows that the SRM problem can actually be
solved in a convex and tractable fashion, by recasting the SRM problem as a
semidefinite program (SDP). The SRM problem we solve is under the premise of
perfect channel state information (CSI). This paper also deals with the
imperfect CSI case. We consider a worst-case robust SRM formulation under
spherical CSI uncertainties, and we develop an optimal solution to it, again
via SDP. Moreover, our analysis reveals that transmit beamforming is generally
the optimal transmit strategy for SRM of the considered scenario, for both the
perfect and imperfect CSI cases. Simulation results are provided to illustrate
the secrecy-rate performance gains of the proposed SDP solutions compared to
some suboptimal transmit designs.Comment: 32 pages, 5 figures; to appear, IEEE Transactions on Signal
Processing, 201
- …