Tensor-based modulation (TBM) provides a multi-linear spreading framework for blind multi-user separation in unsourced random access. In this paper, we show that TBM is a coded modulation built on a non-binary linear block code over $\mathbb{Z}_M$, whose symbols are mapped to $M$-PSK modulation, defining a geometrically uniform signal space code. We explicitly derive this generator matrix, characterize its rank deficiency, and show that reference symbols for tensor identifiability correspond to code shortening, producing a quasi-systematic or a systematic code, depending on the number of considered reference symbols for the TBM. Simulations in single-user AWGN and multi-user non-coherent multi-antenna fading channels demonstrate strong robustness and interference resilience, establishing TBM as a scalable, algebraically structured modulation-coding scheme bridging tensor representations and modern coding theory.

Wake up radio receivers are an efficient approach to reduce energy consumption in Internet of Things (IoT) nodes. They monitor the channel to identify when a specific activation sequence is transmitted. However, up to now, they rely on classical processors which still consume too much. In this paper, to reduce this energy consumption, we propose to exploit Spiking Neural Network (SNN) architecture. In order to be able to detect the sequence in various channel conditions, we exploit the Spike-Timing Dependent Plasticity (STDP) learning rule to train the SNN. We show that the SNN succeeds in performing the sequence detection accurately, and delve into the training set design to improve the accuracy.

Energy consumption remains a predominant constraint in numerous Internet of Things (IoT) applications, as microcontrollers typically exhibit excessively high power consumption. To address this issue, novel circuit designs have been introduced, and the utilization of spiking neurons and analog computing has emerged as a promising approach, enabling substantial reductions in power consumption. However, operating within the analog domain poses challenges in managing the sequential processing of incoming signals, which is essential for processing wireless communication signals. In this study, we leverage a bio-inspired phenomenon known as Saturating Synapses to create a temporal filter. We present a model of neurons whose synapses respond specifically within a defined range of delays between two incoming spikes, but remain unresponsive when the Inter-Spike Timing (IST) falls outside this range. Our investigation delves into the model’s parameters to better understand their selection criteria and adaptation for the IST. Subsequently, we show the system’s efficiency in recognizing specific sequences defined by these ISTs. This paper’s novelty lies in the proposal of a new analog processing approach for managing temporal sequences, which permits a much lower energy consumption compared to classical approaches.

The key features of 5G, such as ultra-reliable low latency (URLLC) and massive machine-type communication (mMTC), are designed to address the need for low latency and the ability to connect a large number of devices in the IoT context. To support these constraints, mobile devices transmit information without previously establishing a connection with the base station (BS). This requires the Base Station to detect in real-time the active users (process known as Active User Detection (AUD)). With classical processors, one can employ the Maximum Likelihood (ML) method (the optimal detector, but suffers from high complexity and delay), or suboptimal ones (which are simpler, but less reliable). Meanwhile, quantum algorithms, particularly Durr and Hoyer (DHA) algorithm, addressing minimum searching problems, can significantly reduce complexity while keeping good performances. However, these algorithms were designed for generic problems, and their initialization and parameterization are blindly done. Nonetheless, we can have access to prior information on the system’s behavior. Therefore, in this paper, we aim to adapt and improve these quantum algorithms by using prior knowledge on the system for the AUD problem. We first propose a novel algorithm, the Improved Iterative Minimum Searching Algorithm (IIMSA) where we define more efficiently the parameters. Then, further enhancements of IIMSA are obtained thanks to a better initialization of the algorithms by exploiting classical preprocessing of the received signals with classical Conventional Correlation Receiver (CCR) or Zero Forcing (ZF). The obtained results show that these proposed algorithms operate more efficiently (i.e., less complexity with better accuracy).

Energy consumption is a critical issue for the deployed nodes in the area of Internet of Things (IoT). This is the reason why many research projects focus on Wake-up Radio (WuR) receivers that permit the nodes to remain in sleep mode for as long as possible and to wake them up only if needed. However, current WuR use classic microcontrollers that are still too energy consuming. Meanwhile, Spiking Neural Networks (SNN) offer much lower power consumption. Thus, we propose to adapt those neural networks as a wake-up radio receiver in the IoT context. We aim at waking up the concerned node by recognising one or many activation sequences in a bit flow. We propose here a configuration for the neurons along with the design of appropriate sequences. We present the performances of our system and the impact of different parameters on the accuracy of the recognition system.

