The host galaxies of luminous radio-quiet quasars

We present the results of a deep K-band imaging study which reveals the host galaxies around a sample of luminous radio-quiet quasars. The K-band images, obtained at UKIRT, are of sufficient quality to allow accurate modelling of the underlying host galaxy. Initially, the basic structure of the hosts is revealed using a modified Clean deconvolution routine optimised for this analysis. 2 of the 14 quasars are shown to have host galaxies with violently disturbed morphologies which cannot be modelled by smooth elliptical profiles. For the remainder of our sample, 2D models of the host and nuclear component are fitted to the images using the chi-squared statistic to determine goodness of fit. Host galaxies are detected around all of the quasars. The reliability of the modelling is extensively tested, and we find the host luminosity to be well constrained for 9 quasars. The derived average K-band absolute K-corrected host galaxy magnitude for these luminous radio-quiet quasars is =-25.15+/-0.04, slightly more luminous than an L* galaxy. The spread of derived host galaxy luminosities is small, although the spread of nuclear-to-host ratios is not. These host luminosities are shown to be comparable to those derived from samples of quasars of lower total luminosity and we conclude that there is no correlation between host and nuclear luminosity for these quasars. Nuclear-to-host ratios break the lower limit previously suggested from studies of lower nuclear luminosity quasars and Seyfert galaxies. Morphologies are less certain but, on the scales probed by these images, some hosts appear to be dominated by spheroids but others appear to have disk-dominated profiles.Comment: 16 pages, 8 figures, revised version to be published in MNRA

Denial of service attacks and challenges in broadband wireless networks

Broadband wireless networks are providing internet and related services to end users. The three most important broadband wireless technologies are IEEE 802.11, IEEE 802.16, and Wireless Mesh Network (WMN). Security attacks and vulnerabilities vary amongst these broadband wireless networks because of differences in topologies, network operations and physical setups. Amongst the various security risks, Denial of Service (DoS) attack is the most severe security threat, as DoS can compromise the availability and integrity of broadband wireless network. In this paper, we present DoS attack issues in broadband wireless networks, along with possible defenses and future directions

An Efficient Data Structure for Dynamic Two-Dimensional Reconfiguration

In the presence of dynamic insertions and deletions into a partially reconfigurable FPGA, fragmentation is unavoidable. This poses the challenge of developing efficient approaches to dynamic defragmentation and reallocation. One key aspect is to develop efficient algorithms and data structures that exploit the two-dimensional geometry of a chip, instead of just one. We propose a new method for this task, based on the fractal structure of a quadtree, which allows dynamic segmentation of the chip area, along with dynamically adjusting the necessary communication infrastructure. We describe a number of algorithmic aspects, and present different solutions. We also provide a number of basic simulations that indicate that the theoretical worst-case bound may be pessimistic.Comment: 11 pages, 12 figures; full version of extended abstract that appeared in ARCS 201

Robust beamforming in cognitive radio

In cognitive radio, it is crucial to control the interference from secondary users (SUs) to primary users (PUs). This paper studies the use of transmit beamforming in the cognitive secondary network for enhancing the performance of a SU while controlling the interference to the PUs. In particular, we propose to maximize the service probability of the SU with a number of probability constraints on the interference level at the PUs with the aid of imperfect channel state information (CSI). Modeling the CSI uncertainty as an additive Gaussian noise, it is shown that the optimum can be realized by second-order cone-programming (SOCP) in tandem with a one-dimensional search. Results reveal that the proposed approach provides a technique to tradeoff the performance between the PUs and the SU, making an analytical connection between non-robust and worst-case systems. © 2009 IEEE.published_or_final_versionThe 69th IEEE Vehicular Technology Conference (VTC Spring 2009), Barcelona, Spain, 26-29 April 2009. In Proceedings of the 69th IEEE - VTS, Spring 2009, p. 1-

Robust precoder design in MISO downlink based on quadratic channel estimation

In [1], it has been proposed that channel estimates in quadratic form can be obtained at the base station by sending training sequences to the mobiles where the received signals are forwarded back to the base for channel estimation. In this paper, we first examine the optimal training sequence design for such quadratic channel estimation and then analyze the error bound and statistics of the channel estimates in quadratic form. With the analytical results, two problems for a multiple-input single-output (MISO) antenna system in the downlink are constructed and optimally solved: Power minimization with individual users' 1) worst-case signal-to-interference plus noise ratio (SINR) and 2) average mean-square-error (MSE) constraints, through optimal multiuser MISO beamforming and power allocation. ©2008 IEEE.published_or_final_versio

