Search

This papers uses stochastic geometry and queuing theory to study he scalability of long-range (LoRa) networks, accounting for duty cycling restrictions and imperfect spreading factor (SFs) orthogonality. The scalability is characterised by the joint boundaries of device density and traffic intensity per device. Novel cross-correlation factors are used to quantify imperfect SForthogonality. Our results show that a proper characterisation of LoRa orthogonality extends the scalability of the network. They also highlight that for low/medium densities decreasing the SF extends the spanned spectrum of sensing applications characterised by their traffic requirements (i.e. sensing rate). However, for high density (> 104 nodes/Km2 ), the Pareto frontiers converge to a stability limit governed by the SF allocation scheme and the predefined capture thresholds. The results further evince the importance of capturing threshold distribution among the SFs to mitigate the unfair latency.

In this paper, we provide, for the first time, a comprehensive understanding of LoRa waveform theory in order to quantify its orthogonality. We present LoRa waveform expressions in continuous and discrete time domains, and analyze measures of orthogonality between different LoRa spreading factors (SFs) through cross-correlation functions. The crosscorrelation functions are analytically expressed in a general form and they account for diverse configuration parameters (bandwidth, SF, etc.) and different cases of signal displacements (time delay shift, frequency shift, etc.). We quantify their mean and maximum in all time domains. We highlight the impact of the temporal displacement and different bandwidths. The general result is that LoRa modulation is non-orthogonal. Firstly, we observe that for same bandwidths the largest maximum crosscorrelation happens for same SF and is equal to 100% due to same symbols; whereas for different bandwidths, the largest maximum cross-correlation is no longer observed at the same SF. Secondly, the maximum cross-correlation is less than 26% between different SFs, is higher for closer SFs and decreases as the difference between SFs increases. After downchirping, the maximum crosscorrelation increases and the mean decreases compared to those before downchirping. Moreover, the maximum cross-correlation is insignificantly impacted by the temporal delay which makes it valid to adopt for the performance analysis of both synchronous and asynchronous systems. Finally, we analyze by simulation the bit error probability statistics for different bandwidth ratios and highlight their correlated behaviour with the insights obtained from the maximum cross-correlation expressions.

In this work, a parametric up-converter amplifier is introduced as a wideband impedance-matching network. Chu’s limit restricts the minimum Q-factor of unloaded small antennas. However, the practical bandwidth (BW) of small antennas is defined by their loaded Q-factor. By connecting a small antenna to an amplifier with a real input impedance that is several times greater than the radiation resistance of the antenna, we propose increasing the return loss, which leads to a reduction in the loaded Q-factor and an increase in the BW. In addition, a parametric amplifier is used because, in comparison with transistor amplifiers, it offers low-noise characteristics. The gain of the low-noise parametric amplifier compensates for the loss due to the imposed mismatch. Our simulation result shows BW improvements up to 32 times can be accomplished by trading 2 dB of noise figure (NF), compared to the 15 dB suggested by Chu’s limit for a lossy antenna. Accepted version

Future mobile networks are envisioned to become multi-service systems, enabling the dynamic deployment of services with vastly different performance requirements, accommodating the needs of diverse service providers. Virtualizing the mobile network infrastructure is of fundamental importance for realizing this vision in a cost-effective manner. While there have been extensive research efforts in virtualization for the mobile core network, virtualization in the radio access network (RAN) is still at an early stage. In this paper, we present AIRTIME, a new RAN slicing system that enables the dynamic on-the-fly virtualization of RANs, with the programmability required by service providers to customize any aspect of their virtual RAN to meet their service needs. We present a prototype implementation of AIRTIME and evaluate the: (i) capacity to create virtual RANs on-the-fly, (ii) performance experienced by slice owners, (iii) isolation among multiple virtual RANs sharing the same physical infrastructure, and (iv) scalability to accommodate a large number of virtual RANs. Accepted version

Physical layer security (PLS) schemes use the randomness of the channel parameters, namely, channel state information (CSI) and received signal strength indicator (RSSI), to generate the secret keys. There has been limited work in PLS schemes in long-range (LoRa) wide area networks (Lo- RaWANs), hindering their widespread application. Limitations observed in existing studies include the requirement of having a high correlation between channel parameter measurements and the evaluation in either fully indoor or outdoor environments. The real-world wireless sensor networks (WSNs) and LoRa use cases might not meet both requirements, thus making the current PLS schemes inappropriate for these systems. This paper proposes LoRA-LiSK, a practical and efficient shared secret key generation scheme for LoRa networks to address the limitations of existing PLS schemes. Our proposed LoRa-LiSK scheme consists of several preprocessing techniques (timestamp matching, two sample Kolmogorov Smirnov tests, and a Savitzky- Golay filter), multi-level quantization, information reconciliation using Bose-Chaudhuri-Hocquenghem (BCH) codes, and finally, privacy amplification using secure hash algorithm SHA-2. The LoRa-LiSK scheme is extensively evaluated on real WSN/IoT devices in practical application scenarios: 1) indoor to outdoor and 2) long range static and mobile outdoor links. It outperforms existing schemes by generating keys with channel parameter measurements of low correlation values (0:2 to 0:6) while still achieving high key generation rates and low key disagreement rates (10%–20%). The scheme updates a key in one hour approximately using an application profile with a high transmission rate compared to three hours reported by existing works while still respecting the duty cycle regulation. It also incurs less communication overhead compared to the existing works.

Ubiquitous sensor-rich smartphones have promoted MCS, an emerging people-centric sensing paradigm for urban IoT. However, using cellular networks to transmit the big data collected by MCS would incur expensive financial costs for both participating phone users and the MCS organizer. A promising solution to this is to integrate the low-cost D2D communication into the MCS design. However, using D2D in MCS will require cooperative interactions among self-interested and strategic participating phone users, which significantly complicates the "human-in-the-loop" MCS design in both the digital and human dimensions, and brings a branch of new challenges: data communication and networking become more complex; D2D connections among opportunistically encountered phone users must be secure, fast, and user-transparent; and participating phone users need to be properly incentivized. In dealing with these challenges, this article covers recent developments of D2D-enabled MCS from both the theoretical and practical perspectives. Future research questions in this rapidly growing field are also discussed.

