A Game Theoretic Optimization Framework for Home Demand Management Incorporating Local Energy Resources

Facilitated by advanced ICT infrastructure and optimization techniques, smart grid has the potential to bring significant benefits to the energy consumption management. This paper presents a game theoretic consumption scheduling framework based on the use of mixed integer programming to schedule consumption plan for residential consumers. In particular, the optimization framework incorporates integration of locally generated renewable energy in order to minimise dependency on conventional energy and the consumption cost. The game theoretic model is designed to coordinatively manage the scheduling of appliances of consumers. The Nash equilibrium of the game exists and the scheduling optimization converges to an equilibrium where all consumers can benefit from participating in. Simulation results are presented to demonstrate the proposed approach and the benefits of home demand management

MMSE-based beamforming techniques for relay broadcast channels

We propose minimum mean square error (MMSE) based beamforming techniques for a multiantenna relay network, where a base station (BS) equipped with multiple antennas communicates with a number of single antenna users through a multiantenna relay.We specifically solve three optimization problems: a) sum-power minimization problem b) mean square error (MSE) balancing problem and c)mixed quality of services (QoS) problem. Unfortunately, these problems are not jointly convex in terms of beamforming vectors at the BS and the relay amplification matrix. To circumvent this non-convexity issue, the original problems are divided into two subproblems where the beamforming vectors and the relay amplification matrix are alternately optimized while other one is fixed. Three iterative algorithms have been developed based on convex optimization techniques and general MSE duality. Simulation results have been provided to validate the convergence of the proposed algorithms

Sensitivity and Asymptotic Analysis of Inter-Cell Interference Against Pricing for Multi-Antenna Base Stations

We thoroughly investigate the downlink beamforming problem of a two-tier network in a reversed time-division duplex system, where the interference leakage from a tier-2 base station (BS) toward nearby uplink tier-1 BSs is controlled through pricing. We show that soft interference control through the pricing mechanism does not undermine the ability to regulate interference leakage while giving flexibility to sharing the spectrum. Then, we analyze and demonstrate how the interference leakage is related to the variations of both the interference prices and the power budget. Moreover, we derive a closed-form expression for the interference leakage in an asymptotic case, where both the charging BSs and the charged BS are equipped with a large number of antennas, which provides further insights into the lowest possible interference leakage that can be achieved by the pricing mechanism

Performance Analysis of Cache-Enabled Millimeter Wave Small Cell Networks

Millimeter wave (mmWave) small-cell networks can provide high regional throughput, but the backhaul requirement has become a performance bottleneck. This paper proposes a hybrid system that combines traditional backhaul-connected small base stations (SBSs) and cache-enabled SBSs to achieve the maximum area spectral efficiency (ASE) while saving backhaul consumption in mmWave small cell networks. We derive and compare the ASE results for both the traditional and hybrid networks, and also show that the optimal content placement to maximize ASE is to cache the most popular contents. Numerical results demonstrate the performance improvement of deploying cache-enabled SBSs. Furthermore, given a total caching capacity, it is revealed that there is a tradeoff between the cache-enabled SBSs density and individual cache size to maximize the ASE

A Hybrid Training-Time and Run-Time Defense Against Adversarial Attacks in Modulation Classification

Motivated by the superior performance of deep learning in many applications including computer vision and natural language processing, several recent studies have focused on applying deep neural network for devising future generations of wireless networks. However, several recent works have pointed out that imperceptible and carefully designed adversarial examples (attacks) can significantly deteriorate the classification accuracy. In this letter, we investigate a defense mechanism based on both training-time and run-time defense techniques for protecting machine learning-based radio signal (modulation) classification against adversarial attacks. The training-time defense consists of adversarial training and label smoothing, while the run-time defense employs a support vector machine-based neural rejection (NR). Considering a white-box scenario and real datasets, we demonstrate that our proposed techniques outperform existing state-of-the-art technologies

Parameter estimation and equalization techniques for communication channels with multipath and multiple frequency offsets

