Related papers: Channel Coding in Random Access Communication over…
This article examines the queueing performance of communication systems that transmit encoded data over unreliable channels. A fading formulation suitable for wireless environments is considered where errors are caused by a discrete channel…
Real-time applications require latencies on the order of a millisecond with very high reliabilities, paralleling the requirements for high-performance industrial control. Current wireless technologies like WiFi, Bluetooth, LTE, etc. are…
Code Division Multiple Access (CDMA) in which the spreading code assignment to users contains a random element has recently become a cornerstone of CDMA research. The random element in the construction is particular attractive as it…
This study focuses on (traditional and unsourced) multiple-access communication over a single transmit and multiple ($M$) receive antennas. We assume full or partial channel state information (CSI) at the receiver. It is known that to fully…
This letter proposes a novel random medium access control (MAC) based on a transmission opportunity prediction, which can be measured in a form of a conditional success probability given transmitter-side interference. A transmission…
We consider the problem of universally communicating over an unknown and arbitrarily varying channel, using feedback. The focus of this paper is on determining the input behavior, and specifically, a prior distribution which is used to…
WLAN is one of the most successful applications of wireless communications in daily life because of low cost and ease of deployment. The enabling technique for this success is the use of random access schemes for the wireless channel.…
This paper studies the random-coding exponent of joint source-channel coding for the multiple-access channel with correlated sources. For each user, by defining a threshold, the messages of each source are partitioned into two classes. The…
Random access is a multiple access communication protocol where the users simultaneously communicate with a base station (BS) in an uncoordinated fashion. In this work, we consider the problem of multiuser detection in a random access…
In this paper, we consider a distributed reception scenario where a transmitter broadcasts a signal to multiple geographically separated receive nodes over fading channels, and each node forwards a few bits representing a processed version…
In this work, we derive achievable rate regions for the three-user interference channels with asymmetric transmitter cooperation and various decoding capabilities at the receivers. The three-user channel facilitates different ways of…
Multiple access technology played an important role in wireless communication in the last decades: it increases the capacity of the channel and allows different users to access the system simultaneously. However, the conventional multiple…
In this paper, we study the problem of secret communication over a multiple-access channel with a common message. Here, we assume that two transmitters have confidential messages, which must be kept secret from the wiretapper (the second…
In this paper, we consider the problem of exchanging channel state information in a wireless network such that a subset of the clients can obtain the complete channel state information of all the links in the network. We first derive the…
Joint message and state transmission under arbitrarily varying jamming is investigated in this paper. The problem is modeled as the transmission over a channel with random states with a fixed distribution and jamming that varies in an…
In this paper, we study the problem of secret communication over a Compound Multiple Access Channel (MAC). In this channel, we assume that one of the transmitted messages is confidential that is only decoded by its corresponding receiver…
Error probabilities of random codes for memoryless channels are considered in this paper. In the area of communication systems, admissible error probability is very small and it is sometimes more important to discuss the relative gap…
This paper considers a class of multi-channel random access algorithms, where contending devices may send multiple copies (replicas) of their messages to the central base station. We first develop a hypothetical algorithm that delivers a…
Not only is network coding essential to achieve the capacity of a single-session multicast network, it can also help to improve the throughput of wireless networks with multiple unicast sessions when overheard information is available. Most…
Wireless systems are increasingly used for Machine-Type Communication (MTC), where the users sporadically send very short messages. In such a setting, the overhead imposed by channel estimation is substantial, thereby demanding noncoherent…