Empirical Performance and Energy Consumption Evaluation of Container Solutions on Resource Constrained IoT Gateways.

Containers virtually package a piece of software and share the host Operating System (OS) upon deployment. This makes them notably light weight and suitable for dynamic service deployment at the network edge and Internet of Things (IoT) devices for reduced latency and energy consumption. Data collection, computation, and now intelligence is included in variety of IoT devices which have very tight latency and energy consumption conditions. Recent studies satisfy latency condition through containerized services deployment on IoT devices and gateways. They fail to account for the limited energy and computing resources of these devices which limit the scalability and concurrent services deployment. This paper aims to establish guidelines and identify critical factors for containerized services deployment on resource constrained IoT devices. For this purpose, two container orchestration tools (i.e., Docker Swarm and Kubernetes) are tested and compared on a baseline IoT gateways testbed. Experiments use Deep Learning driven data analytics and Intrusion Detection System services, and evaluate the time it takes to prepare and deploy a container (creation time), Central Processing Unit (CPU) utilization for concurrent containers deployment, memory usage under different traffic loads, and energy consumption. The results indicate that container creation time and memory usage are decisive factors for containerized micro service architecture.

Channel and Timeslot Co-Scheduling with Minimal Channel Switching for Data Aggregation in MWSNs.

Collision-free transmission and efficient data transfer between nodes can be achieved through a set of channels in multichannel wireless sensor networks (MWSNs). While using multiple channels, we have to carefully consider channel interference, channel and time slot (resources) optimization, channel switching delay, and energy consumption. Since sensor nodes operate on low battery power, the energy consumed in channel switching becomes an important challenge. In this paper, we propose channel and time slot scheduling for minimal channel switching in MWSNs, while achieving efficient and collision-free transmission between nodes. The proposed scheme constructs a duty-cycled tree while reducing the amount of channel switching. As a next step, collision-free time slots are assigned to every node based on the minimal data collection delay. The experimental results demonstrate that the validity of our scheme reduces the amount of channel switching by 17.5%, reduces energy consumption for channel switching by 28%, and reduces the schedule length by 46%, as compared to the existing schemes.

A Semantic Segment Encoder (SSE): Improving human face inversion quality through minimized learning space.

Recently, Generative Adversarial Networks (GAN) has been greatly developed and widely used in image synthesis. A Style-Based Generator Architecture for Generative Adversarial Networks (StyleGAN) which is the foremost, continues to develop human face inversion domain. StyleGAN uses insufficient vector space to express more than one million pixels. It is difficult to apply in real business due to distortion-edit tradeoff problem in latent space. To overcome this, we propose a novel semantic segment encoder (SSE) with improved face inversion quality by narrowing the size of restoration latent space. Encoder's learning area is minimized to logical semantic-segment units that can be recognized by humans. The proposed encoder does not affect other segments because only one segment is edited at a time. To verify the face inversion quality, we compared with the latest encoders both Pixel2style2Pixel and RestyleEncoder. Experimental result shows that the proposed encoder improved distortion quality around 20% while maintain editing performance.

Effective route maintenance and restoration schemes in mobile ad hoc networks.

This study proposes a location-based hybrid routing protocol to improve data packet delivery and to reduce control message overhead in mobile ad hoc networks. In mobile environments, where nodes move continuously at a high speed, it is generally difficult to maintain and restore route paths. Therefore, this study suggests a new flooding mechanism to control route paths. The essence of the proposed scheme is its effective tracking of the destination's location based on the beacon messages of the main route nodes. Through experiments based on an NS-2 simulator, the proposed scheme shows improvements in the data packet delivery ratio and reduces the amount of routing control message overhead compared with existing routing protocols such as AODV, LAR, ZRP and AODV-DFR.

Implementation of fast handover for proxy mobile IPv6: Resolving out-of-order packets.

Mobile IP allows for location-independent routing of IP datagrams on the Internet. Mobile IP specifies how a mobile node (MN) registers with its home agent and how the home agent routes datagrams to the MN through the tunnel. Current Mobile IP protocols have difficulties meeting the stringent handover delay requirements of future wireless networks. Fast handover for Proxy Mobile IPv6 (FPMIPv6) is used to resolve handover latency and packet loss problems that occur in the Proxy Mobile IPv6 (PMIPv6) protocol. However, while implementing the FPMIPv6 scheme in a testbed, we encounter the out-of-order packet (OoOP) problem. The cause of this problem is the existence of two paths for data transmitted from a correspondent node (CN) to an MN. Since the problem affects the quality of service (QoS) of the network and the performance of the MN, we propose a new scheme using the last packet marker and packet buffering to solve this problem in FPMIPv6. The new Mobile Access Gateway (MAG) can control and deliver the data transmitted via the old path or the new path to an MN in order, using the last packet marker to notify the end of the data delivery in the old path and the packet buffering for holding the data delivered in the new path. We implement both the proposed scheme and FPMIPv6 in a testbed as a real network environment to demonstrate the correctness, cost effectiveness, and performance of the proposed scheme. A performance evaluation reveals that the proposed scheme can handle the OoOP problem efficiently.