The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Many optimization problems in communications and signal processing can be formulated as rank-one constrained optimization problems. This has motivated the development of methods to solve such problem in specific scenarios. However, due to the non-convex nature of the rank-one constraint, limited progress has been made in solving generic rank-one constrained optimization problems. In particular, the...
Massive multiple input multiple output (MIMO) has emerged as a promising technology, which utilizes a large number of antennas at base stations (BSs) to significantly improve the spectral efficiency in terms of bits/s/Hz while reducing the radiated signal power. A critical issue with massive MIMO is the costly circuit power consumption, which is proportional to the number of antennas. This paper develops...
Alternating direction method of multipliers (ADMM) is a promising approach to solve “big data” problems due to its efficient variable decomposition and fast convergence. However, it is subject to the following two fundamental assumptions: no contradiction among multiple controllers' objectives and ideal feedback from the agents to the controllers. In this paper, a multiple-leader multiple-follower...
Proactively pushing content to users has emerged as a promising way of coping with the explosively growing traffic demand of next-generation mobile networks. However, it is still unclear whether content pushing can improve the energy efficiency of hard delay-constrained communications over additive white Gaussian noise (AWGN) channels. With pushing, the energy consumption can be reduced by increasing...
The arbitrarily varying channel (AVC) models communication over a channel that varies in an arbitrary and unknown manner from channel use to channel use. This paper considers the AVC under list decoding and studies the corresponding list capacity. In particular, the list capacity function is shown to be discontinuous and the corresponding discontinuity points are characterized for all possible list...
This paper studies a two-user state-dependent Gaussian multiple-access channel with state noncausally known at one encoder. Two new outer bounds on the capacity region are derived, which improve uniformly over the best known (genie-aided) outer bound. The two corner points of the capacity region as well as the sum rate capacity are established, and it is shown that a single-letter solution is adequate...
This paper considers a problem of communication over an additive noise channel where the noise is distributed according to a Generalized Gaussian (GG) distribution. In the first part of the paper, a number of properties of the family of GG distributions are derived which are of independent interest. For example, considerable attention is given to the properties of the characteristic function of the...
A Gaussian multiple-input multiple-output wiretap channel in which the eavesdropper and legitimate receiver are equipped with arbitrary numbers of antennas and the transmitter has two antennas is studied in this paper. It is shown that the secrecy capacity of this channel can be achieved by linear precoding. The optimal precoding and power allocation schemes achieving the secrecy capacity are developed...
In this paper, a generalized Ozarow-Wyner capacity bound is presented that holds for arbitrary noise channels. The bound is then used to approximate the capacity of a large class of additive noise channels that are subject to a p-th moment input constraint, where p is some positive real number, as well as to the Cauchy noise channel with a logarithmic moment constraint. For both channel models the...
This paper studies the maximum secrecy rate for a semi-deterministic wiretap channel, in which the channel between the transmitter and the legitimate receiver is deterministic, while that between the transmitter and the eavesdropper is a discrete memoryless channel. For a given decoding error probability and information leakage (measured by the total variation distance), the optimal second-order secrecy...
In this paper, the η-Nash equilibrium (η-NE) region of the two-user linear deterministic interference channel (IC) with noisy channel-output feedback is characterized for all η > 0. The η-NE region, a subset of the capacity region, contains the set of all achievable information rate pairs that are stable in the sense of an η-NE. More specifically, given an η-NE coding scheme, there does not exist...
Cloud storage is vulnerable to advanced persistent threats (APTs), in which an attacker launches stealthy, continuous, well-funded and targeted attacks on storage devices. In this paper, cumulative prospect theory (CPT) is applied to study the interactions between a defender of cloud storage and an APT attacker when each of them makes subjective decisions to choose the scan interval and attack interval,...
In this paper, the application of non-orthogonal multiple access (NOMA) to millimeter-wave (mmWave) communications is considered, where random beamforming is used in order to reduce the system overhead. Stochastic geometry is used to characterize the performance of the proposed mmWave-NOMA transmission scheme, by using the key features of mmWave systems, e.g., mmWave transmission is highly directional...
Proactive pushing and caching has recently emerged as a promising technology to improve the quality of service in mobile networks. Given the fact that users' demand for content is largely driven by social networking, this paper combines the analysis of social networking with proactive pushing and caching by constructing a human-in-the-loop system model with a physical multicasting transmission. By...
Multiple-input multiple-output (MIMO) systems are threatened by smart attackers, who apply programmable radio devices such as software defined radios to perform multiple types of attacks such as eavesdropping, jamming and spoofing. In this paper, MIMO transmission in the presence of smart attacks is formulated as a noncooperative game, in which a MIMO transmitter chooses its transmit power level and...
The envisioned Internet of Things (IoT) will involve a massive deployment of objects connected through wireless cells. While commercial solutions are already available, the fundamental limits of such networks in terms of node density, achievable rates or reliability are not known. To address this question, this paper uses a large scale Multiple Access Channel (MAC) to model IoT nodes randomly distributed...
In this paper, a two-dimensional anti-jamming communication scheme for cognitive radio networks is developed, in which a secondary user (SU) exploits both spread spectrum and user mobility to address jamming attacks, while not interfering with primary users. By applying a deep Q-network algorithm, this scheme determines whether to recommend that the SU leave an area of heavy jamming and chooses a...
Universal compressed sensing algorithms recover a “structured” signal from its under-sampled linear measurements, without knowing its distribution. The recently developed minimum entropy pursuit (MEP) optimization suggests a framework for developing universal compressed sensing algorithms. In the noiseless setting, among all signals that satisfy the measurement constraints, MEP seeks the “simplest”...
In this paper, we consider a resource allocation game with binary preferences and limited capacities over large scale networks and propose a novel randomized algorithm for searching its pure-strategy Nash equilibrium points. It is known that such games always admit a pure-strategy Nash equilibrium and benefit from having a low price of anarchy. However, the best known theoretical results only provide...
Identifying arbitrary power grid topologies in real time based on measurements in the grid is studied. A learning based approach is developed: binary classifiers are trained to approximate the maximum a-posteriori probability (MAP) detectors that each identifies the status of a distinct line. An efficient neural network architecture in which features are shared for inferences of all line statuses...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.