2,623 research outputs found
Coded Slotted ALOHA: A Graph-Based Method for Uncoordinated Multiple Access
In this paper, a random access scheme is introduced which relies on the
combination of packet erasure correcting codes and successive interference
cancellation (SIC). The scheme is named coded slotted ALOHA. A bipartite graph
representation of the SIC process, resembling iterative decoding of generalized
low-density parity-check codes over the erasure channel, is exploited to
optimize the selection probabilities of the component erasure correcting codes
via density evolution analysis. The capacity (in packets per slot) of the
scheme is then analyzed in the context of the collision channel without
feedback. Moreover, a capacity bound is developed and component code
distributions tightly approaching the bound are derived.Comment: The final version to appear in IEEE Trans. Inf. Theory. 18 pages, 10
figure
An antenna switching based NOMA scheme for IEEE 802.15.4 concurrent transmission
This paper introduces a Non-Orthogonal Multiple Access (NOMA) scheme to support concurrent transmission of multiple IEEE 802.15.4 packets. Unlike collision avoidance Multiple Access Control (MAC), concurrent transmission supports Concurrent-MAC (C-MAC) where packet collision is allowed. The communication latency can be reduced by C-MAC because a user can transmit immediately without waiting for the completion of other users’ transmission. The big challenge of concurrent transmission is that error free demodulation of multiple collided packets hardly can be achieved due to severe Multiple Access Interference (MAI). To improve the demodulation performance with MAI presented, we introduce an architecture with multiple switching antennas sharing a single analog transceiver to capture spatial character of different users. Successive Interference Cancellation (SIC) algorithm is designed to separate collided packets by utilizing the spatial character. Simulation shows that at least five users can transmit concurrently to the SIC receiver equipped with eight antennas without sacrificing Packet Error Rate
ALOHA Random Access that Operates as a Rateless Code
Various applications of wireless Machine-to-Machine (M2M) communications have
rekindled the research interest in random access protocols, suitable to support
a large number of connected devices. Slotted ALOHA and its derivatives
represent a simple solution for distributed random access in wireless networks.
Recently, a framed version of slotted ALOHA gained renewed interest due to the
incorporation of successive interference cancellation (SIC) in the scheme,
which resulted in substantially higher throughputs. Based on similar principles
and inspired by the rateless coding paradigm, a frameless approach for
distributed random access in slotted ALOHA framework is described in this
paper. The proposed approach shares an operational analogy with rateless
coding, expressed both through the user access strategy and the adaptive length
of the contention period, with the objective to end the contention when the
instantaneous throughput is maximized. The paper presents the related analysis,
providing heuristic criteria for terminating the contention period and showing
that very high throughputs can be achieved, even for a low number for
contending users. The demonstrated results potentially have more direct
practical implications compared to the approaches for coded random access that
lead to high throughputs only asymptotically.Comment: Revised version submitted to IEEE Transactions on Communication
Simultaneous Transmission and Reception: Algorithm, Design and System Level Performance
Full Duplex or Simultaneous transmission and reception (STR) in the same
frequency at the same time can potentially double the physical layer capacity.
However, high power transmit signal will appear at receive chain as echoes with
powers much higher than the desired received signal. Therefore, in order to
achieve the potential gain, it is imperative to cancel these echoes. As these
high power echoes can saturate low noise amplifier (LNA) and also digital
domain echo cancellation requires unrealistically high resolution
analog-to-digital converter (ADC), the echoes should be cancelled or suppressed
sufficiently before LNA. In this paper we present a closed-loop echo
cancellation technique which can be implemented purely in analogue domain. The
advantages of our method are multiple-fold: it is robust to phase noise, does
not require additional set of antennas, can be applied to wideband signals and
the performance is irrelevant to radio frequency (RF) impairments in transmit
chain. Next, we study a few protocols for STR systems in carrier sense multiple
access (CSMA) network and investigate MAC level throughput with realistic
assumptions in both single cell and multiple cells. We show that STR can reduce
hidden node problem in CSMA network and produce gains of up to 279% in maximum
throughput in such networks. Finally, we investigate the application of STR in
cellular systems and study two new unique interferences introduced to the
system due to STR, namely BS-BS interference and UE-UE interference. We show
that these two new interferences will hugely degrade system performance if not
treated appropriately. We propose novel methods to reduce both interferences
and investigate the performances in system level.Comment: 20 pages. This manuscript will appear in the IEEE Transactions on
Wireless Communication
Multiple Access for Small Packets Based on Precoding and Sparsity-Aware Detection
Modern mobile terminals often produce a large number of small data packets.
For these packets, it is inefficient to follow the conventional medium access
control protocols because of poor utilization of service resources. We propose
a novel multiple access scheme that employs block-spreading based precoding at
the transmitters and sparsity-aware detection schemes at the base station. The
proposed scheme is well suited for the emerging massive multiple-input
multiple-output (MIMO) systems, as well as conventional cellular systems with a
small number of base-station antennas. The transmitters employ precoding in
time domain to enable the simultaneous transmissions of many users, which could
be even more than the number of receive antennas at the base station. The
system is modeled as a linear system of equations with block-sparse unknowns.
We first adopt the block orthogonal matching pursuit (BOMP) algorithm to
recover the transmitted signals. We then develop an improved algorithm, named
interference cancellation BOMP (ICBOMP), which takes advantage of error
correction and detection coding to perform perfect interference cancellation
during each iteration of BOMP algorithm. Conditions for guaranteed data
recovery are identified. The simulation results demonstrate that the proposed
scheme can accommodate more simultaneous transmissions than conventional
schemes in typical small-packet transmission scenarios.Comment: submitted to IEEE Transactions on Wireless Communication
- …