The user clustering problem in an uplink MIMO Non-Orthogonal Multiple Access (NOMA) scheme is considered here. The receiver is assumed to operate in two sequential stages that employ Linear Minimum Mean Squared Error (LMMSE) receivers. At the first stage, the receiver is designed to recover the transmission from a cluster of selected users/nodes. The contribution of these users is then subtracted from the received signal and the remaining user transmissions are then linearly recovered. The determination of which users should be detected during the first stage is formulated as a deep learning based multiple classification problem. In order to guarantee that the selection is robust to fast fading, the input to the neural network is based on second order channel statistics. Furthermore, the training process is simplified by using a large system approximation of the resulting sum-rates. Simulation results indicate that the proposed deep learning-based solution is able to achieve a significant rate advantage with respect to other lazy approaches, such as fixed or random cluster assignments.

Ultra Wide Band (UWB) provides ranging capabilities much more precise than other radio communication technologies. This paper presents experimental measurement of ranging precision between two UWB tags when one of the tag is moving fast. The use of a specific electro-pneumatic actuator provides precise ground truth for real distance. This study will allow to improve ranging for human wearable tags as for example sportsmen positioning or interaction between dancers during live performances. We show in particular how the inherent noisy measurement has to be smoothed to obtain more accurate ranging.

UNB (Ultra Narrow Band) is one of the technologies dedicated to low-power wide-area communication for IoT, currently exploited by SigFox. The specificity of UNB is the Aloha-type channel access scheme, both asynchronized in time and frequency domain. This randomness can cause partial spectral interference. In this paper, we take advantage of the spatial diversity of multiple base stations to improve the UNB performance, by using selection combining. In the presence of pathloss and spectral randomness of UNB, the channels are considered correlated. A theoretical analysis of outage probability is demonstrated by considering this correlation, for the case of 2 base stations. This methodology of probability computing can be extended to general K BSs. The diversity of multiple receivers is proved to be beneficial in enhancing the performance of UNB networks. This gain is shown to be related to the density of the base stations, as well as the distance between each of them.

UNB (Ultra Narrow Band) stands out as one promising PHY solution for low-power, low-throughput and long-range IoT. The dedicated MAC scheme is RFTMA (Random Frequency and Time Multiple Access), where nodes access the channel randomly both in frequency and in time domain, without prior channel sensing. This blind randomness sometimes introduces interference and packet losses. Hence, in this paper, we propose to use the well-known SIC (Successive Interference Cancellation) to cancel the interference in a recursive way. We provide a theoretical analysis of network performance, when considering jointly SIC and the specific spectral randomness of UNB. We analytically and numerically highlight the SIC efficiency in enhancing UNB system performance.

UNB is dedicated to long range and low power transmission in IoT networks. The channel access is Random-FTMA, where nodes select their time and frequency in a random and continuous way. This randomness leads to a new behavior of the interference which has not been theoretically analyzed yet, when considering the pathloss of nodes located randomly in an area. In this paper, in order to quantify the system performance, we derive and exploit a theoretical expression of the packet error rate in a UNB based IoT network, when taking into account both interference due to the spectral randomness and path loss due to the propagation.

In the context of radiolocation in Wireless Body Area Networks (WBANs), nodes positions can be estimated through time-based ranging algorithms. For instance, the distance separating a couple of nodes can be estimated accurately by measuring the Round Trip Time of Flight of an Impulse Radio Ultra Wideband (IR-UWB) link. This measure usually relies on two or three messages transactions. Such exchanges take time and a rapid mobility of the nodes can reduce the ranging accuracy and consequently impact nodes localization process. In this paper, we quantify this localization error by confronting two broadcast-based optimized implementations of the three-way ranging algorithm with real mobility traces, acquired through a motion capture system. We then evaluate, in the same scenarios, the impact of the MAC-level scheduling of the packets within a TDMA frame localization accuracy. The results, obtained with the WSNet simulator, show that MAC scheduling can be utilized to mitigate the effect of nodes mobility.

The purpose of this paper is to evaluate the impact of the node speed on the ranging estimation for location applications with Wireless Body Area Networks (WBAN). While estimated with the 3-Way ranging protocol (3-WR), this distance between two nodes placed on the body can be affected by the human movements. Thus, we study theoretically the ranging error with the 3-WR, based on a perfect channel, a MAC layer based on TDMA using two scheduling strategies (Single node localization (P2P-B) and Aggregated & Broadcast (A&B)) and a PHY layer based on Ultra Wideband (IR-UWB). We demonstrate the accuracy of the model, and show that the distance error is highly correlated with the speed of nodes, while the associated mobility model has an impact on the design of MAC strategies by simulation.