The Unlimited Sensing Framework (USF) is a digital acquisition protocol that allows for sampling and reconstruction of high dynamic range signals. By acquiring modulo samples, the USF circumvents the clipping or saturation problem that is a fundamental bottleneck in conventional analog-to-digital converters (ADCs). In the context of the USF, several works have focused on bandlimited function classes and recently, a hardware validation of the modulo sampling approach has been presented. In a different direction, in this paper we focus on non-bandlimited function classes and consider the well-known super-resolution problem; we study the recovery of sparse signals (Dirac impulses) from low-pass filtered, modulo samples. Taking an end-to-end approach to USF based super-resolution, we present a novel recovery algorithm (US-SR) that leverages a doubly sparse structure of the modulo samples. We derive a sampling criterion for the US-SR method. A hardware experiment with the modulo ADC demonstrates the empirical robustness of our method in a realistic, noisy setting, thus validating its practical utility., Comment: 9 pages, 4 figures

The next-generation of wireless networks will enable many machine learning (ML) tools and applications to efficiently analyze various types of data collected by edge devices for inference, autonomy, and decision making purposes. However, due to resource constraints, delay limitations, and privacy challenges, edge devices cannot offload their entire collected datasets to a cloud server for centrally training their ML models or inference purposes. To overcome these challenges, distributed learning and inference techniques have been proposed as a means to enable edge devices to collaboratively train ML models without raw data exchanges, thus reducing the communication overhead and latency as well as improving data privacy. However, deploying distributed learning over wireless networks faces several challenges including the uncertain wireless environment (e.g., dynamic channel and interference), limited wireless resources (e.g., transmit power and radio spectrum), and hardware resources (e.g., computational power). This paper provides a comprehensive study of how distributed learning can be efficiently and effectively deployed over wireless edge networks. We present a detailed overview of several emerging distributed learning paradigms, including federated learning, federated distillation, distributed inference, and multi-agent reinforcement learning. For each learning framework, we first introduce the motivation for deploying it over wireless networks. Then, we present a detailed literature review on the use of communication techniques for its efficient deployment. We then introduce an illustrative example to show how to optimize wireless networks to improve its performance. Finally, we introduce future research opportunities. In a nutshell, this paper provides a holistic set of guidelines on how to deploy a broad range of distributed learning frameworks over real-world wireless communication networks.

Edge computing, as one of the key technologies in 6G networks, establishes a distributed computing environment by deploying computation and storage resources in proximity to end users. However, the dense deployment of base stations, cellular dead zones, and high dynamics of mobile devices may cause serious interference issues and weak signal propagation, which will severely affect the transmission efficiency of edge computing and cannot support low-latency applications and services. Reconfigurable intelligent surface (RIS) is a new technology that can enhance the spectral efficiency and suppress interference of wireless communication by adaptively configuring massive low-cost passive reflecting elements. In this article, we introduce RIS into edge computing to support low-latency applications, where edge computing can alleviate the heavy computation pressure of mobile devices with ubiquitously distributed computing resources, and RIS can enhance the quality of the wireless communication link by intelligently altering the radio propagation environment. To elaborate the effectiveness of RIS for edge computing, we then propose a deep-reinforcement-learning-based computation offloading scheme to minimize the total offloading latency of mobile devices. Numerical results indicate that the RIS-aided scheme can improve wireless communication data rate and reduce task execution latency.

Artificial Intelligence (AI) has the potential to leverage the immense amount of operational data of clouds, services, and social and communication networks. As a concrete example, AI techniques have been adopted by telcom operators to develop virtual assistants based on advances in natural language processing (NLP) for interaction with customers and machine learning (ML) to enhance the customer experience by improving customer flow. Machine learning has also been applied to finding fraud patterns which enables operators to focus on dealing with the activity as opposed to the previous focus on detecting fraud.

Edge machine learning involves the deployment of learning algorithms at the network edge to leverage massive distributed data and computation resources to train artificial intelligence (AI) models. Among others, the framework of federated edge learning (FEEL) is popular for its data-privacy preservation. FEEL coordinates global model training at an edge server and local model training at edge devices that are connected by wireless links. This work contributes to the energy-efficient implementation of FEEL in wireless networks by designing joint computation-and-communication resource management ($\text{C}^2$RM). The design targets the state-of-the-art heterogeneous mobile architecture where parallel computing using both a CPU and a GPU, called heterogeneous computing, can significantly improve both the performance and energy efficiency. To minimize the sum energy consumption of devices, we propose a novel $\text{C}^2$RM framework featuring multi-dimensional control including bandwidth allocation, CPU-GPU workload partitioning and speed scaling at each device, and $\text{C}^2$ time division for each link. The key component of the framework is a set of equilibriums in energy rates with respect to different control variables that are proved to exist among devices or between processing units at each device. The results are applied to designing efficient algorithms for computing the optimal $\text{C}^2$RM policies faster than the standard optimization tools. Based on the equilibriums, we further design energy-efficient schemes for device scheduling and greedy spectrum sharing that scavenges "spectrum holes" resulting from heterogeneous $\text{C}^2$ time divisions among devices. Using a real dataset, experiments are conducted to demonstrate the effectiveness of $\text{C}^2$RM on improving the energy efficiency of a FEEL system.

Orthogonal frequency division multiplexing (OFDM) has been widely applied in current communication systems. The artificial intelligence (AI)-aided OFDM receivers are currently brought to the forefront to replace and improve the traditional OFDM receivers. In this study, we first compare two AI-aided OFDM receivers, namely, data-driven fully connected deep neural network and model-driven ComNet, through extensive simulation and real-time video transmission using a 5G rapid prototyping system for an over-the-air (OTA) test. We find a performance gap between the simulation and the OTA test caused by the discrepancy between the channel model for offline training and the real environment. We develop a novel online training system, which is called SwitchNet receiver, to address this issue. This receiver has a flexible and extendable architecture and can adapt to real channels by training only several parameters online. From the OTA test, the AI-aided OFDM receivers, especially the SwitchNet receiver, are robust to real environments and promising for future communication systems. We discuss potential challenges and future research inspired by our initial study in this paper., Comment: 30 pages, 12 figures. Copyright may be transferred without notice, after which this version may no longer be accessible

