Search

Mobile Edge Caching (MEC) is a revolutionary technology for the Sixth Generation (6G) of wireless networks with the promise to significantly reduce users' latency via offering storage capacities at the edge of the network. The efficiency of the MEC network, however, critically depends on its ability to dynamically predict/update the storage of caching nodes with the top-K popular contents. Conventional statistical caching schemes are not robust to the time-variant nature of the underlying pattern of content requests, resulting in a surge of interest in using Deep Neural Networks (DNNs) for time-series popularity prediction in MEC networks. However, existing DNN models within the context of MEC fail to simultaneously capture both temporal correlations of historical request patterns and the dependencies between multiple contents. This necessitates an urgent quest to develop and design a new and innovative popularity prediction architecture to tackle this critical challenge. The paper addresses this gap by proposing a novel hybrid caching framework based on the attention mechanism. Referred to as the parallel Vision Transformers with Cross Attention (ViT-CAT) Fusion, the proposed architecture consists of two parallel ViT networks, one for collecting temporal correlation, and the other for capturing dependencies between different contents. Followed by a Cross Attention (CA) module as the Fusion Center (FC), the proposed ViT-CAT is capable of learning the mutual information between temporal and spatial correlations, as well, resulting in improving the classification accuracy, and decreasing the model's complexity about 8 times. Based on the simulation results, the proposed ViT-CAT architecture outperforms its counterparts across the classification accuracy, complexity, and cache-hit ratio.

With the proliferated low-Earth-orbit (LEO) satellites in mega-constellations, the future Internet will be able to reach any place on Earth, providing high-quality services to everyone. However, high-quality operations in terms of timeliness and resilience are lacking in the current solutions. This paper proposes a multi-layer networking approach called "Cross-Layer Descent (CLD)". Based on the proposed system model, principles, and measures, CLD can support foundational services such as telecommand (TC) transmissions for various network operation missions for LEO satellites compliant with the Consultative Committee for Space Data Systems (CCSDS) standards. The CLD approach enhances timing and resilience requirements using advanced communication payloads. From the simulation-based analysis, the proposed scheme outperforms other classical ones in resilience and latency for typical TC missions. The future work and conclusive remarks are discussed at the end., 2023 IEEE Wireless Communications and Networking Conference (WCNC), 26--29 March 2023, Glasgow, UK

The rise of smartphones has led to a significant increase in the usage of mobile payments. Mobile payments allow individuals to access financial resources and make transactions through their mobile devices while on the go. However, the current mobile payment systems were designed to align with traditional payment structures, which limits the full potential of smartphones, including their security features. This has become a major concern in the rapidly growing mobile payment market. To address these security concerns,in this paper we propose new mobile payment architecture. This architecture leverages the advanced capabilities of modern smartphones to verify various aspects of a payment, such as funds, biometrics, location, and others. The proposed system aims to guarantee the legitimacy of transactions and protect against identity theft by verifying multiple elements of a payment. The security of mobile payment systems is crucial, given the rapid growth of the market. Evaluating mobile payment systems based on their authentication, encryption, and fraud detection capabilities is of utmost importance. The proposed architecture provides a secure mobile payment solution that enhances the overall payment experience by taking advantage of the advanced capabilities of modern smartphones. This will not only improve the security of mobile payments but also offer a more user-friendly payment experience for consumers.

In federated learning (FL) with top $r$ sparsification, millions of users collectively train a machine learning (ML) model locally, using their personal data by only communicating the most significant $r$ fraction of updates to reduce the communication cost. It has been shown that the values as well as the indices of these selected (sparse) updates leak information about the users' personal data. In this work, we investigate different methods to carry out user-database communications in FL with top $r$ sparsification efficiently, while guaranteeing information theoretic privacy of users' personal data. These methods incur considerable storage cost. As a solution, we present two schemes with different properties that use MDS coded storage along with a model segmentation mechanism to reduce the storage cost at the expense of a controllable amount of information leakage, to perform private FL with top $r$ sparsification., Comment: arXiv admin note: text overlap with arXiv:2212.09704

In this paper, we propose, design, deploy and demonstrate a two-tier Low Power Wide Area Network (LP WAN) system based on Unmanned Aerial Vehicle (UAV) base stations suitable for dynamic deployment in deep rural environments. The proposed UAV-based LP WAN network augments the existing macro-cellular LP WAN network (Tier 1) with an additional layer of mobile base stations (Tier 2) based also on LP WAN technology. Mobile Tier 2 LP WAN base stations provide connectivity to static or mobile LP WAN user equipment deployed in the areas without direct Tier 1 LP WAN network coverage. The proposed two-tier LP WAN network scenario is suitable for various agricultural, forestry and environmental applications such as livestock or wild animal monitoring. In this experimental work, we report the prototype that was successfully deployed and used in a real-world deep rural environment without Tier 1 LP WAN network coverage., Comment: This paper presents an extended version of the solution presented by a joint University of Novi Sad and Lusofona University team at the IEEE Vehicular Technology Society UAV Innovation Challenge. The team won the first prize at both the first and the second (final) competition stage

Industry-led initiatives such as the Next G Alliance are currently considering how to dimension the spectrum required to support new classes of services envisioned beyond 5G. In particular, support for ultra-reliable low-latency communication (URLLC) brings the challenge of how to dimension stochastic wireless networks to meet stringent reliability and latency requirements. Our analysis indicates that the bandwidth needed to meet URLLC goals can be on the order of gigahertz, beyond what is available in today's mobile networks. Network densification can ease those bandwidth needs but requires new deployment strategies involving substantially larger numbers of sites. As an alternative, we consider multi-connectivity and multi-operator network sharing as efficient ways to reduce the demand for bandwidth without outright deployment of additional base stations. Accepted version

