Related papers: Random Access with Physical-layer Network Coding
This letter proposes a new physical layer authentication mechanism operating at the physical layer of a communication system where the receiver has partial control of the channel conditions (e.g., using an intelligent reflecting surface).…
Irregular repetition slotted Aloha (IRSA) has shown significant advantages as a modern technique for uncoordinated random access with massive number of users due to its capability of achieving theoretically a throughput of $1$ packet per…
This paper presents CRESM, a novel collision resolution method for decoding collided packets in random-access wireless networks. In a collision, overlapping signals from several sources are received simultaneously at a receiver. CRESM…
With the rapid expansion of the Internet of Things, the efficient sharing of the wireless medium by a large amount of simple transmitters is becoming essential. Scheduling-based solutions are inefficient for this setting, where small data…
In randomly deployed networks, such as sensor networks, an important problem for each node is to discover its \textit{neighbor} nodes so that the connectivity amongst nodes can be established. In this paper, we consider this problem by…
Due to the short and bursty incoming messages, channel access activities in a wireless random access system are often fractional. The lack of frequent data support consequently makes it difficult for the receiver to estimate and track the…
We propose a coordinated random access scheme for industrial internet-of-things (IIoT) scenarios, with machine-type devices (MTDs) generating sporadic correlated traffic. This occurs, e.g., when external events trigger data generation at…
Effective and reliable data retrieval is critical for the feasibility of DNA storage, and the development of random access efficiency plays a key role in its practicality and reliability. In this paper, we study the Random Access Problem,…
A new coding and queue management algorithm is proposed for communication networks that employ linear network coding. The algorithm has the feature that the encoding process is truly online, as opposed to a block-by-block approach. The…
We propose an uncoordinated all-to-all broadcast protocol for periodic messages in vehicular networks based on coded slotted ALOHA (CSA). Unlike classical CSA, each user acts as both transmitter and receiver in a half-duplex mode. As in…
Motivated by the proliferation of real-time applications in multimedia communication systems, tactile Internet, and cyber-physical systems, supporting delay-constrained traffic becomes critical for such systems. In delay-constrained…
Optical wireless communication (OWC) has the potential to provide high communication speeds that support the massive use of the Internet that is expected in the near future. In OWC, optical access points (APs) are deployed on the celling to…
We analyse an ALOHA-type random multiple-access protocol where users have local interactions. We show that the fluid model of the system workload satisfies a certain differential equation. We obtain a sufficient condition for the stability…
Collisions with hidden terminals is a major cause of performance degradation in 802.11 and likewise wireless networks. Carrier sense multiple access with collision avoidance (CSMA/CA) is utilized to avoid collisions at the cost of spatial…
We address the problem of optimizing the throughput of network coded traffic in mobile networks operating in challenging environments where connectivity is intermittent and locally available memory space is limited. Random linear network…
Massive MIMO systems, where the base stations are equipped with hundreds of antennas, are an attractive way to handle the rapid growth of data traffic. As the number of users increases, the initial access and handover in contemporary…
We propose a mechanism that incorporates network coding into TCP with only minor changes to the protocol stack, thereby allowing incremental deployment. In our scheme, the source transmits random linear combinations of packets currently in…
We propose a contention-based random-access protocol, designed for wireless networks where the number of users is not a priori known. The protocol operates in rounds divided into equal-duration slots, performing at the same time estimation…
Motivated by the analogy between successive interference cancellation and iterative belief-propagation on erasure channels, irregular repetition slotted ALOHA (IRSA) strategies have received a lot of attention in the design of medium access…
We assess the practicality of random network coding by illuminating the issue of overhead and considering it in conjunction with increasingly long packets sent over the erasure channel. We show that the transmission of increasingly long…