The fifth-generation cellular network requires dense installation of radio base stations (BS) to support the ever-increasing demands high throughput and coverage. ongoing deployment has triggered some health concerns among community. To address this uncertainty, we propose an EMF-aware probabilistic shaping design for hardware-distorted communication systems. proposed scheme aims minimize human...

In this paper, we consider multi-dimensional mean reflected backward stochastic differential equations (BSDEs) with possibly non-convex reflection domains along inward normal direction, which were introduced by Briand, Elie and Hu [6] in the scalar case. We first apply a fixed-point argument to establish uniqueness existence result under an additional bounded condition on driver. Then, help of ...

We develop sparse array receive beamformer design methods achieving maximum signal-to-interference plus noise ratio (MaxSINR) for wideband sources and jammers. Both tapped delay line (TDL) filtering the DFT realizations to processing are considered. The sparsity stems from limited number of available RF transmission chains that switch between sensors, thereby configuring different arrays at tim...

In this paper, we propose a joint resource allocation algorithm for energy efficiency (EE) of a cloud radio access network (C-RAN). To tackle the joint optimization problem, we utilize a successive convex approximation (SCA) based joint antenna selection and power allocation (JASPA) algorithm. In addition, we propose an improved multi-candidate remote radio heads (RRHs) user association (MCRUA)...

This paper formulates a novel energy-aware utility optimisation (EUO) problem for joint multi-path routing and medium access control (MAC) layer retransmission control in time division multiple access (TDMA)-based wireless sensor networks (WSNs). As the EUO problem is non-convex and inseparable, we propose a heuristic method called Successive Alternating Convex Approximation (SACA) to approxima...

The Shapley-Folkman theorem and its corollaries [ 1, 2, 3, 4, 5, 6, 81 provide strong bounds on the distance between the sum of a family of nonconvex sets and the convex hull of the sum. Proofs of the theorem are nonconstructive, and require moderately advanced analysis. The proof developed below is based on elementary considerations. It provides an approximation sequentially with the successiv...

A function on R with multiple local minima is approximated from below, via linear programming, by a linear combination of convex kernel functions using sample points from the given function. The resulting convex kernel underestimator is then minimized, using either a linear equation solver for a linear-quadratic kernel or by a Newton method for a Gaussian kernel, to obtain an approximation to a...

Peer-to-peer (P2P) networks support a wide variety of network services including elastic such as file-sharing and downloading inelastic real-time multiparty conferencing. Each peer who acquires service will receive certain level satisfaction if the is provided with amount resource. The utility function used to describe when acquiring service. In this paper we consider optimal resource allocatio...

The Delay Constrained Relay Node Placement (DCRNP) problem in Wireless Sensor Networks (WSNs) aims to deploy minimum relay nodes such that for each sensor node there is a path connecting this sensor node to the sink without violating delay constraint. As WSNs are gradually employed in time-critical applications, the importance of the DCRNP problem becomes noticeable. For the NP-hard nature of D...