Federated learning (FL) provides an emerging approach for collaboratively training semantic encoder/decoder models of semantic communication systems, without private user data leaving the devices. Most existing studies on trustworthy FL aim to eliminate data poisoning threats that are produced by malicious clients, but in many cases, eliminating model poisoning attacks brought by fake servers is also an important objective. In this paper, a certificateless authentication-based trustworthy federated learning (CATFL) framework is proposed, which mutually authenticates the identity of clients and server. In CATFL, each client verifies the server's signature information before accepting the delivered global model to ensure that the global model is not delivered by false servers. On the contrary, the server also verifies the server's signature information before accepting the delivered model updates to ensure that they are submitted by authorized clients. Compared to PKI-based methods, the CATFL can avoid too high certificate management overheads. Meanwhile, the anonymity of clients shields data poisoning attacks, while real-name registration may suffer from user-specific privacy leakage risks. Therefore, a pseudonym generation strategy is also presented in CATFL to achieve a trade-off between identity traceability and user anonymity, which is essential to conditionally prevent from user-specific privacy leakage. Theoretical security analysis and evaluation results validate the superiority of CATFL., Accepted by WCNC workshop 2023

Since its first release in the late 1990s, Wi-Fi has been updated to keep up with evolving user needs. Recently, Wi-Fi and other radio access technologies have been pushed to their edge when serving Augmented Reality (AR) applications. AR applications require high throughput, low latency, and high reliability to ensure a high-quality user experience. The 802.11be amendment, which will be marketed as Wi-Fi 7, introduces several features that aim to enhance its capabilities to support challenging applications like AR. One of the main features introduced in this amendment is Multi-Link Operation (MLO) which allows nodes to transmit and receive over multiple links concurrently. When using MLO, traffic is distributed among links using an implementation-specific traffic-to-link allocation policy. This paper aims to evaluate the performance of MLO, using different policies, in serving AR applications compared to Single-Link (SL). Experimental simulations using an event-based Wi-Fi simulator have been conducted. Our results show the general superiority of MLO when serving AR applications. MLO achieves lower latency and serves a higher number of AR users compared to SL with the same frequency resources. In addition, increasing the number of links can improve the performance of MLO. Regarding traffic-to-link allocation policies, we found that policies can be more susceptible to channel blocking, resulting in possible performance degradation.

Wireless jamming attacks have plagued wireless communication systems and will continue to do so going forward with technological advances. These attacks fall under the category of Electronic Warfare (EW), a continuously growing area in both attack and defense of the electromagnetic spectrum, with one subcategory being electronic attacks. Jamming attacks fall under this specific subcategory of EW as they comprise adversarial signals that attempt to disrupt, deny, degrade, destroy, or deceive legitimate signals in the electromagnetic spectrum. While jamming is not going away, recent research advances have started to get the upper hand against these attacks by leveraging new methods and techniques, such as machine learning. However, testing such jamming solutions on a wide and realistic scale is a daunting task due to strict regulations on spectrum emissions. In this paper, we introduce eSWORD, the first large-scale framework that allows users to safely conduct real-time and controlled jamming experiments with hardware-in-the-loop. This is done by integrating eSWORD into the Colosseum wireless network emulator that enables large-scale experiments with up to 50 software-defined radio nodes. We compare the performance of eSWORD with that of real-world jamming systems by using an over-the-air wireless testbed (ensuring safe measures were taken when conducting experiments). Our experimental results demonstrate that eSWORD follows similar patterns in throughput, signal-to-noise ratio, and link status to real-world jamming experiments, testifying to the high accuracy of the emulated eSWORD setup., 6 pages, 7 figures, 1 table. IEEE Wireless Communications and Networking Conference (WCNC), Glasgow, Scotland, March 2023

Intelligent reflecting surfaces (IRSs) are being studied as possible low-cost energy-efficient alternatives to active relays, with the goal of solving the coverage issues of millimeter wave (mmWave) and terahertz (THz) network deployments. In the literature, these surfaces are often studied by idealizing their characteristics. Notably, it is often assumed that IRSs can tune with arbitrary frequency the phase-shifts induced by their elements, thanks to a wire-like control channel to the next generation node base (gNB). Instead, in this work we investigate an IRS-aided time division multiple access (TDMA) cellular network, where the reconfiguration of the IRS may entail an energy or communication cost, and we aim at limiting the number of reconfigurations over time. We develop a clustering-based heuristic scheduling, which optimizes the system sum-rate subject to a given number of reconfigurations within the TDMA frame. To such end, we first cluster user equipments (UEs) with a similar optimal IRS configuration. Then, we compute an overall IRS cluster configuration, which can be thus kept constant while scheduling the whole UEs cluster. Numerical results show that our approach is effective in supporting IRSs-aided systems with practical constraints, achieving up to 85% of the throughput obtained by an ideal deployment, while providing a 50% reduction in the number of IRS reconfigurations., Comment: 6 pages, 4 figures, submitted to WCNC 2023 Workshops

We propose a new algorithm for generating custom network traffic matrices which achieves 13x, 38x, and 70x faster generation times than prior work on networks with 64, 256, and 1024 nodes respectively., Accepted to OFC'23: Proceedings of the Optical Fiber Communications Conference and Exhibition

A machine learning approach for improving monitoring in passive optical networks with almost equidistant branches is proposed and experimentally validated. It achieves a high diagnostic accuracy of 98.7% and an event localization error of 0.5m, Optical Fiber Communication Conference (OFC) 2023

As a response to the global COVID-19 surge in 2020, many countries have implemented lockdown or stay-at-home policies. If, however, the contact persons of every infected patient could be identified, the number of virus transmissions could be reduced, while the more incisive measures could be softened. For this purpose, contact tracing using smartphones is being considered as a promising technique. Here, smartphones emit and scan for Bluetooth Low Energy (BLE) signals for detecting devices in range. When a device is detected, its distance is estimated by evaluating its received signal strength. The main insight that is exploited for distance estimation is that the attenuation of a signal increases with the distance along which it has traveled. However, besides distance, there are multiple additional factors that impact the attenuation and hence disturb distance estimation. Among them, frequency-selective hardware and signal propagation belong to the most significant ones. For example, a BLE device transmits beacons on three different frequencies (channels), while the transmit power and the receiver sensitivity depend on the frequency. As a result, the received signal strength varies for each channel, even when the distance remains constant. However, the information on which wireless channel a beacon has been received is not made available to a smartphone. Hence, this error cannot be compensated, e.g., by calibration. In this paper, we for the first time provide a solution to detect the wireless channel on which a packet has been received on a smartphone. We experimentally evaluate our proposed technique on multiple different smartphone models. Our results help to make contact tracing more robust by improving the accuracy of distance estimation.