Ultra narrow band transmission (UNB) systems have already been deployed and have proved to be ultra-efficient for point-to-point communications. This paper presents this technology and gives some insights on the scalability of UNB for a multi-point to point network. This configuration corresponds to an uplink scenario where multiple nodes compete to send their packets, with neither coordination nor feedback from the sink. In particular, we present and analyze two multiple access schemes based on random frequency selection: discrete random FDMA (DR-FDMA) and the new continuous random FDMA (CR-FDMA). An ideal system where the carrier frequencies are exactly obtained is first considered and extended to a more realistic case, with rough carrier frequencies. We analyze the system performance in terms of bit error rate and outage probability. The presented results clearly show that, even if in the ideal case, the DR-FDMA scheme outperforms the CR-FDMA scheme; in the realistic case, both schemes lead to similar performance. Thus, this paper highlights the fact that the use of CR-FDMA is very relevant in a realistic network as it bypasses the need of an accurate carrier frequency control, and thus permits the use of even the cheapest transmitters without loss of performance.

Relay channels have been extensively studied in the literature since the seminal paper by Cover and El Gamal. Nevertheless, characterizing the capacity of relay channels still presents open issues. While numerous works addressed this problem with constant powers or targeted the sum-rate optimization, computing the capacity in the case of a global power constraint was less studied. In this paper, we introduce the concept of virtual nodes to derive analytical expressions of the relay channel capacity as a function of the total power. This transformation leads to simple closed-form expressions of the upper bound and decode-and-forward (DF) lower bound on the capacity of the full- and half-duplex relay channels. The half-duplex study is separated into low and high signal-to-noise ratio (SNR) cases. The impact of these approximations is evaluated and found to achieve a large part of the maximal capacity in the worst case where the equivalent received SNR is neither low nor high, typically between 0-10dB.

In this paper, we study the optimal power allocations in cooperative multiple access channels (CMACs), where we aim at maximizing the rate achievable by both sources simultaneously rather than the sum of achievable rates. Separating our study between the coherent and non-coherent case, we obtain closed-form expressions for the optimal power allocations w.r.t. the outer bounds of the capacity region, as well as decode-and-forward and non-cooperative inner bounds.We point out during our resolution that the general CMAC model behaves as a multiple access relay channel (MARC), where a “virtual” relay node is introduced to represent the cooperation between the sources. This equivalent model simplifies the original power allocation problem. We finally show that the general cut-set outer bound on the capacity region of the equivalent MARC matches exactly the tightest known outer bound on the capacity region of the original CMAC.

Body area networks (BANs), referring to embedded wireless systems in, on, and around bodies, are expected to take an important role for health, leisure, sports, and all the facets of our daily life. In many cases, several BANs coexist in a small area, resulting in very strong inter-BAN interference, which seriously disturbs intra-BAN communications. The goal of this paper is to decrease inter-BAN interference by cooperative scheduling, hence increasing packet reception rate (PRR) of intra-BAN communications. Cooperative scheduling here is divided into two sub-problems: single-BAN scheduling as an assignment problem and multi-BAN concurrent scheduling as a game. For the first sub-problem, a low complexity algorithm, horse racing scheduling, is proposed, which achieves near-optimal PRR for the BAN performing scheduling. For the second sub-problem, we prove the existence of a set of mixed strategy Nash equilibria (MSNE). Then, we propose a distributed cooperative scheduling scheme, which efficiently achieves higher PRR than the MSNE without degrading fairness.

In this paper, we aim at characterizing the gain induced by using relay channels in a linear network under both capacity constraint and realistic energy model. We express a general model based on a convex optimization problem. Then, we use numerical tools to obtain results on the outer and inner bounds of the capacity of the full and half duplex relay channel. We then further this study with more complex networks based on relay channels, especially networks formed by a linear chain of nodes. We describe the Pareto optimal solutions of the minimization problem with respect to the consumed energy and latency in such a linear network. From the simple case of the linear multi-hop network, we study the gains when implementing a linear chain of relay channels and compare these results to the simpler multi-hop transmission.

