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.
In @cite_4 , the authors made a study regarding the CSS modulation technique. They show that some CSS symbols are not orthogonal. Their simulations show that the achievable range of the CSS technique is lower than an ultra-narrowband solution, but the robustness against interference is higher.
@cite_4
2564504513
Long range low power is a family of technologies promising to connect thousands of sensors to the future internet of things. Within this family of possible technology choices, two different branches have emerged: the standards based on spreaded wideband communication and the standards based on narrowband communication, both promising to reach long range connectivity at very low power. More specifically, this paper focuses on chirp spread spectrum (CSS). This paper presents a detailed model of CSS, showing that the symbols are not perfectly orthogonal. The results show the potential communication ranges are close to narrowband networks and the robustness against interfering signals is 22 dB better for spreading factor 10 than BPSK. Although wideband communication is robust to interference, in long range communication, this robustness is insufficient due to the long range and the larger footprint. The large propagation losses due to the long range and the larger footprint make CSS prone to collisions with other noise sources, possibly larger than the coding gain. Motivated by the enormous amounts of data collected in a large IT service provider organization, this paper presents a method for quickly and automatically summarizing and extracting meaningful insights from the data. Termed Clustered Subset Selection (CSS), our method enables program-guided data explorations of high-dimensional data matrices. CSS combines clustering and subset selection into a coherent and intuitive method for data analysis. In addition to a general framework, we introduce a family of CSS algorithms with different clustering components such as k-means and Close-to-Rank-One (CRO) clustering, and Subset Selection components such as best rank-one approximation and Rank-Revealing QR (RRQR) decomposition. From an empirical perspective, we illustrate that CSS is achieving significant improvements over existing Subset Selection methods in terms of approximation errors. Compared to existing Subset Selection techniques, CSS is also able to provide additional insight about clusters and cluster representatives. Finally, we present a case-study of program-guided data explorations using CSS on a large amount of IT service delivery data collection. In this paper, we investigate cooperative spectrum sensing (CSS) in a cognitive radio network (CRN) where multiple secondary users (SUs) cooperate in order to detect a primary user, which possibly occupies multiple bands simultaneously. Deep cooperative sensing (DCS), which constitutes the first CSS framework based on a convolutional neural network (CNN), is proposed. In DCS, instead of the explicit mathematical modeling of CSS, the strategy for combining the individual sensing results of the SUs is learned autonomously with a CNN using training sensing samples regardless of whether the individual sensing results are quantized or not. Moreover, both spectral and spatial correlation of individual sensing outcomes are taken into account such that an environment-specific CSS is enabled in DCS. Through simulations, we show that the performance of CSS can be greatly improved by the proposed DCS. In this paper, we investigate cooperative spectrum sensing (CSS) in a cognitive radio network (CRN) where multiple secondary users (SUs) cooperate in order to detect a primary user (PU) which possibly occupies multiple bands simultaneously. Deep cooperative sensing (DCS), which constitutes the first CSS framework based on a convolutional neural network (CNN), is proposed. In DCS, instead of the explicit mathematical modeling of CSS which is hard to compute and also hard to use in practice, the strategy for combining the individual sensing results of the SUs is learned with a CNN using training sensing samples. Accordingly, an environment-specific CSS which considers both spectral and spatial correlation of individual sensing outcomes, is found in an adaptive manner regardless of whether the individual sensing results are quantized or not. Through simulation, we show that the performance of CSS can be improved by the proposed DCS with low complexity even when the number of training samples is moderate.