Achieving cyber-physical control over a wireless channel requires satisfying both the timeliness of a single packet and preserving the latency reliability across several consecutive packets. To satisfy those requirements as an ubiquitous service requires big infrastructural developments, or flexible on-demand equipment such as UAVs. To avoid the upfront cost in terms of finance and energy, this paper analyzes the capability of UAV access points (UAVAPs) to satisfy the requirements for cyber-physical traffic. To investigate this, we perform a Gilbert-Eliott burst-error analysis that is analytically derived as a combination of two separate latency measurement campaigns and provide an upper-bound analysis of the UAVAP system. The analysis is centered around a UAVAP that uses its LTE connection to reach the backhaul, while providing service to ground nodes (GNs) with a Wi-Fi access point (AP). Thus, we combine both measurement campaigns to analyze the plausibility of the described setup in casual, crowded or mixed network settings., Comment: To be published in proceedings of VTC-fall 2022

Attack-resilience is essential to maintain continuous service availability in Internet of Vehicles (IoV) where critical tasks are carried out. In this paper, we address the problem of service outage due to attacks on the edge network and propose an attack-resilient mapping of vehicles to edge nodes that host different types of service instances considering resource efficiency and delay. The distribution of service requests (of an attack-affected edge node) to multiple attack-free edge nodes is performed with an optimal vehicle-to-edge (V2E) mapping. The optimal mapping aims to improve the user experience with minimal delay while considering fair usage of edge capacities and balanced load upon a failure over different edge nodes. The proposed mapping solution is used within a deep reinforcement learning (DRL) based framework to effectively deal with the dynamism in service requests and vehicle mobility. We demonstrate the effectiveness of the proposed mapping approach through extensive simulation results using real-world vehicle mobility datasets from three cities., Comment: 7 pages, 9 figures, 1 table, Accepted in IEEE CCNC 2023

Network slicing envisions the 5th generation (5G) mobile network resource allocation to be based on different requirements for different services, such as Ultra-Reliable Low Latency Communication (URLLC) and Enhanced Mobile Broadband (eMBB). Open Radio Access Network (O-RAN), proposes an open and disaggregated concept of RAN by modulizing the functionalities into independent components. Network slicing for O-RAN can significantly improve performance. Therefore, an advanced resource allocation solution for network slicing in O-RAN is proposed in this study by applying Reinforcement Learning (RL). This research demonstrates an RL compatible simplified edge network simulator with three components, user equipment(UE), Edge O-Cloud, and Regional O-Cloud. This simulator is later used to discover how to improve throughput for targeted network slice(s) by dynamically allocating unused bandwidth from other slices. Increasing the throughput for certain network slicing can also benefit the end users with a higher average data rate, peak rate, or shorter transmission time. The results show that the RL model can provide eMBB traffic with a high peak rate and shorter transmission time for URLLC compared to balanced and eMBB focus baselines., Comment: Accepted Paper for IEEE CCNC 2023

In this paper, reinforcement learning (RL) for network slicing is considered in next generation (NextG) radio access networks, where the base station (gNodeB) allocates resource blocks (RBs) to the requests of user equipments and aims to maximize the total reward of accepted requests over time. Based on adversarial machine learning, a novel over-the-air attack is introduced to manipulate the RL algorithm and disrupt NextG network slicing. The adversary observes the spectrum and builds its own RL based surrogate model that selects which RBs to jam subject to an energy budget with the objective of maximizing the number of failed requests due to jammed RBs. By jamming the RBs, the adversary reduces the RL algorithm's reward. As this reward is used as the input to update the RL algorithm, the performance does not recover even after the adversary stops jamming. This attack is evaluated in terms of both the recovery time and the (maximum and total) reward loss, and it is shown to be much more effective than benchmark (random and myopic) jamming attacks. Different reactive and proactive defense schemes such as suspending the RL algorithm's update once an attack is detected, introducing randomness to the decision process in RL to mislead the learning process of the adversary, or manipulating the feedback (NACK) mechanism such that the adversary may not obtain reliable information are introduced to show that it is viable to defend NextG network slicing against this attack, in terms of improving the RL algorithm's reward. U.S. Army Research Office [W911NF-17-C-0090]; Commonwealth Cyber Initiative, an investment in the advancement of cyber RD, innovation, and workforce development Published version This effort is supported in part by the U.S. Army Research Office under contract W911NF-17-C-0090. The content of the information does not necessarily reflect the position or the policy of the U.S. Government, and no official endorsement should be inferred. This effort is also supported in part by the Commonwealth Cyber Initiative, an investment in the advancement of cyber RD, innovation, and workforce development. For more information about CCI, visit www.cyberinitiative.org.

The traditional approach to distributed machine learning is to adapt learning algorithms to the network, e.g., reducing updates to curb overhead. Networks based on intelligent edge, instead, make it possible to follow the opposite approach, i.e., to define the logical network topology around the learning task to perform, so as to meet the desired learning performance. In this paper, we propose a system model that captures such aspects in the context of supervised machine learning, accounting for both learning nodes (that perform computations) and information nodes (that provide data). We then formulate the problem of selecting (i) which learning and information nodes should cooperate to complete the learning task, and (ii) the number of epochs to run, in order to minimize the learning cost while meeting the target prediction error and execution time. After proving important properties of the above problem, we devise an algorithm, named DoubleClimb, that can find a 1+1/|I| -competitive solution (with I being the set of information nodes), with cubic worst-case complexity. Our performance evaluation, leveraging a real-world network topology and considering both classification and regression tasks, also shows that DoubleClimb closely matches the optimum, outperforming state-of-the-art alternatives. This work was supported in part by the European Union (EU) Hexa-X Project under Grant 101015956 and in part by the National Priorities Research Program-Standard (NPRP-S) 13th Cycle Grant from the Qatar National Research Fund (a member of Qatar Foundation) under Grant NPRP13S-0205-200265.

