• The Transactions of the Korea Information Processing Society
• /
• v.6 no.1
• /
• pp.49-56
• /
• 1999

Distributed object Computing, owing to the development of distributed computing, has improved the performance of distributed processing conducted between homogeneous and heterogeneous systems in network. However, it has failed to solve fundamental problems such as network overload and enormous requests demands by servers and clients. In this paper, we propose to design and implement an Object Migration system that uses the java language to tackle the mentioned problems. As the first step of the implementation of the system, we justify the characteristics of t도 mobile object model that keeps codes and states of an object. Implemented Object Migration System would accept objects being migrated to a specific node and support the virtual place in which objects could be executed automatically. Therefore, the Object Migration system we suggest could not only solve problems imposed to traditional distributed computing but also offer transparency of object migration between homogeneous and heterogeneous systems.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2013.11a
• /
• pp.268-270
• /
• 2013

본 논문에서는 최근 주파수 자원에 대한 수요가 급증하면서 효율적으로 주파수를 이용하기 위해 주파수 공유를 하면서 생길 수 있는 비용문제의 최고의 이득을 발생시킬 수 있도록 하기 위하여 이종네크워크(Heterogeneous Network)에서 매크로셀과 펨토셀 환경에서 스펙트럼 공유에 있어서 매크로셀이 사용하지 않는 스펙트럼을 펨토셀에 공유해줌으로써 이득을 취할 수 있는데 이러한 이득에 있어서 최고의 이득을 발생시킬 수 있도록 하기 위하여 펨토셀의 스펙트럼 공유당 비용 최적화 알고리즘을 제안 하였다.

• Journal of Advanced Information Technology and Convergence
• /
• v.10 no.2
• /
• pp.73-81
• /
• 2020

The number of mobile devices roaming into a ubiquitous city (u-city) continues to rise as wireless systems have been widely deployed. The number of mobile devices also varies with time, and they tend to frequently change their locations. In addition, the available wireless access networks may belong to different domains, administrations, management, and internet service providers (ISPs). A fusion of overlapping heterogeneous wireless access networks (e.g., WiMax, Wi-Fi, LTE, etc.) serves the u-city in order to reach different coverage. In this context, technical challenges arise in mobility management for heterogeneous networks to realize their potential coverage and capacity benefits. This paper deals with the analysis of a decentralized mobility management support for u-City wireless network infrastructure. This scheme takes advantage of the features of the fully-distributed model of networked-based mobility management protocol to alleviate and realize the ubiquitous requirements of a u-City.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.4
• /
• pp.1817-1836
• /
• 2020

Network convergence is considered as one of the key solutions to the problem of achieving future high-capacity and reliable communications. This approach overcomes the limitations of separate wireless technologies. Efficient interface selection is one of the most important issues in convergence networks. This paper solves the problem faced by users of selecting the most appropriate interface in the heterogeneous radio-access network (RAN) environment. Our proposed scheme combines a hierarchical evaluation of networks and game theory to solve the network-selection problem. Instead, of considering a fixed weight system while ranking the networks, the proposed scheme considers the service requirements, as well as static and dynamic network attributes. The best network is selected for a particular service request. To establish a hierarchy among the network-evaluation criteria for service requests, an analytical hierarchy process (AHP) is used. To determine the optimum network selection, the network hierarchy is combined with game theory. AHP attains the network hierarchy. The weights of different access networks for a service are calculated. It is performed by combining AHP scores considering user's experienced static network attributes and dynamic radio parameters. This paper provides a strategic game. In this game, the network scores of service requests for various RANs and the user's willingness to pay for these services are used to model a network-versus-user game. The Nash equilibria signify those access networks that are chosen by individual user and result maximum payoff. The examples for the interface selection illustrate the effectiveness of the proposed scheme.

• Journal of KIISE:Information Networking
• /
• v.31 no.5
• /
• pp.450-459
• /
• 2004