As sensor-based networks become more prevalent, scaling to unmanageable numbers or deployed in difficult to reach areas, real-time failure localisation is becoming essential for continued operation. Network tomography, a system and application-independent approach, has been successful in localising complex failures (i.e., observable by end-to-end global analysis) in traditional networks. Applying network tomography to wireless sensor networks (WSNs), however, is challenging. First, WSN topology changes due to environmental interactions (e.g., interference). Additionally, the selection of devices for running network monitoring processes (monitors) is an NP-hard problem. Monitors observe end-to-end in-network properties to identify failures, with their placement impacting the number of identifiable failures. Since monitoring consumes more in-node resources, it is essential to minimise their number while maintaining network tomography’s effectiveness. Unfortunately, state-of-the-art solutions solve this optimisation problem using time-consuming greedy heuristics. In this article, we propose two solutions for efficiently applying Network Tomography in WSNs: a graph compression scheme, enabling faster monitor placement by reducing the number of edges in the network, and an adaptive monitor placement algorithm for recovering the monitor placement given topology changes. The experiments show that our solution is at least 1,000× faster than the state-of-the-art approaches and efficiently copes with topology variations in large-scale WSNs.

With the large number of antennas and subcarriers the overhead due to pilot transmission for channel estimation can be prohibitive in wideband massive multiple-input multiple-output (MIMO) systems. This can degrade the overall spectral efficiency significantly, and as a result, curtail the potential benefits of massive MIMO. In this paper, we propose a neural network (NN)-based joint pilot design and downlink channel estimation scheme for frequency division duplex (FDD) MIMO orthogonal frequency division multiplex (OFDM) systems. The proposed NN architecture uses fully connected layers for frequency-aware pilot design, and outperforms linear minimum mean square error (LMMSE) estimation by exploiting inherent correlations in MIMO channel matrices utilizing convolutional NN layers. Our proposed NN architecture uses a non-local attention module to learn longer range correlations in the channel matrix to further improve the channel estimation performance. We also propose an effective pilot reduction technique by gradually pruning less significant neurons from the dense NN layers during training. This constitutes a novel application of NN pruning to reduce the pilot transmission overhead. Our pruning-based pilot reduction technique reduces the overhead by allocating pilots across subcarriers non-uniformly and exploiting the inter-frequency and inter-antenna correlations in the channel matrix efficiently through convolutional layers and attention module.

Recently, convolutional neural network (CNN)-based channel estimation (CE) for massive multiple-input multiple-output communication systems has achieved remarkable success. However, complexity even needs to be reduced, and robustness can even be improved. Meanwhile, existing methods do not accurately explain which channel features help the denoising of CNNs. In this paper, we first compare the strengths and weaknesses of CNN-based CE in different domains. When complexity is limited, the channel sparsity in the angle-delay domain improves denoising and robustness whereas large noise power and pilot contamination are handled well in the spatial-frequency domain. Thus, we develop a novel network, called dual CNN, to exploit the advantages in the two domains. Furthermore, we introduce an extra neural network, called HyperNet, which learns to detect scenario changes from the same input as the dual CNN. HyperNet updates several parameters adaptively and combines the existing dual CNNs to improve robustness. Experimental results show improved estimation performance for the time-varying scenarios. To further exploit the correlation in the time domain, a recurrent neural network framework is developed, and training strategies are provided to ensure robustness to the changing of temporal correlation. This design improves channel estimation performance but its complexity is still low.

As COVID-19 hounds the world, the common cause of finding a swift solution to manage the pandemic has brought together researchers, institutions, governments, and society at large. The Internet of Things (IoT), Artificial Intelligence (AI) — including Machine Learning (ML) and Big Data analytics — as well as Robotics and Blockchain, are the four decisive areas of technological innovation that have been ingenuity harnessed to fight this pandemic and future ones. While these highly interrelated smart and connected health technologies cannot resolve the pandemic overnight and may not be the only answer to the crisis, they can provide greater insight into the disease and support frontline efforts to prevent and control the pandemic. This paper provides a blend of discussions on the contribution of these digital technologies, propose several complementary and multidisciplinary techniques to combat COVID-19, offer opportunities for more holistic studies, and accelerate knowledge acquisition and scientific discoveries in pandemic research. First, four areas where IoT can contribute are discussed, namely, i) tracking and tracing, ii) Remote Patient Monitoring (RPM) by Wearable IoT (WIoT), iii) Personal Digital Twins (PDT), and iv) real-life use case: ICT/IoT solution in Korea. Second, the role and novel applications of AI are explained, namely: i) diagnosis and prognosis, ii) risk prediction, iii) vaccine and drug development, iv) research dataset, v) early warnings and alerts, vi) social control and fake news detection, and vii) communication and chatbot. Third, the main uses of robotics and drone technology are analyzed, including i) crowd surveillance, ii) public announcements, iii) screening and diagnosis, and iv) essential supply delivery. Finally, we discuss how Distributed Ledger Technologies (DLTs), of which blockchain is a common example, can be combined with other technologies for tackling COVID-19.

In resource-constrained IoT networks, the use of conventional message authentication codes (MACs) to provide message authentication and integrity is not possible due to the large size of the MAC output. A straightforward yet naive solution to this problem is to employ a truncated MAC which undesirably sacrifices cryptographic strength in exchange for reduced communication overhead. In this paper, we address this problem by proposing a novel approach for message authentication called \textit{Cumulative Message Authentication Code} (CuMAC), which consists of two distinctive procedures: \textit{aggregation} and \textit{accumulation}. In aggregation, a sender generates compact authentication tags from segments of multiple MACs by using a systematic encoding procedure. In accumulation, a receiver accumulates the cryptographic strength of the underlying MAC by collecting and verifying the authentication tags. Embodied with these two procedures, CuMAC enables the receiver to achieve an advantageous trade-off between the cryptographic strength and the latency in processing of the authentication tags. Furthermore, for some latency-sensitive messages where this trade-off may be unacceptable, we propose a variant of CuMAC that we refer to as \textit{CuMAC with Speculation} (CuMAC/S). In addition to the aggregation and accumulation procedures, CuMAC/S enables the sender and receiver to employ a speculation procedure for predicting future message values and pre-computing the corresponding MAC segments. For the messages which can be reliably speculated, CuMAC/S significantly reduces the MAC verification latency without compromising the cryptographic strength. We have carried out comprehensive evaluation of CuMAC and CuMAC/S through simulation and a prototype implementation on a real car.