We consider estimation of frequency offset (FO) and equalization of a wireless communication channel, within a general framework which allows for different frequency offsets for various multipaths. Such a scenario may arise due to different Doppler shifts associated with various multipaths, or in situations where multiple basestations are used to transmit identical information. For this general framework, we propose an approximative maximum-likelihood estimator exploiting the correlation property of the transmitted pilot signal. We further show that the conventional minimum mean-square error equalizer is computationally cumbersome, as the effective channel-convolution matrix changes deterministically between symbols, due to the multiple FOs. Exploiting the structural property of these variations, we propose a computationally efficient recursive algorithm for the equalizer design. Simulation results show that the proposed estimator is statistically efficient, as the mean-square estimation error attains the Crame´r-Rao lower bound. Further, we show via extensive simulations that our proposed scheme significantly outperforms equalizers not employing FO estimation

A Phase Feedback Based Extended Space-Time Block Code for Enhancement of Diversity

This is a conference paper [© IEEE]. It is also available at: http://ieeexplore.ieee.org/ Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.In this paper we propose a generalization of extended orthogonal space-time block codes (EO-STBCs) for MIMO (multi-input/multi-output) channels using four transmit antennas for quasi-static flat fading channels. Since full rate and complex orthogonal space-time block codes (STBCs) do not exist for more than two transmit antennas, we propose a feedback based STBC scheme. In this scheme, phases of certain symbols are rotated according to the feedback from the receiver which is equivalent to rotating the phases of the corresponding channel coefficients. Simulation results show that this rotation phase feedback method achieves a satisfactory performance and outperforms the previous closed-loop space-time block codes, even when the feedback is quantized

A game-theoretic approach to transmitter covariance matrix design for broadband MIMO Gaussian interference channels

This is a conference paper [© IEEE]. It is also available at: http://ieeexplore.ieee.org/ Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.A game-theoretic approach to transmitter covariance matrix design for broadband MIMO Gaussian interference channels Anandkumar, A.J.G. Lambotharan, S. Chambers, J.A. Dept of Electron. & Electr. Eng., Loughborough Univ., Loughborough, UK This paper appears in: Statistical Signal Processing, 2009. SSP '09. IEEE/SP 15th Workshop on Publication Date: Aug. 31 2009-Sept. 3 2009 On page(s): 301 - 304 E-ISBN: 978-1-4244-2711-6 Location: Cardiff ISBN: 978-1-4244-2709-3 INSPEC Accession Number:10961923 Digital Object Identifier: 10.1109/SSP.2009.5278580 Current Version Published: 2009-10-06 Abstract A game-theoretic approach to the maximization of the information rates of broadband multi-input-multi-output (MIMO) Gaussian interference channels is proposed. The problem is cast as a strategic noncooperative game with the MIMO links as players and the information rates as payoff functions. The Nash equilibrium solution of this game is a waterfilling operation and sufficient conditions for its existence and uniqueness are presented. A distributed algorithm which requires no cooperation among the users is presented along with conditions for guaranteed global convergence of the proposed algorithm. The efficacy of the proposed scheme is confirmed through a design example

A basic probability assignment methodology for unsupervised wireless intrusion detection

YesThe broadcast nature of wireless local area networks has made them prone to several types of wireless injection attacks, such as Man-in-the-Middle (MitM) at the physical layer, deauthentication, and rogue access point attacks. The implementation of novel intrusion detection systems (IDSs) is fundamental to provide stronger protection against these wireless injection attacks. Since most attacks manifest themselves through different metrics, current IDSs should leverage a cross-layer approach to help toward improving the detection accuracy. The data fusion technique based on the Dempster–Shafer (D-S) theory has been proven to be an efficient technique to implement the cross-layer metric approach. However, the dynamic generation of the basic probability assignment (BPA) values used by D-S is still an open research problem. In this paper, we propose a novel unsupervised methodology to dynamically generate the BPA values, based on both the Gaussian and exponential probability density functions, the categorical probability mass function, and the local reachability density. Then, D-S is used to fuse the BPA values to classify whether the Wi-Fi frame is normal (i.e., non-malicious) or malicious. The proposed methodology provides 100% true positive rate (TPR) and 4.23% false positive rate (FPR) for the MitM attack and 100% TPR and 2.44% FPR for the deauthentication attack, which confirm the efficiency of the dynamic BPA generation methodology.Gulf Science, Innovation and Knowledge Economy Programme of the U.K. Government under UK-Gulf Institutional Link Grant IL 279339985 and in part by the Engineering and Physical Sciences Research Council (EPSRC), U.K., under Grant EP/R006385/1