One of the most powerful ways to achieve transmission reliability over wireless links is to employ efficient coding techniques. This paper investigates the performance of a transmission over a relay channel where information is protected by two layers of coding. In the first layer, transmission reliability is ensured by fountain coding at the source. The second layer incorporates network coding at the relay node. Thus, fountain coded packets are re-encoded at the relay in order to increase packet diversity and reduce energy consumption. Performance of the transmission is measured by the total number of transmissions needed until the message is successfully decoded at the destination. We show through both analytical derivations and simulations that adding network coding capabilities at the relay optimizes system resource consumption. When the source uses a random linear fountain code, the proposed two-layer encoding becomes more powerful as it reduces the transmission rate over the direct link between the source and the destination.

SUMMARY Recent advances in information theory and networking, e.g. aggregation, network coding or rateless codes, have significantly modified data dissemination in wireless networks. These new paradigms create new threats for security such as pollution attacks and denial of services (DoS). These attacks exploit the difficulty to authenticate data in such contexts. The particular case of xor network coding is considered herein. We investigate different strategies based on message authentication codes algorithms (MACs) to thwart these attacks. Yet, classical MAC designs are not compatible with the linear combination of network coding. Fortunately, MACs based on universal hash functions (UHFs) match nicely the needs of network coding: some of these functions are linear h(x1⊕x2) = h(x1)⊕h(x2). To demonstrate their efficiency, we consider the case of wireless sensor networks (WSNs). Although these functions can drastically reduce the energy consumption of authentication (up to 68% gain over the classical designs is observed), they increase the threat of DoS. Indeed, an adversary can disrupt all communications by polluting few messages. To overcome this problem, a group testing algorithm is introduced for authentication resulting in a complexity linear in the number of attacks. The energy consumption is analyzed for cross‐point and butterfly network topologies with respect to the possible attack scenarios. The results highlight the trade‐offs between energy efficiency, authentication and the effective throughput for the different MAC modes. Copyright © 2011 John Wiley & Sons, Ltd.

This paper concentrates on the proper use of fountain codes for the transmission of sporadic data in a wireless sensor network (WSN). Fountain codes offer great perspectives for the self-organization of WSNs: they self adapt to the channel error rate without control packets. Deploying fountain codes in a WSN raises two problems. First, the size of the data transmitted by a sensor is small in comparison to the size usually considered with fountain codes. Second, WSNs mostly rely on multi-hop transmissions. It implies a non null transmission duration for the end-to-end acknowledgement of the reception. During this period of time, the source is still transmitting useless packets, creating a specific overhead we define as the overflow. This paper brings the overflow problem to light and analyses its impact on the network performance. Our work can be viewed as the networking counterpart of the results presented by Pakzad et al. at ISIT 2005 applied to WSNs.

The recent advances in information theory and networking have significantly modified the way to disseminate data in wireless sensor networks (WSNs): aggregation, network coding or rateless codes. These new paradigms of dissemination create new threats for security such as pollution attacks. These attacks exploit the difficulty to protect data integrity in those contexts. In this paper, we consider the particular case of xor network coding. We compare the different strategies based on message authentication codes algorithms (MACs) to thwart these attacks. We emphasize the advantages of universal hash functions (UHFs) in terms of flexibility and efficiency. These schemes reduce the energy consumption by 42% and 68% (according to the used protocol) for the relaying nodes over those based on classical cryptographic primitives without any loss in security. The key feature of the UHFs considered here is their homomorphic property (h(x1⊕ x2)=h(x1) ⊕ h(x2)). These homomorphic MACs offer more possibilities for the relying nodes than the classical cryptographic ones: the detection time of a pollution attack can be adjusted to preserve the nodes energy. Moreover, they can be computed with the low resources of a sensor.

This paper concentrates on characterizing energy, latency and capacity trade-offs in multi-hop wireless ad-hoc networks. Therefore, a multiobjective framework is proposed to derive the Pareto-optimal set of solutions with respect to these three criteria. The work presented in this paper assumes a linear network where transmission powers and relay positions are optimization variables. We study the asymptotic state where the distance between source and destination is very high such that the number of hops tends to infinite. Two types of traffic are considered in the following. First, low rate traffic is analyzed by characterizing the multiobjective performance of a single packet transmission using an interference free multi-hop relaying strategy. Second, a continuous flow of packets from a unique source is considered. In the first case, we show an important theorem which states that all Pareto optimal solutions with respect to delay and energy metrics provide the same target SNR at the receiver side. In the second case, our analytical results highlight how the energy/delay Pareto front moves when considering a capacity constraint and the optimal re-use factor is derived.

