相关论文: Mixing a Covert and a Non-Covert User

Suppose that a transmitter Alice potentially wishes to communicate with a receiver Bob over an adversarially jammed binary channel. An active adversary James eavesdrops on their communication over a binary symmetric channel (BSC(q)), and…

In this paper, we present an achievable security scheme for an interference channel with arbitrary number of users. In this model, each receiver should be able to decode its intended message while it cannot decode any meaningful information…

We consider a cognitive network consisting of n random pairs of cognitive transmitters and receivers communicating simultaneously in the presence of multiple primary users. Of interest is how the maximum throughput achieved by the cognitive…

We establish the deterministic-code capacity region of a network with one transmitter and two receivers: an "ordinary receiver" and a "robust receiver." The channel to the ordinary receiver is a given (known) discrete memoryless channel…

In this paper, we investigate joint information theoretic secrecy and covert communication in a single-input multi-output (SIMO) system where a transmitter (Alice) is communicating with two legitimate users (Bob and Carol). We consider that…

This paper investigates an uplink multi-user covert communication system with spatially distributed users. Unlike prior works that approximate channel statistics using averaged parameters and homogeneous assumptions, this study explicitly…

The goal of this paper is to provide a rigorous information-theoretic analysis of subnetworks of interference networks. We prove two coding theorems for the compound multiple-access channel with an arbitrary number of channel states. The…

A network covert channel is created that operates by modulating the time between web resource accesses, with an 'average web user' read-time used as a reference. While the covert channel may be classified as timing based, it does not…

We consider a two-user random access system in which each user independently selects a coding scheme from a finite set for every message, without sharing these choices with the other user or with the receiver. The receiver aims to decode…

Recently coded caching has emerged as a promising means to handle continuously increasing wireless traffic. However, coded caching requires users to cooperate in order to minimize the overall transmission rate. How users with heterogeneous…

Covert communication aims to shield the very existence of wireless transmissions in order to guarantee a strong security in wireless networks. In this work, for the first time we examine the possibility and achievable performance of covert…

In this work, we propose a covert communication scheme where the transmitter attempts to hide its transmission to a full-duplex receiver, from a warden that is to detect this covert transmission using a radiometer. Specifically, we first…

Communication networks have multiple users, each sending and receiving messages. A multiple access channel (MAC) models multiple senders transmitting to a single receiver, such as the uplink from many mobile phones to a single base station.…

This paper provides a review of recent advances in multi-user cooperative data transmission. The focus is on the inherent trade-off between achievable throughput and reliability of cooperative transmission. Research has shown that under a…

Inner and outer bounds are established on the capacity region of two-sender, two-receiver interference channels where one transmitter knows both messages. The transmitter with extra knowledge is referred to as being cognitive. The inner…

In cognitive radio (CR) networks, there are scenarios where the secondary (lower priority) users intend to communicate with each other by opportunistically utilizing the transmit spectrum originally allocated to the existing primary (higher…

An outer bound to the two-receiver discrete memoryless broadcast channel is presented. We compare it to the known outer bounds and show that the outer bound presented is at least as tight as the existing bounds.

Many organizations protect secure networked devices from non-secure networked devices by assigning each class of devices to a different logical network. These two logical networks, commonly called the host network and the guest network, use…

The work identifies the fundamental limits of coded caching when the K receiving users share {\Lambda}$\leq$ K helper-caches, each assisting an arbitrary number of different users. The main result is the derivation of the exact optimal…

A broadcast channel (BC) where the decoders cooperate via a one-sided link is considered. One common and two private messages are transmitted and the private message to the cooperative user should be kept secret from the cooperation-aided…