Assisted driving for connected cars is one of the main applications that 5G-and-beyond networks shall support. In this work, we propose an assisted driving system leveraging the synergy between connected vehicles and the edge of the network infrastructure, in order to envision global traffic policies that can effectively drive local decisions. Local decisions concern individual vehicles, e.g., which vehicle should perform a lane-change manoeuvre and when; global decisions, instead, involve whole traffic flows. Such decisions are made at different time scales by different entities, which are integrated within an edge-based architecture and can share information. In particular, we leverage a queuing-based model and formulate an optimization problem to make global decisions on traffic flows. To cope with the problem complexity, we then develop an iterative, linear-time complexity algorithm called Bottleneck Hunting (BH). We show the performance of our solution using a realistic simulation framework, integrating a Python engine with ns-3 and SUMO, and considering two relevant services, namely, lane change assistance and navigation, in a real-world scenario. Results demonstrate that our solution leads to a reduction of the vehicles' travel times by 66 in the case of lane change assistance and by 20 for navigation, compared to traditional, local-coordination approaches., Comment: arXiv admin note: text overlap with arXiv:2008.09336

Deploying services efficiently while satisfying their quality requirements is a major challenge in network slicing. Effective solutions place instances of the services' virtual network functions (VNFs) at different locations of the cellular infrastructure and manage such instances by scaling them as needed. In this work, we address the above problem and the very relevant aspect of sub-slice reuse among different services. Further, unlike prior art, we account for the services' finite lifetime and time-varying traffic load. We identify two major sources of inefficiency in service management: (i) the overspending of computing resources due to traffic of multiple services with different latency requirements being processed by the same virtual machine (VM), and (ii) the poor packing of traffic processing requests in the same VM, leading to opening more VMs than necessary. To cope with the above issues, we devise an algorithm, called REShare, that can dynamically adapt to the system's operational conditions and find an optimal trade-off between the aforementioned opposite requirements. We prove that REShare has low algorithmic complexity and is asymptotic 2-competitive under a non-decreasing load. Numerical results, leveraging real-world scenarios, show that our solution outperforms alternatives, swiftly adapting to time-varying conditions and reducing service cost by over 25%.

Extreme edge computing (EEC) refers to the end-most part of edge computing wherein computational tasks and edge services are deployed only on extreme edge devices (EEDs). EEDs are consumer or user-owned devices that offer computational resources, which may consist of wearable devices, personal mobile devices, drones, etc. Such devices are opportunistically or naturally present within the proximity of other user devices. Hence, utilizing EEDs to deploy edge services or perform computational tasks fulfills the promise of edge computing of bringing the services and computation as close as possible to the end-users. However, the lack of knowledge and control over the EEDs computational resources raises a red flag, since executing the computational tasks successfully becomes doubtful. To this end, we aim to study the EEDs randomness from the computational perspective, and how reliable is an EED in terms of executing the tasks on time. Specifically, we provide a reliability model for the EEDs that takes into account the probabilistic nature of the availability of the EEDs' computational resources. Moreover, we study the reliability of executing different types of computational tasks in EEC systems that are distributed across the EEDs. Lastly, we carry out experimental results to analyze the EEDs and the EEC systems' reliability behavior in different scenarios. This work was made possible by NPRP grant # NPRP13S-0205-200265 from the Qatar National Research Fund (a member of Qatar Foundation). This work was also supported by a grant from the Natural Sciences and Engineering Research Council of Canada (NSERC) under grant number: [ALLRP 549919-20].

Distributed deep learning (DDL) training systems are designed for cloud and data-center environments that assumes homogeneous compute resources, high network bandwidth, sufficient memory and storage, as well as independent and identically distributed (IID) data across all nodes. However, these assumptions don't necessarily apply on the edge, especially when training neural networks on streaming data in an online manner. Computing on the edge suffers from both systems and statistical heterogeneity. Systems heterogeneity is attributed to differences in compute resources and bandwidth specific to each device, while statistical heterogeneity comes from unbalanced and skewed data on the edge. Different streaming-rates among devices can be another source of heterogeneity when dealing with streaming data. If the streaming rate is lower than training batch-size, device needs to wait until enough samples have streamed in before performing a single iteration of stochastic gradient descent (SGD). Thus, low-volume streams act like stragglers slowing down devices with high-volume streams in synchronous training. On the other hand, data can accumulate quickly in the buffer if the streaming rate is too high and the devices can't train at line-rate. In this paper, we introduce ScaDLES to efficiently train on streaming data at the edge in an online fashion, while also addressing the challenges of limited bandwidth and training with non-IID data. We empirically show that ScaDLES converges up to 3.29 times faster compared to conventional distributed SGD.

Detailed understanding of multi-modal mobility patterns within urban areas is crucial for public infrastructure planning, transportation management, and designing public transport (PT) services centred on users' needs. Yet, even with the rise of ubiquitous computing, sensing urban mobility patterns in a timely fashion remains a challenge. Traditional data sources fail to fully capture door-to-door trajectories and rely on a set of models and assumptions to fill their gaps. This study focuses on a new type of data source that is collected through the mobile ticketing app of HSL, the local PT operator of the Helsinki capital region. HSL's dataset called TravelSense, records anonymized travelers' movements within the Helsinki region by means of Bluetooth beacons, mobile phone GPS, and phone OS activity detection. In this study, TravelSense dataset is processed and analyzed to reveal spatio-temporal mobility patterns as part of investigating its potentials in mobility sensing efforts. The representativeness of the dataset is validated with two external data sources - mobile phone trip data (for demand patterns) and travel survey data (for modal share). Finally, practical perspectives that this dataset can yield are presented through a preliminary analysis of PT transfers in multimodal trips within the study area.

In the recent years, scientific workflows gained more and more popularity. In scientific workflows, tasks are typically treated as black boxes. Dealing with their complex interrelations to identify optimization potentials and bottlenecks is therefore inherently hard. The progress of a scientific workflow depends on several factors, including the available input data, the available computational power, and the I/O and network bandwidth. Here, we tackle the problem of predicting the workflow progress with very low overhead. To this end, we look at suitable formalizations for the key parameters and their interactions which are sufficiently flexible to describe the input data consumption, the computational effort and the output production of the workflow's tasks. At the same time they allow for computationally simple and fast performance predictions, including a bottleneck analysis over the workflow runtime. A piecewise-defined bottleneck function is derived from the discrete intersections of the task models' limiting functions. This allows to estimate potential performance gains from overcoming the bottlenecks and can be used as a basis for optimized resource allocation and workflow execution.

