Container-based Internet of Things (IoT) applications in an edge computing environment require autoscaling to dynamically adapt to fluctuations in IoT device requests. Although Kubernetes’ horizontal pod autoscaler provides the resource autoscaling feature by monitoring the resource status of nodes and then making pod adjustments if necessary, it evenly allocates pods to worker nodes without considering the imbalance of resource demand between nodes in an edge computing environment. This paper proposes the traffic-aware horizontal pod autoscaler (THPA), which operates on top of Kubernetes to enable real-time traffic-aware resource autoscaling for IoT applications in an edge computing environment. THPA performs upscaling and downscaling actions based on network traffic information from nodes to improve the quality of IoT services in the edge computing infrastructure. Experimental results show that Kubernetes with THPA improves the average response time and throughput of IoT applications by approximately 150% compared to Kubernetes with the horizontal pod autoscaler. This indicates that it is important to provide proper resource scaling according to the network traffic distribution to maximize IoT applications performance in an edge computing environment.

The recent increase in the number of Internet of Things (IoT) devices has led to the generation of a large amount of data. These data are generally processed by cloud servers because of their high scalability and ability to provide resources on demand. However, processing large amounts of data in the cloud is an impractical solution for the strict requirements of IoT services, such as low latency and high bandwidth. Fog computing, which brings computational resources closer to the IoT devices, has emerged as a suitable solution to mitigate these problems. Resource provisioning and application orchestration are two of the key challenges when running IoT applications in a Fog computing environment. In this paper, we present ElasticFog, which runs on top of the Kubernetes platform and enables real-time elastic resource provisioning for containerized applications in Fog computing. Specifically, ElasticFog collects network traffic information in real time and allocates computational resources proportionally to the distribution of network traffic. The experimental results prove that ElasticFog achieves a significant improvement in terms of throughput and network latency compared with the default mechanism in Kubernetes.

Kubernetes (K8s) is expected to be a key container orchestration tool for edge computing infrastructures owing to its various features for supporting container deployment and dynamic resource management. For example, its horizontal pod autoscaling feature provides service availability and scalability by increasing the number of replicas. kube-proxy provides traffic load-balancing between replicas by distributing client requests equally to all pods (replicas) of an application in a K8s cluster. However, this approach can result in long delays when requests are forwarded to remote workers, especially in edge computing environments where worker nodes are geographically dispersed. Moreover, if the receiving worker is overloaded, the request-processing delay can increase significantly. To overcome these limitations, this paper proposes an enhanced load balancer called resource adaptive proxy (RAP). RAP periodically monitors the resource status of each pod and the network status among worker nodes to aid in load-balancing decisions. Furthermore, it preferentially handles requests locally to the maximum extent possible. If the local worker node is overloaded, RAP forwards its requests to the best node in the cluster while considering resource availability. Our experimental results demonstrated that RAP could significantly improve throughput and reduce request latency compared with the default load-balancing mechanism of K8s.

Smart home is one of the most promising applications of the Internet of Things. Although there have been studies about this technology in recent years, the adoption rate of smart homes is still low. One of the largest barriers is technological fragmentation within the smart home ecosystem. Currently, there are many protocols used in a connected home, increasing the confusion of consumers when choosing a product for their house. One possible solution for this fragmentation is to make a gateway to handle the diverse protocols as a central hub in the home. However, this solution brings about another issue for manufacturers: compatibility. Because of the various smart devices on the market, supporting all possible devices in one gateway is also an enormous challenge. In this paper, we propose a software architecture for a gateway in a smart home system to solve the compatibility problem. By creating a mechanism to dynamically download and update a device profile from a server, the gateway can easily handle new devices. Moreover, the proposed gateway also supports unified control over heterogeneous networks. We implemented a prototype to prove the feasibility of the proposed gateway architecture and evaluated its performance from the viewpoint of message execution time over heterogeneous networks, as well as the latency for device profile downloads and updates, and the overhead needed for handling unknown commands.

The time synchronization protocol is indispensable in various applications of wireless sensor networks, such as scheduling, monitoring, and tracking. Numerous protocols and algorithms have been proposed in recent decades, and many of them provide micro-scale resolutions. However, designing and implementing a time synchronization protocol in a practical wireless network is very challenging compared to implementation in a wired network; this is because its performance can be deteriorated significantly by many factors, including hardware quality, message delay jitter, ambient environment, and network topology. In this study, we measure the performance of the Flooding Time Synchronization Protocol (FTSP) and Gradient Time Synchronization Protocol (GTSP) in terms of practical network conditions, such as message delay jitter, synchronization period, network topology, and packet loss. This study provides insights into the operation and optimization of time synchronization protocols. In addition, the performance evaluation identifies that FTSP is highly affected by message delay jitter due to error accumulation over multi-hops. We demonstrate that the proposed extended version of the FTSP (E-FTSP) alleviates the effect of message delay jitter and enhances the overall performance of FTSP in terms of error, time, and other factors.

Slow convergence is a major drawback of average-based consensus time synchronization protocols, particularly in large or sparse wireless sensor networks. The convergence speed can be increased by adding more nodes or increasing the transmission range of nodes, because the network becomes strongly connected. However, these solutions are not always feasible owing to hardware constraints. In this paper, a Virtual Topology based Time Synchronization Protocol (VTSP) is proposed to address the aforementioned drawback of consensus-based protocols. Notably, VTSP performs the consensus process on a virtual topology that has a stronger algebraic connectivity than a physical one. Therefore, VTSP can significantly accelerate convergence speed without modifying the physical structure of the network. The virtual topology is formed by creating virtual links between each node and its two-hop neighbors. Moreover, two optimization techniques are suggested for reducing data redundancy, which is caused during the creation of the virtual links, in timing messages and for speeding up the convergence by excluding edge nodes from the consensus process. Simulation results demonstrate that VTSP can achieve convergence three times faster than the Gradient Time Synchronization Protocol, a well-known consensus-based time synchronization protocol, in various topologies while preserving the same level of accuracy.