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.
In this paper we obtain capacity region for discrete memoryless 2-receiver less noisy broadcast channel when channel state is known only at the receivers, then; this region is possibly extended to discrete time and continuous alphabet fading Gaussian 2-receiver less noisy broadcast channel and ergodic capacity of this fading channel is obtained.
This paper considers communication over the point-to-point Gaussian channel with stationary and ergodic channel gain and full channel state information. The capacity of this channel can be achieved in a straightforward manner via any capacity-achieving codebook for the non-fading Gaussian channel, in conjunction with separable coding, i.e., coding independently over each fading state. Despite its...
This paper studies the problem of secure communication over a 2-transmitter multiple access channel (MAC) in the presence of an external eavesdropper. Two different secrecy constraints are considered: 1) individual secrecy (i.e., information leakage rate from each message to the eavesdropper is made vanishing) and 2) joint secrecy (i.e., information leakage rate from both messages to the eavesdropper...
Interleave division multiple access (IDMA) is a kind of multiple access technique which employs chip-level user-specific interleavers to separate each user's data from the superimposed signal of all users. Pilot-assisted channel estimation for IDMA and pilot-assisted timing tracking for IDMA have been respectively reported in the literature. In this paper, we propose a joint estimation of timing tracking...
Orthogonal Frequency Division Multiplexing, together with Multiple-Input Multiple-Output, is a pillar technique for new generation mobile networks, i.e., for the mobile networks in direction of 5G. Its crucial properties of robustness against fading and Inter-symbol Interference make it a great choice for the demanding data rates of future mobile networks. This paper presents a technique for additional...
In this paper, a duality between wiretap and state-dependent channels with non-causal channel state information at the transmitter is established. First, a common achievable scheme is described for a certain class of state-dependent and wiretap channels. Further, state-dependent and wiretap channels for which this scheme is capacity (resp. secrecy capacity) achieving are identified. These channels...
We study a secure communication scenario in which the channel is under two classes of attacks at the same time: a passive eavesdropper and an active jammer. This scenario is modelled using the arbitrarily varying wiretap channel (AVWC), in which the channel varies from one channel use to the other. It has been shown that in general reliable communication over AVWCs requires some sort of coordination...
In this work, we examine the secrecy capacity region of the block-fading broadcast channel with confidential messages (BCC) when the transmitter has limited knowledge of the channel. In particular, we consider a two-user communication system where the transmitter has one common message to be transmitted to both users and one confidential message intended to only one of them. The confidential message...
Wireless communication systems use adaptive modulation and coding (AMC) as well as hybrid ARQ (HARQ) to mitigate the effects of time-varying and error-prone channels. In this work, we analyze the benefits of combining HARQ and AMC adopting the throughput as a unique performance measure. The analysis of block-fading channels and error-prone decoders allows us to conclude that i) adding HARQ on top...
Partially overlapped channels (POCs) have been studied recently to improve network performance. However, the current OFDM-based 802.11 system is designed for co-channel communication, and does not support communication over POCs. Thus the coordination between POCs imposes a new challenge to WLANs. In this paper, we present DSN (Data Symbol Nulling), a novel communication strategy that leverages the...
In this work, we propose and optimize a new coding strategy designed to enhance the throughput of hybrid ARQ (HARQ) transmissions over i.i.d. block-fading channels where the channel state information (CSI) is unknown at the transmitter. Unlike in the conventional approach, where many blocks are exclusively assigned to carry the HARQ rounds of a single packet, we use a joint coding and the same channel...
Coded packet networks allow for proactive injection of redundant packets to compensate for packet loss. Link metrics are usually based on the estimated transmission counter (ETX). This metric is used to determine the expected number of coded packets needed, but does not make guarantees for a specific decoding probability. In this paper we show that relying on the ETX metric leads to a surprisingly...
Low probability of detection (LPD) communication refers to reliable transmission of information that is difficult to detect by an unauthorised adversary. This paper studies LPD communication over parallel Gaussian channels, which are used to model a variety of communication scenarios. First a lower bound on the miss detection probability is derived assuming the adversary employs Neyman-Pearson hypothesis...
This paper analyzes the strategic communication paradigm over a sensor network. We consider optimal communication strategies in a sensor network where each sensor is strategic and aims to maximize its own objective which involves type and source random variables. The objective of the receiver is to minimize the estimation error associated with the source. The orthogonal multiple access channel model...
In contrast to the network coding problem wherein the sinks in a network demand subsets of the source messages, in a network computation problem the sinks demand functions of the source messages. Similarly, in the functional index coding problem, the side information and demands of the clients include disjoint sets of functions of the information messages held by the transmitter instead of disjoint...
In this paper, we investigate the problem of secure broadcasting over block-fading channels with limited channel knowledge at the transmitter. More particularly, we analyze the effect of having imperfect channel state information (CSI) via a finite rate feedback on the throughput of a broadcast channel where the transmission is intended for multiple legitimate receivers in the presence of an eavesdropper...
In this paper, an achievability region and a converse region for the two-user Gaussian interference channel with noisy channel-output feedback (G-IC-NOF) are presented. The achievability region is obtained using a random coding argument and three well-known techniques: rate splitting, superposition coding and backward decoding. The converse region is obtained using some of the existing perfect-output...
The throughput of a conventional rate-compatible code based hybrid automatic repeat request (HARQ) protocol is lower-bounded by the rate of the mother code used. The mother code rate along with the highest puncture rate determine the operation range of the protocol in terms of the average received signal-to-noise ratio (SNR). In this paper, we propose a new HARQ protocol based on rate-compatible punctured...
A K-receiver degraded broadcast channel with secrecy outside a bounded range is studied, in which a transmitter sends K messages respectively to K receivers, and the channel quality gradually degrades from receiver K to receiver 1. Each receiver k is required to decode messages W1, …, Wk, for 1 ≤ k ≤ K. Furthermore, each message Wk should be kept secure from receivers with two-level worse channel...
Zero-Forcing (ZF) algorithm is used to eliminate interference in small scale interference network. With the number of users increasing, the traditional ZF algorithm does not work effectively due to the fact that the channel matrix cannot provide sufficient dimensions to isolate interference. In this paper, we propose a Coordinated Zero-Forcing Beamforming with Clustering(CZFC) scheme to improve the...
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.