34,112 research outputs found
Random Access Protocols for Massive MIMO
5G wireless networks are expected to support new services with stringent
requirements on data rates, latency and reliability. One novel feature is the
ability to serve a dense crowd of devices, calling for radically new ways of
accessing the network. This is the case in machine-type communications, but
also in urban environments and hotspots. In those use cases, the high number of
devices and the relatively short channel coherence interval do not allow
per-device allocation of orthogonal pilot sequences. This article motivates the
need for random access by the devices to pilot sequences used for channel
estimation, and shows that Massive MIMO is a main enabler to achieve fast
access with high data rates, and delay-tolerant access with different data rate
levels. Three pilot access protocols along with data transmission protocols are
described, fulfilling different requirements of 5G services
Characterization of Coded Random Access with Compressive Sensing based Multi-User Detection
The emergence of Machine-to-Machine (M2M) communication requires new Medium
Access Control (MAC) schemes and physical (PHY) layer concepts to support a
massive number of access requests. The concept of coded random access,
introduced recently, greatly outperforms other random access methods and is
inherently capable to take advantage of the capture effect from the PHY layer.
Furthermore, at the PHY layer, compressive sensing based multi-user detection
(CS-MUD) is a novel technique that exploits sparsity in multi-user detection to
achieve a joint activity and data detection. In this paper, we combine coded
random access with CS-MUD on the PHY layer and show very promising results for
the resulting protocol.Comment: Submitted to Globecom 201
Perfect tag identification protocol in RFID networks
Radio Frequency IDentification (RFID) systems are becoming more and more
popular in the field of ubiquitous computing, in particular for objects
identification. An RFID system is composed by one or more readers and a number
of tags. One of the main issues in an RFID network is the fast and reliable
identification of all tags in the reader range. The reader issues some queries,
and tags properly answer. Then, the reader must identify the tags from such
answers. This is crucial for most applications. Since the transmission medium
is shared, the typical problem to be faced is a MAC-like one, i.e. to avoid or
limit the number of tags transmission collisions. We propose a protocol which,
under some assumptions about transmission techniques, always achieves a 100%
perfomance. It is based on a proper recursive splitting of the concurrent tags
sets, until all tags have been identified. The other approaches present in
literature have performances of about 42% in the average at most. The
counterpart is a more sophisticated hardware to be deployed in the manufacture
of low cost tags.Comment: 12 pages, 1 figur
Combined 3D thinning and greedy algorithm to approximate realistic particles with corrected mechanical properties
The shape of irregular particles has significant influence on micro- and
macro-scopic behavior of granular systems. This paper presents a combined 3D
thinning and greedy set-covering algorithm to approximate realistic particles
with a clump of overlapping spheres for discrete element method (DEM)
simulations. First, the particle medial surface (or surface skeleton), from
which all candidate (maximal inscribed) spheres can be generated, is computed
by the topological 3D thinning. Then, the clump generation procedure is
converted into a greedy set-covering (SCP) problem.
To correct the mass distribution due to highly overlapped spheres inside the
clump, linear programming (LP) is used to adjust the density of each component
sphere, such that the aggregate properties mass, center of mass and inertia
tensor are identical or close enough to the prototypical particle. In order to
find the optimal approximation accuracy (volume coverage: ratio of clump's
volume to the original particle's volume), particle flow of 3 different shapes
in a rotating drum are conducted. It was observed that the dynamic angle of
repose starts to converge for all particle shapes at 85% volume coverage
(spheres per clump < 30), which implies the possible optimal resolution to
capture the mechanical behavior of the system.Comment: 34 pages, 13 figure
- …