No abstract

Wireless sensor networks (WSNs) have attracted substantial research interest, especially in the context of performing monitoring and surveillance tasks. However, it is challenging to strike compelling trade-offs amongst the various conflicting optimization criteria, such as the network's energy dissipation, packet-loss rate, coverage and lifetime. This paper provides a tutorial and survey of recent research and development efforts addressing this issue by using the technique of multi-objective optimization (MOO). First, we provide an overview of the main optimization objectives used in WSNs. Then, we elaborate on various prevalent approaches conceived for MOO, such as the family of mathematical programming based scalarization methods, the family of heuristics/metaheuristics based optimization algorithms, and a variety of other advanced optimization techniques. Furthermore, we summarize a range of recent studies of MOO in the context of WSNs, which are intended to provide useful guidelines for researchers to understand the referenced literature. Finally, we discuss a range of open problems to be tackled by future research.

In this paper, linear transceiver design for multi-hop amplify-and-forward (AF) multiple-input multiple-out (MIMO) relaying systems with Gaussian distributed channel estimation errors is investigated. Commonly used transceiver design criteria including weighted mean-square-error (MSE) minimization, capacity maximization, worst-MSE/MAX-MSE minimization and weighted sum-rate maximization, are considered and unified into a single matrix-variate optimization problem. A general robust design algorithm is proposed to solve the unified problem. Specifically, by exploiting majorization theory and properties of matrix-variate functions, the optimal structure of the robust transceiver is derived when either the covariance matrix of channel estimation errors seen from the transmitter side or the corresponding covariance matrix seen from the receiver side is proportional to an identity matrix. Based on the optimal structure, the original transceiver design problems are reduced to much simpler problems with only scalar variables whose solutions are readily obtained by iterative water-filling algorithm. A Chengwen Xing and Zesong Fei are with the

No abstract

No abstract

In this paper, a unified linear minimum mean-square-error (LMMSE) transceiver design framework is investigated, which is suitable for a wide range of wireless systems. The unified design is based on an elegant and powerful mathematical programming technology termed as quadratic matrix programming (QMP). Based on QMP it can be observed that for different wireless systems, there are certain common characteristics which can be exploited to design LMMSE transceivers e.g., the quadratic forms. It is also discovered that evolving from a point-to-point MIMO system to various advanced wireless systems such as multi-cell coordinated systems, multi-user MIMO systems, MIMO cognitive radio systems, amplifyand-forward MIMO relaying systems and so on, the quadratic nature is always kept and the LMMSE transceiver designs can always be carried out via iteratively solving a number of QMP problems. A comprehensive framework on how to solve QMP problems is also given. The work presented in this paper is likely to be the first shot for the transceiver design for the future ever-changing wireless systems.

Abstract-Cognitive satellite-terrestrial networks (CSTNs) have been recognized as a promising network architecture for addressing spectrum scarcity problem in next-generation communication networks. In this paper, we investigate the secure transmission for CSTNs where the terrestrial base station (BS) serving as a green interference resource is introduced to enhance the security of the satellite link. Adopting a stochastic model for the channel state information (CSI) uncertainty, we propose a secure and robust beamforming framework to minimize the transmit power, while satisfying a range of outage (probabilistic) constraints concerning the signal-to-interference-plus-noise ratio (SINR) recorded at the satellite user and the terrestrial user, the leakage-SINR recorded at the eavesdropper, as well as the interference power recorded at the satellite user. The resulting robust optimization problem is highly intractable and the key observation is that the highly intractable probability constraints can be equivalently reformulated as the deterministic versions with Gaussian statistics. In this regard, we develop two robust reformulation methods, namely S-Procedure and Bernstein-type inequality restriction techniques, to obtain a safe approximate solution. In the meantime, the computational complexities of the proposed schemes are analyzed. Finally, the effectiveness of the proposed schemes are demonstrated by numerical results with different system parameters.

No abstract