In sliced networks, the shared tenancy of slices requires adaptive admission control of data flows, based on measurements of network resources. In this paper, we investigate the design of measurement-based admission control schemes, deciding whether a new data flow can be admitted and in this case, on which slice. The objective is to devise a joint measurement and decision strategy that returns a correct decision (e.g., the least loaded slice) with a certain level of confidence while minimizing the measurement cost (the number of measurements made before committing to the decision). We study the design of such strategies for several natural admission criteria specifying what a correct decision is. For each of these criteria, using tools from best arm identification in bandits, we first derive an explicit information-theoretical lower bound on the cost of any algorithm returning the correct decision with fixed confidence. We then devise a joint measurement and decision strategy achieving this theoretical limit. We compare empirically the measurement costs of these strategies, and compare them both to the lower bounds as well as a naive measurement scheme. We find that our algorithm significantly outperforms the naive scheme (by a factor $2-8$).

Precise indoor positioning systems (IPSs) are key to perform a set of tasks more efficiently during aircraft production, operation and maintenance. For instance, IPSs can overcome the tedious task of configuring (wireless) sensor nodes in an aircraft cabin. Although various solutions based on technologies of established consumer goods, e.g., Bluetooth or WiFi, have been proposed and tested, the published accuracy results fail to make these technologies relevant for practical use cases. This stems from the challenging environments for positioning, especially in aircraft cabins, which is mainly due to the geometries, many obstacles, and highly reflective materials. To address these issues, we propose to evaluate in this work an Ultra-Wideband (UWB)-based IPS via a measurement campaign performed in a real aircraft cabin. We first illustrate the difficulties that an IPS faces in an aircraft cabin, by studying the signal propagation effects which were measured. We then investigate the ranging and localization accuracies of our IPS. Finally, we also introduce various methods based on machine learning (ML) for correcting the ranging measurements and demonstrate that we are able to localize a node with respect to an aircraft seat with a measured likelihood of 97%.

With the advent of new IEEE 802.11ax (WiFi 6) devices, enabling security is a priority. Since previous versions were found to have security vulnerabilities, to fix the most common security flaws, the WiFi Protected Access 3 (WPA3) got introduced. Although WPA3 is an improvement over its predecessor in terms of security, recently it was found that WPA3 has a few security vulnerabilities as well. In this paper, we have mentioned the previously known vulnerabilities in WPA3 and WPA2. In addition to that, we have created our own dataset based on WPA3 attacks (Section III). We have proposed a two-stage solution for the detection of an intrusion in the network. The two-stage approach will help ease computational processing burden of an AP and WLAN Controller. First, AP will perform a lightweight simple operation for some duration (say 500ms) at certain time interval. Upon discovering any abnormality in the flow of traffic an ML-based solution at the controller will detect the type of attack. Our approach is to utilize resources on AP as well as the back-end controller with certain level of optimization. We have achieved over 99% accuracy in attack detection using an ML-based solution. We have also publicly provided our code and dataset for the open-source research community, so that it can contribute for future research work.

With the development of industrialization, air pollution is also steadily on the rise since both industrial and daily activities generate a massive amount of air pollution. Since decreasing air pollution is critical for citizens' health and well-being, air pollution monitoring is becoming an essential topic. Industrial Internet of Things (IIoT) research focuses on this crucial area. Several attempts already exist for air pollution monitoring. However, none of them are improving the performance of IoT data collection at the desired level. Inspired by the genuine Yet Another Next Generation (YANG) data model, we propose a YAng-based DAta model (YA-DA) to improve the performance of IIoT data collection. Moreover, by taking advantage of digital twin (DT) technology, we propose a DT-enabled fine-grained IIoT air quality monitoring system using YA-DA. As a result, DT synchronization becomes fine-grained. In turn, we improve the performance of IIoT data collection resulting in lower round-trip time (RTT), higher DT synchronization, and lower DT latency., This paper has been accepted at the 4th Workshop on Future of Wireless Access and Sensing for Industrial IoT (FUTUREIIOT) in IEEE Global Communications Conference (IEEE GLOBECOM) 2022

A novel cross-domain attentional multi-task architecture - xDom - for robust real-world wireless radio frequency (RF) fingerprinting is presented in this work. To the best of our knowledge, this is the first time such comprehensive attention mechanism is applied to solve RF fingerprinting problem. In this paper, we resort to real-world IoT WiFi and Bluetooth (BT) emissions (instead of synthetic waveform generation) in a rich multipath and unavoidable interference environment in an indoor experimental testbed. We show the impact of the time-frame of capture by including waveforms collected over a span of months and demonstrate the same time-frame and multiple time-frame fingerprinting evaluations. The effectiveness of resorting to a multi-task architecture is also experimentally proven by conducting single-task and multi-task model analyses. Finally, we demonstrate the significant gain in performance achieved with the proposed xDom architecture by benchmarking against a well-known state-of-the-art model for fingerprinting. Specifically, we report performance improvements by up to 59.3% and 4.91x under single-task WiFi and BT fingerprinting respectively, and up to 50.5% increase in fingerprinting accuracy under the multi-task setting., Accepted to IEEE GLOBECOM 2022

Named Data Networking (NDN) offers promising advantages in deploying next-generation service applications over distributed computing networks. We consider the problem of dynamic orchestration over a NDN-based computing network, in which nodes can be equipped with communication, computation, and data producing resources. Given a set of services with function-chaining structures, we address the design of distributed online algorithm that controls each node to make adaptive decisions on flowing service requests, committing function implementations, and/or producing data. We design a Service Discovery Assisted Dynamic Orchestration (SDADO) algorithm that reduces the end-to-end (E2E) delay of delivering the services, while providing optimal throughput performance. The proposed algorithm hybrids queuing-based flexibility and topology-based discipline, where the topological information is not pre-available but obtained through our proposed service discovery mechanism. We provide throughput-optimality analysis for SDADO, and then provide numerical results that confirm our analysis and demonstrates reduced round-trip E2E delay.