Body Area Networks (BAN) offer amazing perspectives to instrument and support humans in many aspects of their life. Among all possible applications, this paper focuses on body monitoring applications having a body equipped with a set of sensors transmitting in real-time their measures to a common sink. The underlying network topology is a star topology which is quite usual in the broad scope of wireless sensor networks. Therefore, a classical superframe structure as proposed in 802.15.3 or 802.15.4 seems to comply with the needs of such an application. Basically however, the specificities of the BAN channel can reduce the performance of such protocol. Indeed, channel time variations make the star structure unstable and temporary subject to a high packet error rate. A multi-hop mesh topology cannot counteract this problem efficiently, since the pathloss attenuation in a BAN environment is almost independent with the emitter-receiver distance. In this paper, we address this issue by considering the topology of a BAN network as a time-varying fully connected network instead of a star structure. We then show how an opportunistic cooperative mechanism based on a decode-and-forward protocol can address this issue. We derive a performance criterion based on a packet error rate outage and we discuss the implementation of this scheme in the classical superframe structure.

Classical multi-wavelength optical orthogonal code (MWOOC) constructions impose several conditions on the code parameters. These limit the optical code division multiple access (OCDMA) system potentialities in terms of performance and practical implementation. A modified MWOOC construction is used to overcome these limitations. Indeed, this method permits the design of 2D codes with a low temporal code length value and a low number of wavelengths. Considering a multi-user receiver named parallel interference cancellation, the number of users and the data rate per user the system can provide for a low bit error rate value are evaluated. For a given performance, it is shown that the spectral efficiency using the modified MWOOC is significantly improved. Thus, the simplicity of the modified code design and the spectral efficiency increase constitute an advantage for practical implementation of OCDMA network.

In this paper, we study the parallel interference cancellation receiver (PIC) efficiency, in direct sequence optical code division multiple access system (DS-OCDMA) with prime codes (PC). We develop the analytical expression of the error probability in the chip synchronous case, for PC. We show that the PIC receiver permits to suppress totally the effect of multiple access interference (MAI) for prime code, and leads to an error free O-CDMA link in the noiseless case, for whichever PC employed. Simulation results have validated the theoretical analysis. Finally, we show that the PIC receiver permits to reduce the required code length for a given bit error rate

In this paper, we investigate the feasibility of a 2 Dimensional Optical Code Division Multiple Access system (2DOCDMA), with electronic coding and decoding functions. We present a modified construction method of Multi-Wavelength Optical Orthogonal Codes (MWOOC) which permits high flexibility for the code parameters choice. Our objective is to evaluate the 2D code performance, with a Conventional Correlation Receiver (CCR) and a more complex one named Parallel Interference Cancellation receiver (PIC). For example, for a Bit Error Rate (BER)10-9, 30 simultaneous users and an electrical implementation, we show that contrary to the CCR, the use of a PIC receiver leads to workable 2D code solutions.

In an incoherent direct-sequence optical code-division multiple-access (DS-OCDMA) system, multiple-access interference (MAI) is one of the principal limitations. To mitigate MAI, the parallel interference cancellation (PIC) technique can be used to remove nondesired users' contribution. In this paper, we study four DS-OCDMA receivers based on the PIC technique with hard limiters placed before the nondesired users or before the desired user receiver, or both. We develop, for the ideal synchronous case, the theoretical upper bound of the error probability for the four receivers. Significant performance improvement is obtained by comparison with conventional receivers in the case of optical orthogonal codes. The paper highlights that the number of active users with null error probability is doubled, compared with conventional receivers. Finally, we show that, thanks to their good performances, the PIC structures permit considerably reducing the minimal code length required to have 30 users with bit-error rate <10/sup -9/. So, the hardware constraints are relaxed for realistic application.

In direct sequence optical code division multiple access system (DS-OCDMA), one of the principal limitations is due to unipolar coding which introduces multiple access interference (MAI). To mitigate MAI, we have applied a parallel interference cancellation technique (PIC) to remove non-desired users' contribution. We study in this paper, the performances of the PIC improved by hard limiters (HL) placed either before the non-desired users receivers (HL+PIC) or before the desired user receiver (PIC+HL). We develop the HL+PIC and PIC+HL theoretical error probability expression, and show the performances improvement due to such receivers