In this paper, we propose a slot-based protocol that does not rely on global-time synchronization to achieve a self-healing mesh network. With the proposed protocol, each node synchronizes with its neighbors locally by adjusting its time to transmit based on the reception instant of a decoded beacon signal. Also, it determines its slots without any coordinator to avoid collisions. Finally, to communicate the messages over the mesh network, it identifies the forwarding nodes on the shortest path without knowing the entire communication graph. We show that the proposed protocol can effectively resolve collisions over time while enabling nodes to synchronize with each other in a distributed manner. We numerically analyze the performance of the proposed protocol for different configurations under a realistic channel model considering asymmetrical links. We also implement the proposed method in practice with \ac{LoRa} devices. We demonstrate that the nodes adapt themselves to changes in the network and deliver a message from a sensing node to a reference node via multi-hop routing.
When using ultra-wideband (UWB) signaling on massive multiple-input multiple-output (mMIMO) systems, the electromagnetic wave at each array element incurs an extra propagation delay comparable to (or larger than) the symbol duration, producing a shift in beam direction known as beam squint. The beam squinting problem degrades the array gain and reduces the system capacity. This letter proposes a novel transceiver design based on lens antenna subarray (LAS) and analog subband filters to compensate for the beam squinting effect. In particular, the proposed design aims to divide the UWB signal into narrowband beams and control them with a simplified exhaustive search-based precoding that is proposed to align the beam angle to the target direction. The design is analyzed in terms of beam gain, complexity, power consumption, and capacity, demonstrating significant performance enhancement with respect to the conventional system with uncompensated beam squinting problem.
Recently, orthogonal time-frequency-space (OTFS) modulation is used as a promising candidate waveform for high mobility communication scenarios. In practical transmission, OTFS with rectangular pulse shaping is implemented using different prefix/suffix configurations including reduced-cyclic prefix (RCP), full-CP (FCP), full-zero suffix (FZS), and reduced-zero padded (RZP). However, for each prefix/suffix type, different effective channel are seen at the receiver side resulting in dissimilar performance of the various OTFS configurations given a specific communication scenario. To fulfill this gap, in this paper, we study and model the effective channel in OTFS systems using various prefix/suffix configurations. Then, from the input-output relation analysis of the received signal, we show that the OTFS has a simple sparse structure for all prefix/suffix types, where the only difference is the phase term introduced when extending quasi-periodically in the delay-Doppler grid. We provide a comprehensive comparison between all OTFS types in terms of channel estimation/equalization complexity, symbol detection performance, power and spectral efficiencies, which helps in deciding the optimal prefix/suffix configuration for a specific scenario. Finally, we propose a novel OTFS structure namely reduced-FCP (RFCP) where the information of the CP block is decodable.
Cooperative communication has been widely used to provide spatial diversity benefits for low-end user equipments, especially in ad hoc and wireless sensor networks. However, the lack of strong authentication mechanisms in these networks leaves them prone to eavesdropping relays. In this paper, we propose a secure orthogonal frequency division multiplexing (OFDM) transmission scheme, where the destination node transmits a jamming signal over the cyclic prefix (CP) duration of the received signal. Simulation results verify that as long as at least a part of the jamming signal falls to the actual data portion of the eavesdropping relay, it spreads through all the data symbols due to the fast Fourier transformation (FFT) operation, resulting in degraded interception at the eavesdropper.
Advances in computing have resulted in an emerging need for multi-factor authentication using an amalgamation of cryptographic and physical keys. This letter presents a novel authentication approach using a combination of signal and antenna activation sequences, and most importantly, perturbed antenna array geometries. Possible degrees of freedom in perturbing antenna array geometries affected physical properties and their detection are presented. Channel estimation for the plurality of validly authorized arrays is discussed. Accuracy is investigated as a function of signal-to-noise ratio (SNR) and number of authorized arrays. It is observed that the proposed authentication scheme can provide 1% false authentication rate at 10 dB SNR, while it is achieving less than 1% missed authentication rates.