This paper investigates the problem of minimizing the age-of-information (AoI) and transmit power consumption in a vehicular network, where a roadside unit (RSU) provides timely updates about a set of physical processes to vehicles. Each vehicle is interested in maintaining the freshness of its information status about one or more physical processes. A framework is proposed to optimize the decisions to unicast, multicast, broadcast, or not transmit updates to vehicles as well as power allocations to minimize the AoI and the RSU's power consumption over a time horizon. The formulated problem is a mixed-integer nonlinear programming problem (MINLP), thus a global optimal solution is difficult to achieve. In this context, we first develop an ant colony optimization (ACO) solution which provides near-optimal performance and thus serves as an efficient benchmark. Then, for real-time implementation, we develop a deep reinforcement learning (DRL) framework that captures the vehicles' demands and channel conditions in the state space and assigns processes to vehicles through dynamic unicast-multicast scheduling actions. Complexity analysis of the proposed algorithms is presented. Simulation results depict interesting trade-offs between AoI and power consumption as a function of the network parameters., Comment: Accepted in IEEE Globecom Workshop (6GComm), 2022

Cellular networks (LTE, 5G, and beyond) are dramatically growing with high demand from consumers and more promising than the other wireless networks with advanced telecommunication technologies. The main goal of these networks is to connect billions of devices, systems, and users with high-speed data transmission, high cell capacity, and low latency, as well as to support a wide range of new applications, such as virtual reality, metaverse, telehealth, online education, autonomous and flying vehicles, advanced manufacturing, and many more. To achieve these goals, spectrum sensing has been paid more attention, along with new approaches using artificial intelligence (AI) methods for spectrum management in cellular networks. This paper provides a vulnerability analysis of spectrum sensing approaches using AI-based semantic segmentation models for identifying cellular network signals under adversarial attacks with and without defensive distillation methods. The results showed that mitigation methods can significantly reduce the vulnerabilities of AI-based spectrum sensing models against adversarial attacks., Comment: IEEE GLOBECOM 2022 Publication

Future smart factories are expected to deploy an emerging dynamic Virtual Reality (VR) applications with high bandwidth wireless connections in the THz communication bands, where a factory worker can follow activities through 360{\deg}video streams with high quality resolution. THz communications, while promising as a high bandwidth wireless communication technology, are however known for low fault tolerance, and are sensible to external factors. Since THz channel states are in general hard to estimate, what is needed is a system that can adaptively react to transceiver configurations in terms of coding and modulation. To this end, we propose an adaptive control plane that can help us configure the THz communication system. The control plane implements a workflow algorithm designed to adaptively choose between various coding and modulation schemes depending on THz channel states. The results show that an adaptive control plane can improve throughput and signal resolution quality, with theoretically zeroed bit error probability and a maximum achievable throughput in the scenarios analayzed., Comment: This paper is uploaded here for research community, thus it is for non-commercial purposes

IoT device identification plays an important role in monitoring and improving the performance and security of IoT devices. Compared to traditional non-IoT devices, IoT devices provide us with both unique challenges and opportunities in detecting the types of IoT devices. Based on critical insights obtained in our previous work on understanding the network traffic characteristics of IoT devices, in this paper we develop an effective machine-learning based IoT device identification scheme, named iotID. In developing iotID, we extract 70 features of TCP flows from three complementary aspects: remote network servers and port numbers, packet-level traffic characteristics such as packet inter-arrival times, and flow-level traffic characteristics such as flow duration. Different from existing work, we take into account the imbalance nature of network traffic generated by various devices in both the learning and evaluation phases of iotID. Our performance studies based on network traffic collected on a typical smart home environment consisting of both IoT and non-IoT devices show that iotID can achieve a balanced accuracy score of above 99%.

Multipartite entanglement plays a crucial role for the design of the Quantum Internet, due to its potentiality of significantly increasing the network performance. In this paper, we design an entanglement access control protocol for multipartite state, which exhibits several attractive features. Specifically, the designed protocol is able to jointly extract in a distributed way an EPR pair from the original multipartite entangled state shared by the set of network nodes, and to univocally determines the identities of the transmitter node and the receiver node in charge of using the extracted EPR pair. Furthermore, the protocol avoids to delegate the signaling arising with entanglement access control to the classical network, with the exception of the unavoidable classical communications needed for EPR extraction and qubit teleportation. Finally, the protocol supports the anonymity of the entanglement accessing nodes.

Next-generation distributed computing networks (e.g., edge and fog computing) enable the efficient delivery of delay-sensitive, compute-intensive applications by facilitating access to computation resources in close proximity to end users. Many of these applications (e.g., augmented/virtual reality) are also data-intensive: in addition to user-specific (live) data streams, they require access to (static) digital objects (e.g., image database) to complete the required processing tasks. When required objects are not available at the servers hosting the associated service functions, they must be fetched from other edge locations, incurring additional communication cost and latency. In such settings, overall service delivery performance shall benefit from jointly optimized decisions around (i) routing paths and processing locations for live data streams, together with (ii) cache selection and distribution paths for associated digital objects. In this paper, we address the problem of dynamic control of data-intensive services over edge cloud networks. We characterize the network stability region and design the first throughput-optimal control policy that coordinates processing and routing decisions for both live and static data-streams. Numerical results demonstrate the superior performance (e.g., throughput, delay, and resource consumption) obtained via the novel multi-pipeline flow control mechanism of the proposed policy, compared with state-of-the-art algorithms that lack integrated stream processing and data distribution control., Comment: arXiv admin note: substantial text overlap with arXiv:2205.01944

The capacity sharing problem in Radio Access Network (RAN) slicing deals with the distribution of the capacity available in each RAN node among various RAN slices to satisfy their traffic demands and efficiently use the radio resources. While several capacity sharing algorithmic solutions have been proposed in the literature, their practical implementation still remains as a gap. In this paper, the implementation of a Reinforcement Learning-based capacity sharing algorithm over the O-RAN architecture is discussed, providing insights into the operation of the involved interfaces and the containerization of the solution. Moreover, the description of the testbed implemented to validate the solution is included and some performance and validation results are presented., Submitted to IEEE GLOBECOM 2022 workshop on NextGenRAN

