Special Issue "Wireless Networks: Information Theoretic Perspectives"

A special issue of Entropy (ISSN 1099-4300). This special issue belongs to the section "Information Theory, Probability and Statistics".

Deadline for manuscript submissions: 15 February 2020.

Special Issue Editors

Prof. Dr. H. Vincent Poor
E-Mail Website
Guest Editor
Department of Electrical Engineering, Princeton University, Princeton, NJ 08544, USA
Interests: information theory and signal processing and their applications in wireless networks, energy systems and related fields
Dr. Alex Dytso
E-Mail Website
Guest Editor
Department of Electrical Engineering, Princeton University, Princeton, NJ 08544, USA
Interests: multi-user information theory and estimation theory and their applications in wireless networks

Special Issue Information

Dear Colleagues,

Network information theory is a framework for studying performance limits in communications over networks; as such, it is expected to continue to play an essential role in the future development of wireless networks, including 5G and beyond. This Special Issue aims to bring together the body of recent results in network information theory, in order to bolster its value and emphasize the importance it continues to play in the development of wireless communications. Previously unpublished contributions in the intersection networks information theory and wireless networks are solicited, including (but not limited to) the following:

  • Emerging information theoretic models for wireless communications;
  • Gaussian networks;
  • Capacity scaling laws;
  • Massive networks;
  • Random access;
  • Interference mitigation schemes;
  • Relaying techniques;
  • MIMO channels;
  • Massive MIMO;
  • Low latency communications;
  • Secure and private communications;
  • Low power communications;
  • Code design for networks;
  • Interactive communications and feedback;
  • Communication under channel uncertainty;
  • Mismatched network capacity;
  • Cloud and fog radio access networks.

All submitted manuscripts will be peer-reviewed, and accepted papers will be available via open access.

Prof. Dr. H. Vincent Poor
Dr. Alex Dytso
Guest Editors

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All papers will be peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Entropy is an international peer-reviewed open access monthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 1600 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Published Papers (2 papers)

Order results
Result details
Select all
Export citation of selected articles as:

Research

Open AccessArticle
Secure Retrospective Interference Alignment
Entropy 2019, 21(11), 1092; https://doi.org/10.3390/e21111092 - 07 Nov 2019
Abstract
In this paper, the K-user interference channel with secrecy constraints is considered with delayed channel state information at transmitters (CSIT). We propose a novel secure retrospective interference alignment scheme in which the transmitters carefully mix information symbols with artificial noises to ensure [...] Read more.
In this paper, the K-user interference channel with secrecy constraints is considered with delayed channel state information at transmitters (CSIT). We propose a novel secure retrospective interference alignment scheme in which the transmitters carefully mix information symbols with artificial noises to ensure confidentiality. Achieving positive secure degrees of freedom (SDoF) is challenging due to the delayed nature of CSIT, and the distributed nature of the transmitters. Our scheme works over two phases: Phase one, in which each transmitter sends information symbols mixed with artificial noises, and repeats such transmission over multiple rounds. In the next phase, each transmitter uses the delayed CSIT of the previous phase and sends a function of the net interference and artificial noises (generated in previous phase), which is simultaneously useful for all receivers. These phases are designed to ensure the decodability of the desired messages while satisfying the secrecy constraints. We present our achievable scheme for three models, namely: (1) K-user interference channel with confidential messages (IC-CM), and we show that 1 2 ( K 6 ) SDoF is achievable; (2) K-user interference channel with an external eavesdropper (IC-EE); and (3) K-user IC with confidential messages and an external eavesdropper (IC-CM-EE). We show that for the K-user IC-EE, 1 2 ( K 3 ) SDoF is achievable, and for the K-user IC-CM-EE, 1 2 ( K 6 ) is achievable. To the best of our knowledge, this is the first result on the K-user interference channel with secrecy constrained models and delayed CSIT that achieves an SDoF which scales with K , square-root of number of users. Full article
(This article belongs to the Special Issue Wireless Networks: Information Theoretic Perspectives)
Show Figures

Figure 1

Open AccessArticle
Ergodic Rate for Fading Interference Channels with Proper and Improper Gaussian Signaling
Entropy 2019, 21(10), 922; https://doi.org/10.3390/e21100922 - 23 Sep 2019
Abstract
This paper studies the performance of improper Gaussian signaling (IGS) over a 2-user Rayleigh single-input single-output (SISO) interference channel, treating interference as noise. We assume that the receivers have perfect channel state information (CSI), while the transmitters have access to only statistical CSI. [...] Read more.
This paper studies the performance of improper Gaussian signaling (IGS) over a 2-user Rayleigh single-input single-output (SISO) interference channel, treating interference as noise. We assume that the receivers have perfect channel state information (CSI), while the transmitters have access to only statistical CSI. Under these assumptions, we consider a signaling scheme, which we refer to as proper/improper Gaussian signaling or PGS/IGS, where at most one user may employ IGS. For the Rayleigh fading channel model, we characterize the statistical distribution of the signal-to-interference-plus-noise ratio at each receiver and derive closed-form expressions for the ergodic rates. By adapting the powers, we characterize the Pareto boundary of the ergodic rate region for the 2-user fading IC. The ergodic transmission rates can be attained using fixed-rate codebooks and no optimization is involved. Our results show that, in the moderate and strong interference regimes, the proposed PGS/IGS scheme improves the performance with respect to the PGS scheme. Additionally, we numerically compute the ergodic rate region of the full IGS scheme when both users can employ IGS and their transmission parameters are optimized by an exhaustive search. Our results suggest that most of the Pareto optimal points for the 2-user fading IC channel are attained when either both users transmit PGS or when one transmits PGS and the other transmits maximally improper Gaussian signals and time sharing is allowed. Full article
(This article belongs to the Special Issue Wireless Networks: Information Theoretic Perspectives)
Show Figures

Figure 1

Back to TopTop