Distributed software-defined networks (SDN), consisting of multiple inter-connected network domains, each managed by one SDN controller, is an emerging networking architecture that offers balanced centralized control and distributed operations. In such networking paradigm, most existing works focus on designing sophisticated controller-synchronization strategies to improve joint controller-decision-making for inter-domain routing. However, there is still a lack of fundamental understanding of how the performance of distributed SDN is related to network attributes, thus impossible to justify the necessity of complicated strategies. In this regard, we analyse and quantify how the performance enhancement of distributed SDN architectures is influenced by inter-domain synchronization levels, in terms of the resulting number of abstracted routing clusters, and network structural properties. Based on a generic network model incorporating link preference for path constructions, we establish analytical lower bounds for quantifying the routing performance under any arbitrarily given network synchronization status. The significance of these performance bounds is that they can be used to quantify the contribution of controller synchronization levels in improving the network performance under different network parameters, which therefore serves as a fundamental guidance for future SDN performance analysis and protocol designs.

The combination of large bandwidth at terahertz (THz) and the large number of antennas in massive MIMO results in the non-negligible spatial wideband effect in time domain or the corresponding beam squint issue in frequency domain, which will cause severe performance degradation if not properly treated. In particular, for a phased array based hybrid transceiver, there exists a contradiction between the requirement of mitigating the beam squint issue and the hardware implementation of the analog beamformer/combiner, which makes the accurate beamforming an enormous challenge. In this paper, we propose two wideband hybrid beamforming approaches, based on the virtual sub-array and the true-time-delay (TTD) lines, respectively, to eliminate the impact of beam squint. The former one divides the whole array into several virtual sub-arrays to generate a wider beam and provides an evenly distributed array gain across the whole operating frequency band. To further enhance the beamforming performance and thoroughly address the aforementioned contradiction, the latter one introduces the TTD lines and propose a new hardware implementation of analog beamformer/combiner. This TTD-aided hybrid implementation enables the wideband beamforming and achieves the near-optimal performance close to full-digital transceivers. Analytical and numerical results demonstrate the effectiveness of two proposed wideband beamforming approaches.

Far-field Wireless Power Transfer (WPT) has emerged as a potential power source for the Internet of Things (IoT) and Wireless Sensor Network (WSN).The expansion of the power transfer range is one of the key challenges to make the technology viable. In this paper, we experimentally study a channel-adaptive joint beamforming and waveform architecture to expand the power transfer range. WPT experiments have been conducted in a variety of wireless channels at various distances in a realistic indoor environment. The measurement data have been fitted using a simple analytical model to analyze the output DC power and achievable range improvement depending on the signal design schemes and the number of tones and antennas. The model shows a clear relationship between signal design versus output DC power and achievable range, and highlight the significant benefit of the proposed architecture to expand the power transfer range., Accepted to IEEE Wireless Communications Letters

Scheduling the transmission of time-sensitive information from a source node to multiple users over error-prone communication channels is studied with the goal of minimizing the long-term average age of information (AoI) at the users. A long-term average resource constraint is imposed on the source, which limits the average number of transmissions. The source can transmit only to a single user at each time slot, and after each transmission, it receives an instantaneous ACK/NACK feedback from the intended receiver, and decides when and to which user to transmit the next update. Assuming the channel statistics are known, the optimal scheduling policy is studied for both the standard automatic repeat request (ARQ) and hybrid ARQ (HARQ) protocols. Then, a reinforcement learning (RL) approach is introduced to find a near-optimal policy, which does not assume any a priori information on the random processes governing the channel states. Different RL methods including average-cost SARSA with linear function approximation (LFA), upper confidence reinforcement learning (UCRL2), and deep Q-network (DQN) are applied and compared through numerical simulations.

Fog-assisted Internet-of-Things (Fog-IoT) systems are deployed in remote and unprotected environments, making them vulnerable to security, privacy, and trust challenges. Existing studies propose security schemes and trust models for these systems. However, mitigation of insider attacks, namely, blackhole, sinkhole, sybil, collusion, self-promotion, and privilege escalation, has always been a challenge and mostly carried out by the legitimate nodes. Compared to other studies, this article proposes a framework featuring attribute-based access control and trust-based behavioral monitoring to address the challenges mentioned above. The proposed framework consists of two components, the security component (SC) and the trust management component (TMC). SC ensures data confidentiality, integrity, authentication, and authorization. TMC evaluates Fog-IoT entities’ performance using a trust model based on a set of Quality of Service (QoS) and network communication features. Subsequently, trust is embedded as an attribute within SC’s access control policies, ensuring that only trusted entities are granted access to fog resources. Several attacking scenarios, namely, Denial of Service (DoS), Distributed DoS, probing, and data theft are designed to elaborate on how the change in trust triggers the change in access rights and, therefore, validates the proposed integrated framework’s design principles. The framework is evaluated on a Raspberry Pi 3 Model B+ to benchmark its performance in terms of time and memory complexity. Our results show that both SC and TMC are lightweight and suitable for resource-constrained devices.

Sampling from the lattice Gaussian distribution has emerged as a key problem in coding and decoding while Markov chain Monte Carlo (MCMC) methods from statistics offer an effective way to solve it. In this paper, the sliced lattice Gaussian sampling algorithm is proposed to further improve the convergence performance of the Markov chain targeting at lattice Gaussian sampling. We demonstrate that the Markov chain arising from it is uniformly ergodic, namely, it converges exponentially fast to the stationary distribution. Meanwhile, the convergence rate of the underlying Markov chain is also investigated, and we show the proposed sliced sampling algorithm entails a better convergence performance than the independent Metropolis-Hastings-Klein (IMHK) sampling algorithm. On the other hand, the decoding performance based on the proposed sampling algorithm is analyzed, where the optimization with respect to the standard deviation $\sigma >0$ of the target lattice Gaussian distribution is given. After that, a judicious mechanism based on distance judgement and dynamic updating for choosing $\sigma $ is proposed for a better decoding performance. Finally, simulation results based on multiple-input multiple-output (MIMO) detection are presented to confirm the performance gain by the convergence enhancement and the parameter optimization.

Network and Service analytics can harness the immense stream of operational data from clouds, to services, to social and communication networks. In the era of big data and connected devices of all varieties, analytics and machine learning have found ways to improve reliability, configuration, performance, fault and security management. In particular, we see a growing trend towards using machine learning, artificial intelligence and data analytics to improve operations and management of information technology services, systems and networks.

