In LoRa (Long Range), when a collision occurs in the network, each end-device has to retransmit its colliding frame, which reduces the throughput, and increases the energy consumption of the end-devices and the delay of the frames. In this paper, we propose an algorithm to decode colliding synchronized LoRa signals and thus improve the overall performance of the network. Indeed, we use successive transmissions of bitmaps by the end-devices to determine the correct symbols of each colliding frame, instead of retransmitting the whole frames. Simulation results show that our algorithm is able to significantly improve the overall throughput of LoRaWAN, and to decrease the energy consumption and the delay of the transmitters.
Few works have been done to study the collisions among synchronized signals in LoRa as in the following papers @cite_0 , @cite_5 and @cite_8 .
@cite_0 @cite_5 @cite_8
2964134481 2792195154 2056496658 2750647255 2042286431 2885353798 2142095519 2079150870 2104191204 2016802777 2170021087 2010725166 2121874910 2584088798 2139769293 2921341714 2524264252 2097395379 2168095411 2096586829
Long-range low-power wireless communications, such as LoRa, are used in many IoT and environmental monitoring applications. They typically increase the communication range to several kilometers, at the cost of reducing the bitrate to a few bits per seconds. Collisions further reduce the performance of these communications. In this paper, we propose two algorithms to decode colliding signals: one algorithm requires the transmitters to be slightly desynchronized, and the other requires the transmitters to be synchronized. To do so, we use the timing information to match the correct symbols to the correct transmitters. We show that our algorithms are able to significantly improve the overall throughput of LoRa. In this letter, we focus on the evaluation of link-level performance of LoRa technology, in the usual network scenario with a central gateway and high-density deployment of end-devices. LoRa technology achieves wide coverage areas, low power consumption and robustness to interference thanks to a chirp spread-spectrum modulation, in which chirps modulated with different spreading factors (SFs) are quasi-orthogonal. We focus on the performance analysis of a single receiver in presence of collisions. First, we analyze LoRa modulation numerically and show that collisions between packets modulated with different SFs can indeed cause packet loss if the interference power received is strong enough. Second, we validate such findings in experiments based on commercial devices and software-defined radios. Contradicting the common belief that SFs can be considered orthogonal, our results demonstrate that inter-SF collisions are indeed an issue in LoRa networks and, thus, allocating higher SFs to users far from the gateway might not necessarily improve their link capacity, in case of congested networks. We address several implementation issues related to multi-user physical layer network coding, in which the symbol-synchronous collision of an arbitrary number of signals is decoded. In particular we study the effect of frequency and phase offsets, the imperfect symbol synchronization of the colliding signals and the estimation of frequency and phase offsets and amplitudes in the presence of more than two colliding signals. In this paper we study the impact of imperfect-orthogonality in LoRa spreading factors (SFs) in simulation and real-world experiments. First, we analyze LoRa modulation numerically and show that collisions between packets of different SFs can indeed cause packet loss if the interference power received is strong enough. Second, we validate such findings using commercial devices, confirming our numerical results. Third, we modified and extended LoRaSim, an open-source LoRa simulator, to measure the impact of inter-SF collisions and fading (which was not taken into account previously in the simulator). Our results show that non-orthogonality of the SFs can deteriorate significantly the performance especially of higher SFs (10 to 12) and that fading has virtually no impact when multiple gateways are available in space diversity. Distributed detection on the serial (or tandem) topology is considered with the probability of error performance criterion. Previously published efforts, while presenting probability of detection versus false alarm results, limited the number of array elements to two or three. For the detection of known, equally likely signals in additive, symmetric noise, the author presents simple recursive expressions for the threshold values and the performance of the system. Examples for known signals in Gaussian and Laplacian noise show the degradation in performance due to the array structure. > Reliable data quality monitoring is a key asset in delivering collision data suitable for physics analysis in any modern large-scale high energy physics experiment. This paper focuses on the use of artificial neural networks for supervised and semi-supervised problems related to the identification of anomalies in the data collected by the CMS muon detectors. We use deep neural networks to analyze LHC collision data, represented as images organized geographically. We train a classifier capable of detecting the known anomalous behaviors with unprecedented efficiency and explore the usage of convolutional autoencoders to extend anomaly detection capabilities to unforeseen failure modes. A generalization of this strategy could pave the way to the automation of the data quality assessment process for present and future high energy physics experiments. Sensor collision (interference) is studied in a large network of low bit-rate sensors that communicate via backscatter, i.e. modulate the reflection of a common carrier transmitted by a central reader. Closed-form analysis is provided, quantifying sensor collision (interference) in high-density, backscatter sensor networks (BSN), as a function of number of tags and aggregate bandwidth. Analysis is applicable to a broad class of sensor subcarrier modulations, propagation environments and reader antenna directivity patterns. It is discovered that anti-collision performance in high-density backscatter sensor networks is feasible provided that appropriate modulation is used at each sensor. That is due to the round-trip nature of backscatter communication as well as the extended target range, which both impose stringent requirements on spectrum efficiency, not easily met by all modulations. Furthermore, aggregate bandwidth savings for given anti-collision performance are quantified, when simple division techniques on subcarrier (modulating) frequency and space (via moderately directive hub antenna) are combined. The article deals with the analysis and interpretation of dynamic scenes typical of urban driving. The key objective is to assess risks of collision for the ego-vehicle. We describe our concept and methods, which we have integrated and tested on our experimental platform on a Lexus car and a driving simulator. The on-board sensors deliver visual, telemetric and inertial data for environment monitoring. The sensor fusion uses our Bayesian Occupancy Filter for a spatio-temporal grid representation of the traffic scene. The underlying probabilistic approach is capable of dealing with uncertainties when modeling the environment as well as detecting and tracking dynamic objects. The collision risks are estimated as stochastic variables and are predicted for a short period ahead with the use of Hidden Markov Models and Gaussian processes. The software implementation takes advantage of our methods, which allow for parallel computation. Our tests have proven the relevance and feasibility of our approach for improving the safety of car driving. This paper considers cross-layer medium access control (MAC) protocol design in wireless networks. Taking a mutually interactive MAC-PHY perspective, we aim to design an MAC protocol that is in favor of the physical (PHY) layer information transmission, and the improved PHY, in turn, can improve the MAC performance. More specifically, we propose a novel MAC protocol, named hybrid ALOHA, which makes it possible for collision-free channel estimation and simultaneous multiuser transmission. The underlying argument is as follows: As long as good channel estimation can be achieved, advanced signal processing does allow effective signal separation given that the multiuser interference is limited to a certain degree. Comparing with traditional ALOHA, there are more than one pilot subslots in each hybrid ALOHA slot. Each user randomly selects a pilot subslot for training sequence transmission. Therefore, it is possible for different users to transmit their training sequences over nonoverlapping pilot subslots and achieving collision-free channel estimation. Relying mainly on the general multipacket reception (MPR) model, in this paper, quantitative analysis is conducted for the proposed hybrid ALOHA protocol in terms of throughput, stability, as well as delay behavior. It is observed that significant performance improvement can be achieved in comparison with the traditional ALOHA protocol based either on the collision model or the MPR model. Currently sparse signal reconstruction gains considerable interest and is applied in many fields. In this paper, a similarity induced by joint sparse representation is designed to construct the likelihood function of particle filter tracker so that the color visual spectrum and thermal spectrum images can be fused for object tracking. The proposed fusion scheme performs joint sparse representation calculation on both modalities and the resultant tracking results are fused using min operation on the sparse representation coefficients. In addition, a co-learning approach is proposed to update the reference templates of both modality and enhance the tracking robustness. The proposed fusion scheme outperforms state-of-the-art approaches, and its effectiveness is verified using OTCBVS database. The authors derive the Cramer-Rao lower bound (CRLB) for complex signals with constant amplitude and polynomial phase, measured in additive Gaussian white noise. The exact bound requires numerical inversion of an ill-conditioned matrix, while its O(N sup -1 ) approximation is free of matrix inversion. The approximation is tested for several typical parameter values and is found to be excellent in most cases. The formulas derived are of practical value in several radar applications, such as electronic intelligence systems (ELINT) for special pulse-compression radars, and motion estimation from Doppler measurements. Consequently, it is of interest to analyze the best possible performance of potential estimators of the phase coefficients, as a function of signal parameters, the signal-to-noise ratio, the sampling rate, and the number of measurements. This analysis is carried out. > In this paper, we leverage vehicle-to-vehicle (V2V) communication technology to implement computationally efficient decentralized algorithms for two-vehicle cooperative collision avoidance at intersections. Our algorithms employ formal control theoretic methods to guarantee a collision-free (safe) system, whereas overrides are only applied when necessary to prevent a crash. Model uncertainty and communication delays are explicitly accounted for by the model and by the state estimation algorithm. The main contribution of this work is to provide an experimental validation of our method on two instrumented vehicles engaged in an intersection collision avoidance scenario in a test track. This paper presents a unified analytical method for efficient computation of first and second order statistics of the signal-to-interference-plus-noise-ratio (SINR) in wireless communication systems. New exact expressions are derived for the moments of SINR and its autocorrelation function that are valid for arbitrary interfering signals. These are used to examine the accuracy of the commonly used approximations for the average SINR and to investigate effects of fast fading and interfering signals' temporal behavior on the autocorrelation properties of SINR. There are many ways of building collision-detecting systems. In this paper, we propose a novel collision selective visual neural network inspired by LGMD2 neurons in the juvenile locusts. Such collision-sensitive neuron matures early in the ﬁrst-aged or even hatching locusts, and is only selective to detect looming dark objects against bright background in depth, represents swooping predators, a situation which is similar to ground robots or vehicles. However, little has been done on modeling LGMD2, let alone its potential applications in robotics and other vision-based areas. Compared to other collision detectors, our major contributions are ﬁrst, enhancing the collision selectivity in a bio-inspired way, via constructing a computing efﬁcient visual sensor, and realizing the revealed speciﬁc characteristic sofLGMD2. Second, we applied the neural network to help rearrange path navigation of an autonomous ground miniature robot in an arena. We also examined its neural properties through systematic experiments challenged against image streams from a visual sensor of the micro-robot. Two new schemes are proposed for collision resolution in slotted ALOHA networks based on multi-user physical-layer network coding (MU PHY NC). In the proposed random access schemes, a collision of a generic number of packets can be recovered decoding the XOR of the original messages, such that the signal resulting from the collision is exploited rather than being discarded. Two different schemes that differ in terms of the amount of control information that needs to be transmitted from the access point, are studied. Correlation-based techniques used for frame synchronization can suffer significant performance degradation over multi-path frequency-selective channels. In this paper, we propose a joint frame synchronization and channel estimation (JFSCE) framework as a remedy to this problem. This framework, however, increases the size of the resulting combined channel vector which should capture both the channel impulse response vector and the frame boundary offset and, therefore, its estimation becomes more challenging. On the other hand, because the combined channel vector is sparse, sparse channel estimation methods can be applied. We propose several JFSCE methods using popular sparse signal recovery algorithms which exploit the sparsity of the combined channel vector. Subsequently, the sparse channel vector estimate is used to design a sparse equalizer. Our simulation results and experimental measurements using software defined radios show that in some scenarios our proposed method improves the overall system performance significantly, in terms of the mean square error between the transmitted and the equalized symbols compared to the conventional method. Finding feasible, collision-free paths for multiagent systems can be challenging, particularly in non-communicating scenarios where each agent's intent (e.g. goal) is unobservable to the others. In particular, finding time efficient paths often requires anticipating interaction with neighboring agents, the process of which can be computationally prohibitive. This work presents a decentralized multiagent collision avoidance algorithm based on a novel application of deep reinforcement learning, which effectively offloads the online computation (for predicting interaction patterns) to an offline learning procedure. Specifically, the proposed approach develops a value network that encodes the estimated time to the goal given an agent's joint configuration (positions and velocities) with its neighbors. Use of the value network not only admits efficient (i.e., real-time implementable) queries for finding a collision-free velocity vector, but also considers the uncertainty in the other agents' motion. Simulation results show more than 26 percent improvement in paths quality (i.e., time to reach the goal) when compared with optimal reciprocal collision avoidance (ORCA), a state-of-the-art collision avoidance strategy. We investigate spatial interference statistics for multigigabit outdoor mesh networks operating in the unlicensed 60-GHz "millimeter (mm) wave" band. The links in such networks are highly directional: Because of the small carrier wavelength (an order of magnitude smaller than those for existing cellular and wireless local area networks), narrow beams are essential for overcoming higher path loss and can be implemented using compact electronically steerable antenna arrays. Directionality drastically reduces interference, but it also leads to "deafness," making implicit coordination using carrier sense infeasible. In this paper, we make a quantitative case for rethinking medium access control (MAC) design in such settings. Unlike existing MAC protocols for omnidirectional networks, where the focus is on interference management, we contend that MAC design for 60-GHz mesh networks can essentially ignore interference and must focus instead on the challenge of scheduling half-duplex transmissions with deaf neighbors. Our main contribution is an analytical framework for estimating the collision probability in such networks as a function of the antenna patterns and the density of simultaneously transmitting nodes. The numerical results from our interference analysis show that highly directional links can indeed be modeled as pseudowired, in that the collision probability is small even with a significant density of transmitters. Furthermore, simulation of a rudimentary directional slotted Aloha protocol shows that packet losses due to failed coordination are an order of magnitude higher than those due to collisions, confirming our analytical results and highlighting the need for more sophisticated coordination mechanisms. We explore the feasibility of interference alignment in signal vector space-based only on beamforming-for K-user MIMO interference channels. Our main contribution is to relate the feasibility issue to the problem of determining the solvability of a multivariate polynomial system which is considered extensively in algebraic geometry. It is well known, e.g., from Bezout's theorem, that generic polynomial systems are solvable if and only if the number of equations does not exceed the number of variables. Following this intuition, we classify signal space interference alignment problems as either proper or improper based on the number of equations and variables. Rigorous connections between feasible and proper systems are made through Bernshtein's theorem for the case where each transmitter uses only one beamforming vector. The multibeam case introduces dependencies among the coefficients of a polynomial system so that the system is no longer generic in the sense required by both theorems. In this case, we show that the connection between feasible and proper systems can be further strengthened (since the equivalency between feasible and proper systems does not always hold) by including standard information theoretic outer bounds in the feasibility analysis. This paper studies the problem of recovering a sparse signal x ∈ ℝn from highly corrupted linear measurements y = Ax + e ∈ ℝm, where e is an unknown error vector whose nonzero entries may be unbounded. Motivated by an observation from face recognition in computer vision, this paper proves that for highly correlated (and possibly overcomplete) dictionaries A, any sufficiently sparse signal x can be recovered by solving an l1 -minimization problem min ||x||1 + ||e||1 subject to y = Ax + e. More precisely, if the fraction of the support of the error e is bounded away from one and the support of a: is a very small fraction of the dimension m, then as m becomes large the above l1 -minimization succeeds for all signals x and almost all sign-and-support patterns of e. This result suggests that accurate recovery of sparse signals is possible and computationally feasible even with nearly 100 of the observations corrupted. The proof relies on a careful characterization of the faces of a convex polytope spanned together by the standard crosspolytope and a set of independent identically distributed (i.i.d.) Gaussian vectors with nonzero mean and small variance, dubbed the "cross-and-bouquet" (CAB) model. Simulations and experiments corroborate the findings, and suggest extensions to the result.