• Journal of Information Processing Systems
• /
• v.18 no.6
• /
• pp.803-812
• /
• 2022

With the increasing number of mobile device users worldwide, utilizing mobile edge computing (MEC) devices close to users for content caching can reduce transmission latency than receiving content from a server or cloud. However, because MEC has limited storage capacity, it is necessary to determine the content types and sizes to be cached. In this study, we investigate a caching strategy that increases the hit ratio from small base stations (SBSs) for mobile users in a heterogeneous network consisting of one macro base station (MBS) and multiple SBSs. If there are several SBSs that users can access, the hit ratio can be improved by reducing duplicate content and increasing the diversity of content in SBSs. We propose a Deep Q-Network (DQN)-based caching strategy that considers time-varying content popularity and content redundancy in multiple SBSs. Content is stored in the SBS in a divided form using maximum distance separable (MDS) codes to enhance the diversity of the content. Experiments in various environments show that the proposed caching strategy outperforms the other methods in terms of hit ratio.

• International journal of advanced smart convergence
• /
• v.9 no.1
• /
• pp.109-112
• /
• 2020

Many devices are connected on the internet to give functionalities for interconnected services. In 2020', The number of devices connected to the internet will be reached 5.8 billion. Moreover, many connected service provider such as Google and Amazon, suggests edge computing and mesh networks to cope with this situation which the many devices completely connected on their networks. This paper introduces the current state of the introduction of the wireless mesh network and edge cloud in order to efficiently manage a large number of nodes in the exploding Internet of Things (IoT) network and introduces the existing Network Time Protocol (NTP). On the basis of this, we propose a relatively accurate time synchronization method, especially in heterogeneous mesh networks. Using this NTP, multiple time coordinators can be placed in a mesh network to find the delay error using the average delay time and the delay time of the time coordinator. Therefore, accurate time can be synchronized when implementing IoT, remote metering, and real-time media streaming using IoT mesh network.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.2
• /
• pp.540-557
• /
• 2021

Privacy vulnerability of social networks is one of the major concerns for social science research and business analysis. Most existing studies which mainly focus on un-weighted network graph, have designed various privacy models similar to k-anonymity to prevent data disclosure of vertex attributes or relationships, but they may be suffered from serious problems of huge information loss and significant modification of key properties of the network structure. Furthermore, there still lacks further considerations of privacy protection for important sensitive edges in weighted social networks. To address this problem, this paper proposes a privacy preserving method to protect sensitive weighted edges. Firstly, the sensitive edges are differentiated from weighted edges according to the edge betweenness centrality, which evaluates the importance of entities in social network. Then, the perturbation operations are used to preserve the privacy of weighted social network by adding some pseudo-edges or modifying specific edge weights, so that the bottleneck problem of information flow can be well resolved in key area of the social network. Experimental results show that the proposed method can not only effectively preserve the sensitive edges with lower computation cost, but also maintain the stability of the network structures. Further, the capability of defending against malicious attacks to important sensitive edges has been greatly improved.

• Journal of Internet Computing and Services
• /
• v.23 no.2
• /
• pp.1-7
• /
• 2022

Machine learning (ML) algorithms have been intended to seamlessly collaborate for enabling intelligent networking in terms of massive service differentiation, prediction, and provides high-accuracy recommendation systems. Mobile edge computing (MEC) servers are located close to the edge networks to overcome the responsibility for massive requests from user devices and perform local service offloading. Moreover, there are required lightweight methods for handling real-time Internet of Things (IoT) communication perspectives, especially for ultra-reliable low-latency communication (URLLC) and optimal resource utilization. To overcome the abovementioned issues, this paper proposed an intelligent scheme for traffic steering based on the integration of MEC and lightweight ML, namely support vector machine (SVM) for effectively routing for lightweight and resource constraint networks. The scheme provides dynamic resource handling for the real-time IoT user systems based on the awareness of obvious network statues. The system evaluations were conducted by utillizing computer software simulations, and the proposed approach is remarkably outperformed the conventional schemes in terms of significant QoS metrics, including communication latency, reliability, and communication throughput.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.11
• /
• pp.3523-3543
• /
• 2022

Autonomous vehicles are gradually being regarded as the mainstream trend of future development of the automobile industry. Autonomous driving networks generate many intensive and delay-sensitive computing tasks. The storage space, computing power, and battery capacity of autonomous vehicle terminals cannot meet the resource requirements of the tasks. In this paper, we focus on the task scheduling problem of autonomous driving in software-defined edge networks. By analyzing the intensive and delay-sensitive computing tasks of autonomous vehicles, we propose an emotion model that is related to task urgency and changes with execution time and propose an optimal base station (BS) task scheduling (OBSTS) algorithm. Task sentiment is an important factor that changes with the length of time that computing tasks with different urgency levels remain in the queue. The algorithm uses task sentiment as a performance indicator to measure task scheduling. Experimental results show that the OBSTS algorithm can more effectively meet the intensive and delay-sensitive requirements of vehicle terminals for network resources and improve user service experience.