In a majority of research on covert communications, knowledge about channel state information (CSI) of main channel and/or warden channel is assumed to be known or partially known. However, a covert user may not afford to perform channel estimation in practice, and acquiring the warden’s CSI is even impossible. In this paper, we investigate covert communications over non-coherent Rayleigh fading channels, in both i.i.d. fast fading and slow fading cases. We observe that the purpose of covert communication in many scenarios is to hide the existence of the sender, not the receiver. Therefore, we allow the receiver to work in full-duplex mode such that it can emit artificial noise (AN) while receiving signals simultaneously. We analyse the achievable covert rates with fixed and varying AN power and show that in both fast and slow fading cases, it is possible to achieve a positive covert rate. For the slow fading case, we further extend the proposed strategy to a multi-user scenario, in which multiple other users share the same spectral resource and cause interference at the warden. Extensive simulations are performed to verify the correctness of our analysis, which provide new insights on the AN design problem in non-coherent channels.

The proliferation of mobile smart devices with ever improving sensing capacities means that human-centric Mobile Crowdsensing Systems (MCSs) can economically provide a large scale and flexible sensing solution. The use of personal mobile devices is a sensitive issue, therefore it is mandatory for practical MCSs to preserve private information (the user's true identity, precise location, etc.) while collecting the required sensing data. However, well intentioned privacy protection techniques also conceal autonomous, or even malicious, behaviors of device owners (termed as self-interested), where the objectivity and accuracy of crowdsensing data can therefore be severely threatened. The issue of data quality due to untruthful reporting in privacy-preserving MCSs has been yet to produce solutions. Bringing together game theory, algorithmic mechanism design, and truth discovery, we develop a mechanism to guarantee and enhance the quality of crowdsensing data without jeopardizing the privacy of MCS participants. Together with solid theoretical justifications, we evaluate the performance of our proposal with extensive real-world MCS trace-driven simulations. Experimental results demonstrate the effectiveness of our mechanism on both enhancing the quality of the crowdsensing data and eliminating the motivation of MCS participants, even when their privacy is well protected, to report untruthfully.

We experimentally study the interaction between intense infrared few-cycle laser pulses and an ultrathin (∼2 µm) flat liquid sheet of isopropanol running in vacuum. We observe a rapid decline in transmission above a critical peak intensity of 50 TW/cm2 of the initially transparent liquid sheet, and the emission of a plume of material. We find both events are due to the creation of a surface plasma and are similar to processes observed in dielectric solids. After calculating the electron density for different laser peak intensities, we find an electron scattering rate of 0.3 fs-1 in liquid isopropanol to be consistent with our data. We study the dynamics of the plasma plume to find the expansion velocity of the plume front.

Structures which appear to move at or near the velocity of light contain singular points. Energy generated by the motion accumulates at these points into ever-narrowing peaks. In this paper we show that energy is generated by a curious process that conserves the number of photons, adding energy by forcing photons already present to climb a ladder of increasing frequency. We present both a classical proof based on conservation of lines of force, and a more formal QED proof demonstrating the absence of unpaired creation and annihilation operators. Exceptions to this rule are found when negative frequencies make an appearance. Finally we make a connection to laboratory-based models of black holes and Hawking radiation., 13 pages, 4 figures

PlugSonic is a series of web- and mobile-based applications designed to edit samples and apply audio effects (PlugSonic Sample) and create and experience dynamic and navigable soundscapes and sonic narratives (PlugSonic Soundscape). The audio processing within PlugSonic is based on the Web Audio API while the binaural rendering uses the 3D Tune-In Toolkit. Exploration of soundscapes in a physical space is made possible by adopting Apple’s ARKit. The present paper describes the implementation details, the signal processing chain and the necessary steps to curate and experience a soundscape. We also include some metrics and performance details. The main goal of PlugSonic is to give users a complete set of tools, without the need for specific devices, external software and/or hardware specialised knowledge, or custom development, with the idea that spatial audio has the potential to become a readily accessible and easy to understand technology, for anyone to adopt, whether for creative or research purposes.

Computer-mediated communication (CMC) research has shown that avatars influence user behaviours in both video game and social media environments. This study aims to investigate customisable avatars used in a spontaneous doctoral community on Reddit (a social media and discussion website) and identify avatar characteristics that may facilitate collaborative learning through text mining and crowd-sourced data coding. As a work in progress, the research questions and methods for Reddit data collection and analysis will be presented to get feedback from other ISLS members in the New Members Session at ISLS Annual Meeting 2022. The findings from this study would be applied to improve the design of Tuvatar.com (an avatar-mediated small group learning environment) which will be presented in the main poster session at the CSCL conference 2022.

We study the image retrieval problem at the wireless edge, where an edge device captures an image, which is then used to retrieve similar images from an edge server. These can be images of the same person or a vehicle taken from other cameras at different times and locations. Our goal is to maximize the accuracy of the retrieval task under power and bandwidth constraints over the wireless link. Due to the stringent delay constraint of the underlying application, sending the whole image at a sufficient quality is not possible. We propose two alternative schemes based on digital and analog communications, respectively. In the digital approach, we first propose a deep neural network (DNN) aided retrieval-oriented image compression scheme, whose output bit sequence is transmitted over the channel using conventional channel codes. In the analog joint source and channel coding (JSCC) approach, the feature vectors are directly mapped into channel symbols. We evaluate both schemes on image based re-identification (re-ID) tasks under different channel conditions, including both static and fading channels. We show that the JSCC scheme significantly increases the end-to-end accuracy, speeds up the encoding process, and provides graceful degradation with channel conditions. The proposed architecture is evaluated through extensive simulations on different datasets and channel conditions, as well as through ablation studies.

Coupled resonator filters implemented as microelectromechanical systems (MEMS) offer performance advantages as band-pass filters at MHz frequencies. Here new designs based on resonant cavities for acoustic slow waves are developed to allow alternative frequency responses. Derivation of the lumped element model for coupled beam systems with in-plane motion from Rayleigh–Ritz perturbation theory is first reviewed. Departures from ideal behaviour caused by mechanical and electrostatic detuning are resolved. Slow wave theory is then used to develop linear array topologies with novel responses including band-stop and comb filtering with controlled filter roll-off. A systematic procedure is developed to allow rapid identification of design parameters without the need for lengthy numerical simulation, using the lumped element, stiffness matrix and finite element methods to investigate the layout parameters of initial design concepts, detailed mechanical effects and detailed electrostatic effects, respectively. High performance is demonstrated, with good agreement between the models.

In networks of mobile autonomous agents, e.g. for data acquisition, we may wish to maximize data transfer or to reliably transfer a minimum amount of data, subject to quality of service or energy constraints. These requirements can be guaranteed through both offline node design/specifications and online trajectory/communications design. Regardless of the distance between them, for a stationary point-to-point transmitter-receiver pair communicating across a single link under average power constraints, the total data transfer is unbounded as time tends to infinity. In contrast, we show that if the transmitter/receiver is moving at any constant speed away from each other, then the maximum transmittable data is bounded. Although general closed-form expressions as a function of communication and mobility profile parameters do not yet exist, we provide closed-form expressions for particular cases, such as ideal free space path loss. Under more general scenarios we instead give lower bounds on the total transmittable information across a single link between mobile nodes., 5 pages, 4 figures, to be published in IEEE Communications Letters

We consider the problem of secure distributed matrix computation (SDMC), where a \textit{user} queries a function of data matrices generated at distributed \textit{source} nodes. We assume the availability of $N$ honest but curious computation servers, which are connected to the sources, the user, and each other through orthogonal and reliable communication links. Our goal is to minimize the amount of data that must be transmitted from the sources to the servers, called the \textit{upload cost}, while guaranteeing that no $T$ colluding servers can learn any information about the source matrices, and the user cannot learn any information beyond the computation result. We first focus on secure distributed matrix multiplication (SDMM), considering two matrices, and propose a novel polynomial coding scheme using the properties of finite field discrete Fourier transform, which achieves an upload cost significantly lower than the existing results in the literature. We then generalize the proposed scheme to include straggler mitigation, and to the multiplication of multiple matrices while keeping the input matrices, the intermediate computation results, as well as the final result secure against any $T$ colluding servers. We also consider a special case, called computation with own data, where the data matrices used for computation belong to the user. In this case, we drop the security requirement against the user, and show that the proposed scheme achieves the minimal upload cost. We then propose methods for performing other common matrix computations securely on distributed servers, including changing the parameters of secret sharing, matrix transpose, matrix exponentiation, solving a linear system, and matrix inversion, which are then used to show how arbitrary matrix polynomials can be computed securely on distributed servers using the proposed procedure., Under review, 13 pages, 3 figures

Bayesian neural networks (BayesNNs) have demonstrated their advantages in various safety-critical applications, such as autonomous driving or healthcare, due to their ability to capture and represent model uncertainty. However, standard BayesNNs require to be repeatedly run because of Monte Carlo sampling to quantify their uncertainty, which puts a burden on their real-world hardware performance. To address this performance issue, this paper systematically exploits the extensive structured sparsity and redundant computation in BayesNNs. Different from the unstructured or structured sparsity in standard convolutional NNs, the structured sparsity of BayesNNs is introduced by Monte Carlo Dropout and its associated sampling required during uncertainty estimation and prediction, which can be exploited through both algorithmic and hardware optimizations. We first classify the observed sparsity patterns into three categories: channel sparsity, layer sparsity and sample sparsity. On the algorithmic side, a framework is proposed to automatically explore these three sparsity categories without sacrificing algorithmic performance. We demonstrated that structured sparsity can be exploited to accelerate CPU designs by up to 49 times, and GPU designs by up to 40 times. On the hardware side, a novel hardware architecture is proposed to accelerate BayesNNs, which achieves a high hardware performance using the runtime adaptable hardware engines and the intelligent skipping support. Upon implementing the proposed hardware design on an FPGA, our experiments demonstrated that the algorithm-optimized BayesNNs can achieve up to 56 times speedup when compared with unoptimized Bayesian nets. Comparing with the optimized GPU implementation, our FPGA design achieved up to 7.6 times speedup and up to 39.3 times higher energy efficiency.

Lattices are a popular field of study in mathematical research, but also in more practical areas like cryptology or multiple-input/multiple-output (MIMO) transmission. In mathematical theory, most often lattices over real numbers are considered. However, in communications, complex-valued processing is usually of interest. Besides, by the use of dual-polarized transmission as well as by the combination of two time slots or frequencies, four-dimensional (quaternion-valued) approaches become more and more important. Hence, to account for this fact, well-known lattice algorithms and related concepts are generalized in this work. To this end, a brief review of complex arithmetic, including the sets of Gaussian and Eisenstein integers, and an introduction to quaternion-valued numbers, including the sets of Lipschitz and Hurwitz integers, are given. On that basis, generalized variants of two important algorithms are derived: first, of the polynomial-time LLL algorithm, resulting in a reduced basis of a lattice by performing a special variant of the Euclidean algorithm defined for matrices, and second, of an algorithm to calculate the successive minima - the norms of the shortest independent vectors of a lattice - and its related lattice points. Generalized bounds for the quality of the particular results are established and the asymptotic complexities of the algorithms are assessed. These findings are extensively compared to conventional real-valued processing. It is shown that the generalized approaches outperform their real-valued counterparts in complexity and/or quality aspects. Moreover, the application of the generalized algorithms to MIMO communications is studied, particularly in the field of lattice-reduction-aided and integer-forcing equalization.

Rate-splitting multiple access (RSMA) has emerged as a novel, general, and powerful framework for the design and optimization of non-orthogonal transmission, multiple access (MA), and interference management strategies for future wireless networks. Through information and communication theoretic analysis, RSMA has been shown to be optimal (from a Degrees-of-Freedom region perspective) in several transmission scenarios. Compared to the conventional MA strategies used in 5G, RSMA enables spectral efficiency (SE), energy efficiency (EE), coverage, user fairness, reliability, and quality of service (QoS) enhancements for a wide range of network loads (including both underloaded and overloaded regimes) and user channel conditions. Furthermore, it enjoys a higher robustness against imperfect channel state information at the transmitter (CSIT) and entails lower feedback overhead and complexity. Despite its great potential to fundamentally change the physical (PHY) layer and media access control (MAC) layer of wireless communication networks, RSMA is still confronted with many challenges on the road towards standardization. In this paper, we present the first comprehensive overview on RSMA by providing a survey of the pertinent state-of-the-art research, detailing its architecture, taxonomy, and various appealing applications, as well as comparing with existing MA schemes in terms of their overall frameworks, performance, and complexities. An in-depth discussion of future RSMA research challenges is also provided to inspire future research on RSMA-aided wireless communication for beyond 5G systems., 53 pages, 33 figures, accepted by IEEE Communications Surveys & Tutorials

Multiphoton contributions pose a significant challenge for the realisation of heralded single-photon sources (HSPS) based on nonlinear processes. In this work, we improve the quality of single photons generated in this way by harnessing the photon-number resolving (PNR) capabilities of commercial superconducting nanowire single-photon detectors (SNSPDs). We report a $13 \pm 0.4 \%$ reduction in the intensity correlation function $g^{(2)}(0)$ even with a collection efficiency in the photon source of only $29.6\%$. Our work demonstrates the first application of the PNR capabilities of SNSPDs and shows improvement in the quality of an HSPS with widely available technology., Comment: 10 pages, 4 figures

We study federated learning (FL), where power-limited wireless devices utilize their local datasets to collaboratively train a global model with the help of a remote parameter server (PS). The PS has access to the global model and shares it with the devices for local training, and the devices return the result of their local updates to the PS to update the global model. This framework requires downlink transmission from the PS to the devices and uplink transmission from the devices to the PS. The goal of this study is to investigate the impact of the bandwidth-limited shared wireless medium in both the downlink and uplink on the performance of FL with a focus on the downlink. To this end, the downlink and uplink channels are modeled as fading broadcast and multiple access channels, respectively, both with limited bandwidth. For downlink transmission, we first introduce a digital approach, where a quantization technique is employed at the PS to broadcast the global model update at a common rate such that all the devices can decode it. Next, we propose analog downlink transmission, where the global model is broadcast by the PS in an uncoded manner. We consider analog transmission over the uplink in both cases. We further analyze the convergence behavior of the proposed analog approach assuming that the uplink transmission is error-free. Numerical experiments show that the analog downlink approach provides significant improvement over the digital one, despite a significantly lower transmit power at the PS. The experimental results corroborate the convergence results, and show that a smaller number of local iterations should be used when the data distribution is more biased, and also when the devices have a better estimate of the global model in the analog downlink approach., Comment: submitted for publication

We present a learning-based channel-adaptive joint source and channel coding (CA-JSCC) scheme for wireless image transmission over multipath fading channels. The proposed method is an end-to-end autoencoder architecture with a dual-attention mechanism employing orthogonal frequency division multiplexing (OFDM) transmission. Unlike the previous works, our approach is adaptive to channel-gain and noise-power variations by exploiting the estimated channel state information (CSI). Specifically, with the proposed dual-attention mechanism, our model can learn to map the features and allocate transmission-power resources judiciously based on the estimated CSI. Extensive numerical experiments verify that CA-JSCC achieves state-of-the-art performance among existing JSCC schemes. In addition, CA-JSCC is robust to varying channel conditions and can better exploit the limited channel resources by transmitting critical features over better subchannels., Comment: IEEE Wireless Communications Letters

The rapid development of Industrial Internet of Things (IIoT) technologies has not only enabled new applications, but also presented new challenges for reliable communication with limited resources. In this work, we define a deceptively simple novel problem that can arise in these scenarios, in which a set of sensors need to communicate a joint observation. This observation is shared by a random subset of the nodes, which need to propagate it to the rest of the network, but coordination is complex: as signaling constraints require the use of random access schemes over shared channels, each sensor needs to implicitly coordinate with others with the same observation, so that at least one of the transmissions gets through without collisions. Unlike existing medium access control schemes, the goal here is not to maximize total goodput, but rather to make sure that the shared message gets through, regardless of the sender. The lack of any signaling, aside from an acknowledgment or lack thereof from the rest of the network, makes determining the optimal collective transmission strategy a significant challenge. We analyze this coordination problem theoretically, prove its hardness, and provide low-complexity solutions. While a low-complexity clustering-based approach is shown to provide near-optimal performance in certain special cases, for the general scenarios, we model each sensor as a multi-armed bandit (MAB), and provide a learning-based solution. Numerical results show the effectiveness of this approach in a variety of cases., Comment: Submitted to IEEE INFOCOM Workshops 2022

Computer-mediated communication (CMC) research has shown that avatars influence user behaviours in both video game and social media environments. This study aims to investigate customisable avatars used in a spontaneous doctoral community on Reddit (a social media and discussion website) and identify avatar characteristics that may facilitate collaborative learning through text mining and crowd-sourced data coding. As a work in progress, the research questions and methods for Reddit data collection and analysis will be presented to get feedback from other ISLS members in the New Members Session at ISLS Annual Meeting 2022. The findings from this study would be applied to improve the design of Tuvatar.com (an avatar-mediated small group learning environment) which will be presented in the main poster session at the CSCL conference 2022.

We introduce the conceptual formulation, design, fabrication, control and commercial translation with IoT connection of a hybrid-face social robot and validation of human emotional response to its affective interactions. The hybrid-face robot integrates a 3D printed faceplate and a digital display to simplify conveyance of complex facial movements while providing the impression of three-dimensional depth for natural interaction. We map the space of potential emotions of the robot to specific facial feature parameters and characterise the recognisability of the humanoid hybrid-face robot's archetypal facial expressions. We introduce pupil dilation as an additional degree of freedom for conveyance of emotive states. Human interaction experiments demonstrate the ability to effectively convey emotion from the hybrid-robot face to human observers by mapping their neurophysiological electroencephalography (EEG) response to perceived emotional information and through interviews. Results show main hybrid-face robotic expressions can be discriminated with recognition rates above 80% and invoke human emotive response similar to that of actual human faces as measured by the face-specific N170 event-related potentials in EEG. The hybrid-face robot concept has been modified, implemented, and released in the commercial IoT robotic platform Miko (My Companion), an affective robot with facial and conversational features currently in use for human-robot interaction in children by Emotix Inc. We demonstrate that human EEG responses to Miko emotions are comparative to neurophysiological responses for actual human facial recognition. Finally, interviews show above 90% expression recognition rates in our commercial robot. We conclude that simplified hybrid-face abstraction conveys emotions effectively and enhances human-robot interaction., This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible

Workflow scheduling is a long-studied problem in parallel and distributed computing (PDC), aiming to efficiently utilize compute resources to meet user's service requirements. Recently proposed scheduling methods leverage the low response times of edge computing platforms to optimize application Quality of Service (QoS). However, scheduling workflow applications in mobile edge-cloud systems is challenging due to computational heterogeneity, changing latencies of mobile devices and the volatile nature of workload resource requirements. To overcome these difficulties, it is essential, but at the same time challenging, to develop a long-sighted optimization scheme that efficiently models the QoS objectives. In this work, we propose MCDS: Monte Carlo Learning using Deep Surrogate Models to efficiently schedule workflow applications in mobile edge-cloud computing systems. MCDS is an Artificial Intelligence (AI) based scheduling approach that uses a tree-based search strategy and a deep neural network-based surrogate model to estimate the long-term QoS impact of immediate actions for robust optimization of scheduling decisions. Experiments on physical and simulated edge-cloud testbeds show that MCDS can improve over the state-of-the-art methods in terms of energy consumption, response time, SLA violations and cost by at least 6.13, 4.56, 45.09 and 30.71 percent respectively., Comment: Accepted in IEEE Transactions on Parallel and Distributed Systems (Special Issue on PDC for AI), 2022

We present DeepWiVe, the first-ever end-to-end joint source-channel coding (JSCC) video transmission scheme that leverages the power of deep neural networks (DNNs) to directly map video signals to channel symbols, combining video compression, channel coding, and modulation steps into a single neural transform. Our DNN decoder predicts residuals without distortion feedback, which improves video quality by accounting for occlusion/disocclusion and camera movements. We simultaneously train different bandwidth allocation networks for the frames to allow variable bandwidth transmission. Then, we train a bandwidth allocation network using reinforcement learning (RL) that optimizes the allocation of limited available channel bandwidth among video frames to maximize overall visual quality. Our results show that DeepWiVe can overcome the cliff-effect, which is prevalent in conventional separation-based digital communication schemes, and achieve graceful degradation with the mismatch between the estimated and actual channel qualities. DeepWiVe outperforms H.264 video compression followed by low-density parity check (LDPC) codes in all channel conditions by up to 0.0462 on average in terms of the multi-scale structural similarity index measure (MS-SSIM), while beating H.265 + LDPC by up to 0.0058 on average. We also illustrate the importance of optimizing bandwidth allocation in JSCC video transmission by showing that our optimal bandwidth allocation policy is superior to the na\"ive uniform allocation. We believe this is an important step towards fulfilling the potential of an end-to-end optimized JSCC wireless video transmission system that is superior to the current separation-based designs.

LoRaWAN deployments follow an ad-hoc deployment model that has organically led to overlapping communication networks, sharing the wireless spectrum, and completely unaware of each other. LoRaWAN uses ALOHA-style communication where it is almost impossible to schedule transmission between networks belonging to different owners properly. The inability to schedule overlapping networks will cause inter-network interference, which will increase node-to-gateway message losses and gateway-to-node acknowledgement failures. This problem is likely to get worse as the number of LoRaWAN networks increase. In response to this problem, we propose IRONWAN, a wireless overlay network that shares communication resources without modifications to underlying protocols. It utilises the broadcast nature of radio communication and enables gateway-to-gateway communication to facilitate the search for failed messages and transmit failed acknowledgements already received and cached in overlapping network's gateways. IRONWAN uses two novel algorithms, a Real-time Message Inter-arrival Predictor, to highlight when a server has not received an expected uplink message. The Interference Predictor ensures that extra gateway-to-gateway communication does not negatively impact communication bandwidth. We evaluate IRONWAN on a 1000-node simulator with up to ten gateways and a 10-node testbed with 2-gateways. Results show that IRONWAN can achieve up to 12\% higher packet delivery ratio (PDR) and total messages received per node while increasing the minimum PDR by up to 28\%. These improvements save up to 50\% node's energy. Finally, we demonstrate that IRONWAN has comparable performance to an optimal solution (wired, centralised) but with 2-32 times lower communication costs. IRONWAN also has up to 14\% better PDR when compared to FLIP, a wired-distributed gateway-to-gateway protocol in certain scenarios., Accepted for publication at IEEE Internet of Things Journal

This paper proposes and evaluates an integrated method for real-time, head-tracked, 3D binaural audio with synthetic reverberation. Virtual vector base amplitude panning is used to position the sound source and spatialize outputs from a scattering delay network reverb algorithm running in parallel. A unique feature of this approach is its realization of interactive auralization using vector base amplitude panning and a scattering delay network, within acceptable levels of latency, at low computational cost. The rendering model also allows direct parameterization of room geometry and absorption characteristics. Varying levels of reverb complexity can be implemented, and these were evaluated against two distinct aspects of perceived sonic immersion. Outcomes from the evaluation provide benchmarks for how the approach could be deployed adaptively, to balance three real-time spatial audio objectives of envelopment, naturalness, and efficiency, within contrasting physical spaces

Over-the-air computation (OAC) is a promising technique to realize fast model aggregation in the uplink of federated edge learning. OAC, however, hinges on accurate channel-gain precoding and strict synchronization among the edge devices, which are challenging in practice. As such, how to design the maximum likelihood (ML) estimator in the presence of residual channel-gain mismatch and asynchronies is an open problem. To fill this gap, this paper formulates the problem of misaligned OAC for federated edge learning and puts forth a whitened matched filtering and sampling scheme to obtain oversampled, but independent, samples from the misaligned and overlapped signals. Given the whitened samples, a sum-product ML estimator and an aligned-sample estimator are devised to estimate the arithmetic sum of the transmitted symbols. In particular, the computational complexity of our sum-product ML estimator is linear in the packet length and hence is significantly lower than the conventional ML estimator. Extensive simulations on the test accuracy versus the average received energy per symbol to noise power spectral density ratio (EsN0) yield two main results: 1) In the low EsN0 regime, the aligned-sample estimator can achieve superior test accuracy provided that the phase misalignment is non-severe. In contrast, the ML estimator does not work well due to the error propagation and noise enhancement in the estimation process. 2) In the high EsN0 regime, the ML estimator attains the optimal learning performance regardless of the severity of phase misalignment. On the other hand, the aligned-sample estimator suffers from a test-accuracy loss caused by phase misalignment., Comment: 16 pages, 12 figures