Robust beamforming in cognitive radio

This letter considers the multi-antenna cognitive radio (CR) network, which has a single secondary user (SU) and coexists with a primary network of multiple users. Our objective is to maximize the service probability of the SU, subject to the interference constraints on the primary users (PUs) in the form of probability. Exploiting imperfect channel state information (CSI), with its error modeled by added Gaussian noise, we address the optimization for the beamforming weights at the secondary transmitter. In particular, this letter devises an iterative algorithm that can efficiently obtain the robust optimal beamforming solution. For the case with one PU, we show that a much simpler algorithm based on a closed-form solution for the antenna weights of a given power can be presented. Numerical results reveal that the optimal solution for the constructed problem provides an effective means to tradeoff the performance between the PUs and the SU, bridging the non-robust and worstcase based systems. © 2010 IEEE.published_or_final_versio

Secure Localization and Velocity Estimation in Mobile IoT Networks with Malicious Attacks

IEEE Secure localization and velocity estimation are of great importance in Internet of Things (IoT) applications and are particularly challenging in the presence of malicious attacks. The problem becomes even more challenging in practical scenarios in which attack information is unknown and anchor node location uncertainties occur due to node mobility and falsification of malicious nodes. This challenging problem is investigated in this paper. With reasonable assumptions on the attack model and uncertainties, the secure localization and velocity estimation problem is formulated as an intractable maximum a posterior (MAP) problem. A variational-message-passing (VMP) based algorithm is proposed to approximate the true posterior distribution iteratively and find the closed-form estimates of the location and velocity securely. The identification of malicious nodes is also achieved in the meantime. The convergence of the proposed VMP-based algorithm is also discussed. Numerical simulations are finally conducted and the results show the VMP-based joint localization and velocity estimation algorithm can approach the Bayesian Cramer Rao bound and is superior to other secure algorithms

Robust Localization for Mixed LOS/NLOS Environments With Anchor Uncertainties

Localization is particularly challenging when the environment has mixed line-of-sight (LOS) and non-LOS paths and even more challenging if the anchors’ positions are also uncertain. In the situations in which the parameters of the LOS-NLOS propagation error model and the channel states are unknown and uncertainties for the anchors exist, the likelihood function of a localizing node is computationally intractable. In this paper, assuming the knowledge of the prior distributions of the error model parameters and that of the channel states, we formulate the localization problem as the maximization problem of the posterior distribution of the localizing node. Then we apply variational distributions and importance sampling to approximate the true posterior distributions and estimate the target’s location using an asymptotic minimum mean-square-error (MMSE) estimator. Furthermore, we analyze the convergence and complexity of the proposed variational Bayesian localization (VBL) algorithm. Computer simulation results demonstrate that the proposed algorithm can approach the performance of the Bayesian Cramer-Rao bound (BCRB) and outperforms conventional algorithm

Energy Efficiency Optimization for Mutual-Coupling-Aware Wireless Communication System based on RIS-enhanced SWIPT

The widespread deployment of the Internet of Things (IoT) is promoting interest in simultaneous wireless information and power transfer (SWIPT), the performance of which can be further improved by employing a reconfigurable intelligent surface (RIS). In this paper, we propose a novel RIS-enhanced SWIPT system built on an electromagnetic-compliant framework. The mutual-coupling effects in the whole system are presented explicitly. Moreover, the reconfigurability of RIS is no longer expressed by the reflection-coefficient matrix but by the impedances of the tunable circuit. For comparison, both the no-coupling and the coupling-awareness cases are discussed. In particular, the energy efficiency (EE) is maximized by cooperatively optimizing the impedance parameters of the RIS elements as well as the active beamforming vectors at the base station (BS). For the coupling-awareness case, the considered problem is split into several sub-problems and solved alternatively due to its nonconvexity. Firstly, it is transformed into a more solvable form by applying the Neuman series approximation, which can be resolved iteratively. Then an alternative optimization (AO) framework and semi-definite relaxation (SDR), successive convex approximation (SCA), and Dinkelbach’s algorithm are applied to solve each sub-problem decomposed from it. Owning to the similarity between the two cases, the no-coupling one can be viewed as a reduced form of the coupling case and thus solved through a similar approach. Numerical results reveal the influence of mutual-coupling effects on the EE, especially in the RIS with closely spaced elements. In addition, physical beam designs are presented to demonstrate how the RIS assists SWIPT through various reflecting states in different conditions