• ETRI Journal
• /
• v.42 no.2
• /
• pp.175-185
• /
• 2020

Inter-cell interference (ICI) is a major problem in heterogeneous networks, such as two-tier femtocell (FC) networks, because it leads to poor cell-edge throughput and system capacity. Dynamic ICI coordination (ICIC) schemes, which do not require prior frequency planning, must be employed for interference avoidance in such networks. In contrast to existing dynamic ICIC schemes that focus on homogeneous network scenarios, we propose a novel semi-distributed dynamic ICIC scheme to mitigate interference in heterogeneous network scenarios. With the goal of maximizing the utility of individual users, two separate algorithms, namely the FC base station (FBS)-level algorithm and FC management system (FMS)-level algorithm, are employed to restrict resource usage by dominant interference-creating cells. The distributed functionality of the FBS-level algorithm and low computational complexity of the FMS-level algorithm are the main advantages of the proposed scheme. Simulation results demonstrate improvement in cell-edge performance with no impact on system capacity or user fairness, which confirms the effectiveness of the proposed scheme compared to static and semi-static ICIC schemes.

• Journal of Korea Multimedia Society
• /
• v.22 no.2
• /
• pp.210-224
• /
• 2019

Given a positive integer k as input, a spatial preference query finds the k best data objects based on the scores (e.g., qualities) of feature objects in their spatial neighborhoods. Several solutions have been proposed for spatial preference queries in Euclidean space. A few algorithms study spatial preference queries in undirected spatial networks where each edge is undirected and the distance between two points is the length of the shortest path connecting them. However, spatial preference queries have not been thoroughly investigated in directed spatial networks where each edge has a particular orientation that makes the distance between two points noncommutative. Therefore, in this study, we present a new method called ALPS+ for processing spatial preference queries in directed spatial networks. We conduct extensive experiments with different setups to demonstrate the superiority of ALPS+ over conventional solutions.

• Proceedings of the Optical Society of Korea Conference
• /
• 2002.07a
• /
• pp.38-39
• /
• 2002

Optical telecommunication has been growing at a rate that exceeds even the "Moore′s Law". However, while the electronic revolution has allowed everyone to have his/her own PC, the optical revolution is still confined to the long-haul network such that the individual end users are still connected to an electronic metro/access networks. However, given the rapid increase in the data traffic (e.g., multimedia), the optical edge that separates the individual end users from optical networks will eventually have to include the metro/acces networks. (omitted)

• The KIPS Transactions:PartC
• /
• v.11C no.5
• /
• pp.677-682
• /
• 2004

In the present paper routing and wavelength assignment (RWA) in optical WDM networks is considered. Previous techniques based on the combination of integer linear programming and graph coloring are complex and require extensive use of heuristics. Such methods are mostly slow and sometimes impossible to get results due to infeasibility. An alternative approach applied to RWA employs on the greedy algorithm for obtaining the maximum edge disjoint paths. Even though this approach is fast, it produces a solution for any connection request, which is very far from the optimal utilization of wavelengths. We propose a novel algorithm, which is based on the maximum flow technique to obtain the maximum quantity of edge, disjoint paths. Here we compare the offered method with previous maximum edge disjoint paths algorithms ap plied to the RWA.

• Korean Journal of Construction Engineering and Management
• /
• v.25 no.2
• /
• pp.36-44
• /
• 2024

This paper presents the application of Convolutional Neural Networks (CNNs) and Region of Interest (ROI) techniques for concrete crack analysis. Surfaces of concrete structures, such as beams, etc., are exposed to fatigue stress and cyclic loads, typically resulting in the initiation of cracks at a microscopic level on the structure's surface. Early detection enables preventative measures to mitigate potential damage and failures. Conventional manual inspections often yield subpar results, especially for large-scale infrastructure where access is challenging and detecting cracks can be difficult. This paper presents data collection, edge segmentation and ROI techniques application, and analysis of concrete cracks using Convolutional Neural Networks. This paper aims to achieve the following objectives: Firstly, achieving improved accuracy in crack detection using image-based technology compared to traditional manual inspection methods. Secondly, developing an algorithm that utilizes enhanced Sobel edge segmentation and ROI techniques. The algorithm provides automated crack detection capabilities for non-destructive testing.