Modern vehicles, including autonomous vehicles and connected vehicles, have adopted an increasing variety of functionalities through connections and communications with other vehicles, smart devices, and infrastructures. However, the growing connectivity of the Internet of Vehicles (IoV) also increases the vulnerabilities to network attacks. To protect IoV systems against cyber threats, Intrusion Detection Systems (IDSs) that can identify malicious cyber-attacks have been developed using Machine Learning (ML) approaches. To accurately detect various types of attacks in IoV networks, we propose a novel ensemble IDS framework named Leader Class and Confidence Decision Ensemble (LCCDE). It is constructed by determining the best-performing ML model among three advanced ML algorithms (XGBoost, LightGBM, and CatBoost) for every class or type of attack. The class leader models with their prediction confidence values are then utilized to make accurate decisions regarding the detection of various types of cyber-attacks. Experiments on two public IoV security datasets (Car-Hacking and CICIDS2017 datasets) demonstrate the effectiveness of the proposed LCCDE for intrusion detection on both intra-vehicle and external networks., Comment: Accepted and to appear in IEEE GlobeCom 2022; Code is available at Github link: https://github.com/Western-OC2-Lab/Intrusion-Detection-System-Using-Machine-Learning

Data-driven approaches and paradigms have become promising solutions to efficient network performances through optimization. These approaches focus on state-of-the-art machine learning techniques that can address the needs of 5G networks and the networks of tomorrow, such as proactive load balancing. In contrast to model-based approaches, data-driven approaches do not need accurate models to tackle the target problem, and their associated architectures provide a flexibility of available system parameters that improve the feasibility of learning-based algorithms in mobile wireless networks. The work presented in this paper focuses on demonstrating a working system prototype of the 5G Core (5GC) network and the Network Data Analytics Function (NWDAF) used to bring the benefits of data-driven techniques to fruition. Analyses of the network-generated data explore core intra-network interactions through unsupervised learning, clustering, and evaluate these results as insights for future opportunities and works., Accepted in IEEE GlobeCom 2022

5G New Radio proposes the usage of frequencies above 10 GHz to speed up LTE's existent maximum data rates. However, the effective size of 5G antennas and consequently its repercussions in the signal degradation in urban scenarios makes it a challenge to maintain stable coverage and connectivity. In order to obtain the best from both technologies, recent dual connectivity solutions have proved their capabilities to improve performance when compared with coexistent standalone 5G and 4G technologies. Reinforcement learning (RL) has shown its huge potential in wireless scenarios where parameter learning is required given the dynamic nature of such context. In this paper, we propose two reinforcement learning algorithms: a single agent RL algorithm named Clipped Double Q-Learning (CDQL) and a hierarchical Deep Q-Learning (HiDQL) to improve Multiple Radio Access Technology (multi-RAT) dual-connectivity handover. We compare our proposal with two baselines: a fixed parameter and a dynamic parameter solution. Simulation results reveal significant improvements in terms of latency with a gain of 47.6% and 26.1% for Digital-Analog beamforming (BF), 17.1% and 21.6% for Hybrid-Analog BF, and 24.7% and 39% for Analog-Analog BF when comparing the RL-schemes HiDQL and CDQL with the with the existent solutions, HiDQL presented a slower convergence time, however obtained a more optimal solution than CDQL. Additionally, we foresee the advantages of utilizing context-information as geo-location of the UEs to reduce the beam exploration sector, and thus improving further multi-RAT handover latency results., 5 Figures, 4 tables, 2 algorithms. Accepted in Globecom'22

5G and 6G wireless communications allow for novel and disruptive applications. While 5G was strongly focused on improvements on QoS and QoS guarantees that are necessary for industrial deployments, 6G will have a disruptive impact on possible use cases. Here, nearly each use case requires time synchronization of the involved systems. While PTP in its variations, e.g. IEEE 1588 v2.1 or IEEE 802.1AS, has established as standard for wireline systems, time synchronization of wireless or hybrid systems is still subject to research. Thus, the so-called RBIS protocol, which was originally developed and investigated for Wi-Fi, is mapped to 5G. This is possible, because both systems are infrastructure based and a suitable broadcast that fits to the requirements of RBIS protocol can be found in the control layer of 5G NR. Even if the 1 microsecond requirement that is required by some applications is not yet cracked, the accuracy of 1.3 microseconds and precision of

Scheduling updates from remote sensors is a key task for the internet of things (IoT). In this context, the mathematical concept of age of information is often used to capture the freshness of received data. This is, in turn, relevant to optimize the frequency of the exchanges, especially for resource constrained (e.g., energy-limited) sensors. Most investigations on the subject assume that the transmitter can leverage knowledge of the age of information at the receiver side to decide when to send data, even when the communication channel is unreliable. In reality, tracking the outcome of the updates would require additional consumption of resources to acquire a feedback. We investigate the optimal schedule of updates over a finite time horizon for a resource-constrained sensor that is allowed to perform a limited number of updates, as typical of IoT devices. We discuss the role of the feedback from the receiver, and whether it is convenient to ask for it whenever this causes additional energy consumption and consequently allows the transmission of a lower number of updates. We analytically identify regions for the feedback cost and the reliability of the channel where making use of feedback may or may not be beneficial.

Machine learning (ML) applications continue to revolutionize many domains. In recent years, there has been considerable research interest in building novel ML applications for a variety of Internet of Things (IoT) domains, such as precision agriculture, smart cities, and smart manufacturing. IoT domains are characterized by continuous streams of data originating from diverse, geographically distributed sensors, and they often require a real-time or semi-real-time response. IoT characteristics pose several fundamental challenges to designing and implementing effective ML applications. Sensor/network failures that result in data stream interruptions is one such challenge. Unfortunately, the performance of many ML applications quickly degrades when faced with data incompleteness. Current techniques to handle data incompleteness are based upon data imputation ( i.e., they try to fill-in missing data). Unfortunately, these techniques may fail, especially when multiple sensors' data streams become concurrently unavailable (due to simultaneous sensor failures). With the aim of building robust IoT-coupled ML applications, this paper proposes SECOE, a unique, proactive approach for alleviating potentially simultaneous sensor failures. The fundamental idea behind SECOE is to create a carefully chosen ensemble of ML models in which each model is trained assuming a set of failed sensors (i.e., the training set omits corresponding values). SECOE includes a novel technique to minimize the number of models in the ensemble by harnessing the correlations among sensors. We demonstrate the efficacy of the SECOE approach through a series of experiments involving three distinct datasets. The experimental findings reveal that SECOE effectively preserves prediction accuracy in the presence of sensor failures., Comment: 8 pages, 10 figures, Accepted as a conference paper at IEEE International Conference on Machine Learning and Applications (ICMLA 2022)