This paper studies the collective communication in the grid computing environment, which is characterized by the combination of heterogeneous networks as well as uneven, long communication delay. Efficient collective communication requires communication schedule, which in turn requires network information. When the network information is not accurate or network faults occur, the performance of collective communication can be markedly degraded. This paper proposes TTCC(Two-Tree Collective Communication) for scheduling collective communication in the grid. It Provides an efficient and reliable schedule even In this unfavorable network condition by maintaining two disjoint communication trees. Benefits of the proposed method are manifested via simulation, where the performance degradation with TTCC is much slower than those using conventional scheduling algorithms.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.5
• /
• pp.1285-1299
• /
• 1998

Thousands of multimedia services are being developed over existing public networks and high-speed communication networks. In the multi-carrier network, seamless integration of terminals and services is essential in order to offer an end-to-end and user-independent service. In this paper, we propose the concept of the Interworking Broker to provide an infrastructure for building multimedia service interworking platform that supports interactive multimedia applications in distributed heterogeneous network environment. We describe main techniques developed to achieve the service interworking, and also the functional architecture of the Interworking Broker in heterogeneous ATM network environments.

• Journal of Communications and Networks
• /
• v.18 no.2
• /
• pp.135-149
• /
• 2016

Cloud radio access network (C-RAN) refers to the virtualization of base station functionalities by means of cloud computing. This results in a novel cellular architecture in which low-cost wireless access points, known as radio units or remote radio heads, are centrally managed by a reconfigurable centralized "cloud", or central, unit. C-RAN allows operators to reduce the capital and operating expenses needed to deploy and maintain dense heterogeneous networks. This critical advantage, along with spectral efficiency, statistical multiplexing and load balancing gains, make C-RAN well positioned to be one of the key technologies in the development of 5G systems. In this paper, a succinct overview is presented regarding the state of the art on the research on C-RAN with emphasis on fronthaul compression, baseband processing, medium access control, resource allocation, system-level considerations and standardization efforts.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.18 no.5
• /
• pp.1163-1185
• /
• 2024

With the sharp increase in the volume of literature data, researchers must spend considerable time and energy locating desired papers. A paper recommendation is the means necessary to solve this problem. Unfortunately, the large amount of data combined with sparsity makes personalizing papers challenging. Traditional matrix decomposition models have cold-start issues. Most overlook the importance of information and fail to consider the introduction of noise when using side information, resulting in unsatisfactory recommendations. This study proposes a paper recommendation method (PR-SLSMF) using document-level representation learning with citation-informed transformers (SPECTER) and low-rank and sparse matrix factorization; it uses SPECTER to learn paper content representation. The model calculates the similarity between papers and constructs a weighted heterogeneous information network (HIN), including citation and content similarity information. This method combines the LSMF method with HIN, effectively alleviating data sparsity and cold-start issues and avoiding topic drift. We validated the effectiveness of this method on two real datasets and the necessity of adding side information.

• Journal of Institute of Control, Robotics and Systems
• /
• v.18 no.7
• /
• pp.622-626
• /
• 2012

This paper presents synchronization of LTV (Linear Time-Varying) MAS (Multi-Agent Systems) with heterogeneous time-varying disturbances under a fixed, connected, and undirected communication network. All the agents can collect only relative state information from their neighborhoods. To achieve synchronization of the MAS, an integral control scheme is proposed based on relative state information between agents.

• Journal of Advanced Information Technology and Convergence
• /
• v.8 no.2
• /
• pp.13-25
• /
• 2018

The paper analyzes the sum spectral efficiency (SE) for a heterogeneous cellular network (HetNet) which has the backhaul, provided with wireless full-duplex massive multiple-input multiple-out (MIMO) with hardware distortions. We derive approximate expressions to obtain the uplink/downlink sum SE of the backhaul. The analytic results have been shown to be exact when compared to Monte Carlo simulations. From the analysis, it is shown that the desired signal and the hardware distortion noise have the same order. The sum SE generally improves when the number of receive antennas increases but degrades when the hardware quality reduces. A sum SE performance ceiling is introduced by the hardware quality level.