An Advanced Home ElderCare Service

With the increase of welfare cost all over the developed world, there is a need to resort to new technologies that could help reduce this enormous cost and provide some quality eldercare services. This paper presents a middleware-level solution that integrates monitoring and emergency detection solutions with networking solutions. The proposed system enables efficient integration between a variety of sensors and actuators deployed at home for emergency detection and provides a framework for creating and managing rescue teams willing to assist elders in case of emergency situations. A prototype of the proposed system was designed and implemented. Results were obtained from both computer simulations and a real-network testbed. These results show that the proposed system can help overcome some of the current problems and help reduce the enormous cost of eldercare service

Recent trends in IP/NGEO satellite communication systems: transport, routing, and mobility management concerns

科研費報告書収録論文(課題番号:17500030/研究代表者:加藤寧/インターネットと高親和性を有する次世代低軌道衛星ネットワークに関する基盤研究

Cost-Efficient Data Backup for Data Center Networks against {\epsilon}-Time Early Warning Disaster

Data backup in data center networks (DCNs) is critical to minimize the data loss under disaster. This paper considers the cost-efficient data backup for DCNs against a disaster with $\varepsilon$ early warning time. Given geo-distributed DCNs and such a $\varepsilon$-time early warning disaster, we investigate the issue of how to back up the data in DCN nodes under risk to other safe DCN nodes within the $\varepsilon$ early warning time constraint, which is significant because it is an emergency data protection scheme against a predictable disaster and also help DCN operators to build a complete backup scheme, i.e., regular backup and emergency backup. Specifically, an Integer Linear Program (ILP)-based theoretical framework is proposed to identify the optimal selections of backup DCN nodes and data transmission paths, such that the overall data backup cost is minimized. Extensive numerical results are also provided to illustrate the proposed framework for DCN data backup

Optimization of Flow Allocation in Asynchronous Deterministic 5G Transport Networks by Leveraging Data Analytics

This research work was supported in part by the Euro- pean Union’s Horizon 2020 Research and Innovation Program under the “Cloud for Holography and Augmented Reality (CHARITY)” Project under Agreement 101016509, and 5G- CLARITY Project under Agreement 871428. It is also partially supported by the Spanish national research project TRUE5G: PID2019-108713RB-C53.Time-Sensitive Networking (TSN) and Deterministic Networking (DetNet) technologies are increasingly recognized as key levers of the future 5G transport networks (TNs) due to their capabilities for providing deterministic Quality-of-Service and enabling the coexistence of critical and best-effort services. Addi- tionally, they rely on programmable and cost-effective Ethernet- based forwarding planes. This article addresses the flow alloca- tion problem in 5G backhaul networks realized as asynchronous TSN networks, whose building block is the Asynchronous Traffic Shaper. We propose an offline solution, dubbed “Next Generation Transport Network Optimizer” (NEPTUNO), that combines ex- act optimization methods and heuristic techniques and leverages data analytics to solve the flow allocation problem. NEPTUNO aims to maximize the flow acceptance ratio while guaranteeing the deterministic Quality-of-Service requirements of the critical flows. We carried out a performance evaluation of NEPTUNO regarding the degree of optimality, execution time, and flow rejection ratio. Furthermore, we compare NEPTUNO with a novel online baseline solution for two different optimization goals. Online methods compute the flow’s allocation configuration right after the flow arrives at the network, whereas offline solutions like NEPTUNO compute a long-term configuration allocation for the whole network. Our results highlight the potential of data analytics for the self-optimization of the future 5G TNs.Union’s Horizon 2020, 1010165095G-CLARITY 871428TRUE5G: PID2019-108713RB-C53

Deep Reinforcement Learning based Collision Avoidance in UAV Environment

Unmanned Aerial Vehicles (UAVs) have recently attracted both academia and industry representatives due to their utilization in tremendous emerging applications. Most UAV applications adopt Visual Line of Sight (VLOS) due to ongoing regulations. There is a consensus between industry for extending UAVs’ commercial operations to cover the urban and populated area controlled airspace Beyond VLOS (BVLOS). There is ongoing regulation for enabling BVLOS UAV management. Regrettably, this comes with unavoidable challenges related to UAVs’ autonomy for detecting and avoiding static and mobile objects. An intelligent component should either be deployed onboard the UAV or at a Multi-Access Edge Computing (MEC) that can read the gathered data from different UAV’s sensors, process them, and then make the right decision to detect and avoid the physical collision. The sensing data should be collected using various sensors but not limited to Lidar, depth camera, video, or ultrasonic. This paper proposes probabilistic and Deep Reinforcement Learning (DRL)-based algorithms for avoiding collisions while saving energy consumption. The proposed algorithms can be either run on top of the UAV or at the MEC according to the UAV capacity and the task overhead. We have designed and developed our algorithms to work for any environment without a need for any prior knowledge. The proposed solutions have been evaluated in a harsh environment that consists of many UAVs moving randomly in a small area without any correlation. The obtained results demonstrated the efficiency of these solutions for avoiding the collision while saving energy consumption in familiar and unfamiliar environments.This work has been partially funded by the Spanish national project TRUE-5G (PID2019-108713RB-C53)

Cooperative Jamming and Relay Selection for Covert Communications

This paper investigates the covert communications via cooperative jamming and relay selection in a wireless relay system, where a source intends to transmit a message to its destination with the help of a selected relay, and a warden attempts to detect the existence of wireless transmissions from both the source and relay, while friendly jammers send jamming signals to prevent warden from detecting the transmission process. To this end, we first propose two relay selection schemes, namely random relay selection (RRS) and max-min relay selection (MMRS), as well as their corresponding cooperative jamming (CJ) schemes for ensuring covertness in the system. We then provide theoretical modeling for the covert rate performance under each relay selection scheme and its CJ scheme and further explore the optimal transmit power controls of both the source and relay for covert rate maximization. Finally, extensive simulation/numerical results are presented to validate our theoretical models and also to illustrate the covert rate performance of the relay system under cooperative jamming and relay selection

Explicit Load Balancing Technique for NGEO Satellite IP Networks With On-Board Processing Capabilities

科研費報告書収録論文(課題番号:17500030/研究代表者:加藤寧/インターネットと高親和性を有する次世代低軌道衛星ネットワークに関する基盤研究

One-step approach for two-tiered constrained relay node placement in wireless sensor networks

© 2012 IEEE. We consider in this letter the problem of constrained relay node (RN) placement where sensor nodes must be connected to base stations by using a minimum number of RNs. The latter can only be deployed at a set of predefined locations, and the two-Tiered topology is considered where only RNs are responsible for traffic forwarding. We propose a one-step constrained RN placement (OSRP) algorithm which yields a network tree. The performance of OSRP in terms of the number of added RNs is investigated in a simulation study by varying the network density, the number of sensor nodes, and the number of candidate RN positions. The results show that OSRP outperforms the only algorithm in the literature for two-Tiered constrained RNs placement

Moving Target Defense based Secured Network Slicing System in the O-RAN Architecture

The open radio access network (O-RAN) architecture's native virtualization and embedded intelligence facilitate RAN slicing and enable comprehensive end-to-end services in post-5G networks. However, any vulnerabilities could harm security. Therefore, artificial intelligence (AI) and machine learning (ML) security threats can even threaten O-RAN benefits. This paper proposes a novel approach to estimating the optimal number of predefined VNFs for each slice while addressing secure AI/ML methods for dynamic service admission control and power minimization in the O-RAN architecture. We solve this problem on two-time scales using mathematical methods for determining the predefined number of VNFs on a large time scale and the proximal policy optimization (PPO), a Deep Reinforcement Learning algorithm, for solving dynamic service admission control and power minimization for different slices on a small-time scale. To secure the ML system for O-RAN, we implement a moving target defense (MTD) strategy to prevent poisoning attacks by adding uncertainty to the system. Our experimental results show that the proposed PPO-based service admission control approach achieves an admission rate above 80\% and that the MTD strategy effectively strengthens the robustness of the PPO method against adversarial attacks.Comment: 6 page