Federated Learning is a modern decentralized machine learning technique where user equipments perform machine learning tasks locally and then upload the model parameters to a central server. In this paper, we consider a 3-layer hierarchical federated learning system which involves model parameter exchanges between the cloud and edge servers, and the edge servers and user equipment. In a hierarchical federated learning model, delay in communication and computation of model parameters has a great impact on achieving a predefined global model accuracy. Therefore, we formulate a joint learning and communication optimization problem to minimize total model parameter communication and computation delay, by optimizing local iteration counts and edge iteration counts. To solve the problem, an iterative algorithm is proposed. After that, a time-minimized UE-to-edge association algorithm is presented where the maximum latency of the system is reduced. Simulation results show that the global model converges faster under optimal edge server and local iteration counts. The hierarchical federated learning latency is minimized with the proposed UE-to-edge association strategy., Comment: This paper appears in the Proceedings of 2022 ACM/IEEE Symposium on Edge Computing (SEC). Please feel free to contact us for questions or remarks

Several Machine Learning (ML) methodologies have been proposed to improve security in Internet Of Things (IoT) networks and reduce the damage caused by the action of malicious agents. However, detecting and classifying attacks with high accuracy and precision is still a major challenge. This paper proposes an online attack detection and network traffic classification system, which combines stream Machine Learning, Deep Learning, and Ensemble Learning technique. Using multiple stages of data analysis, the system can detect the presence of malicious traffic flows and classify them according to the type of attack they represent. Furthermore, we show how to implement this system both in an IoT network and from an ML point of view. The system was evaluated in three IoT network security datasets, in which it obtained accuracy and precision above 90% with a reduced false alarm rate.

Recently advanced low-Earth-orbit (LEO) satellite networks represented by large constellations and advanced pay-loads provide great promises for enabling high-quality Internet connectivity to any place on Earth. However, the traditional access-based approach to satellite operations cannot meet the pressing requirements of real-time, reliable, and resilient operations for LEO satellites. A new scheme is proposed based on multi-layer satellite networking considering the advanced Ka-band and optical communications payloads on a satellite platform. The proposed scheme can enable efficient and resilient message transmissions for critical telecommand and telemetry missions through different layers of satellite networks, which consist of LEO, medium-Earth-orbit (MEO), and geostationary (GEO) satellites. The proposed scheme is evaluated in a 24-hr satellite mission and shows superior performance improvements compared to the traditional operations approach., 2022 IEEE Latin-American Conference on Communications (LATINCOM), November 30 - December 2, 2022, Rio de Janeiro, Brazil

Edge inference has become more widespread, as its diverse applications range from retail to wearable technology. Clusters of networked resource-constrained edge devices are becoming common, yet no system exists to split a DNN across these clusters while maximizing the inference throughput of the system. We present an algorithm which partitions DNNs and distributes them across a set of edge devices with the goal of minimizing the bottleneck latency and therefore maximizing inference throughput. The system scales well to systems of different node memory capacities and numbers of nodes. We find that we can reduce the bottleneck latency by 10x over a random algorithm and 35% over a greedy joint partitioning-placement algorithm. Furthermore we find empirically that for the set of representative models we tested, the algorithm produces results within 9.2% of the optimal bottleneck latency., Accepted to the International Telecommunication Networks and Applications Conference 2022 (ITNAC 2022)

Instantaneous measurements of the electromagnetic field (EMF) strength do not reflect the maximum exposure levels possible in a given location. An extrapolation factor needs to be applied to the measurements before comparing them against the local exposure guidelines or recommendations for compliance evaluation. For the fifth generation (5G) networks, a standardized approach for extrapolating EMF values is yet to be defined. This work provides an overview of the state-of-the-art research that focuses on estimating the maximum EMF exposure caused by radiation from 5G base stations. It also considers current efforts by national and international organizations to establish standardized methods for extrapolating the EMF measurements which is necessary in investigating conformance with the EMF guidelines and regulations., This is a preprint version, the full paper has been accepted by the IEEE Conference on Standards for Communications and Networking (CSCN), Thessaloniki, Greece. November 2022

Coexistence of 3GPP access networks, namely 4G and 5G, and non-3GPP access networks, namely Wi-Fi, has enabled data offloading from one access network to another to reduce burden on the congested network. Within the evolution of 5G system, the coexistence has been evolved to a multi-access framework where simultaneous transmission on both 3GPP and non-3GPP access networks has been enabled. This framework is named as access traffic steering, splitting and switching (ATSSS) in 3GPP and is considered as one of the key enablers to provide stringent requirements on data rate and service continuity. In this paper, we introduce an enhanced ATSSS (eAT3S) algorithm where not only instantaneous link performance measurements but also network operator preferences are taken into account to optimize the overall network performance. As part of considered non-3GPP wireless access technologies (WATs), light fidelity (LiFi) access networks are also considered alongside with Wi-Fi networks., Comment: Accepted for publication at IEEE Conference on Standards for Communications and Networking (CSCN) 2022. 6 pages, 5 figures

Service discovery is a crucial component in today's massively distributed applications. In this paper, we propose NDNSD -- a fully distributed and general-purpose service discovery protocol for Named Data Networking (NDN). By leveraging NDN's data synchronization capability, NDNSD offers a high-level API for service publishing and discovery. We present NDNSD's main design features including hierarchical naming, service information specification, and service accessibility. %and illustrate the design with a use case. We also implemented two other discovery schemes, one reactive and one proactive, and compared them with NDNSD. Our evaluation shows that NDNSD achieves (a) lower latency, lower overhead, and same reliability compared to the reactive scheme, and (b) comparable latency, lower overhead at larger scale, and higher reliability compared to the proactive scheme., Comment: MILCOM-2022