• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.4
• /
• pp.1638-1654
• /
• 2018

The heterogeneous network (HetNet) has been one of the key technologies in Long Term Evolution-Advanced (LTE-A) with growing capacity and coverage demands. However, the introduction of femtocells has brought serious co-layer interference and cross-layer interference, which has been a major factor affecting system throughput. It is generally acknowledged that the resource allocation has significant impact on suppressing interference and improving the system performance. In this paper, we propose a hybrid-clustering algorithm based on the $Mat{\acute{e}}rn$ hard-core process (MHP) to restrain two kinds of co-channel interference in the HetNet. As the impracticality of the hexagonal grid model and the homogeneous Poisson point process model whose points distribute completely randomly to establish the system model. The HetNet model based on the MHP is adopted to satisfy the negative correlation distribution of base stations in this paper. Base on the system model, the spectrum sharing problem with restricted spectrum resources is further analyzed. On the basis of location information and the interference relation of base stations, a hybrid clustering method, which takes into accounts the fairness of two types of base stations is firstly proposed. Then, auction mechanism is discussed to achieve the spectrum sharing inside each cluster, avoiding the spectrum resource waste. Through combining the clustering theory and auction mechanism, the proposed novel algorithm can be applied to restrain the cross-layer interference and co-layer interference of HetNet, which has a high density of base stations. Simulation results show that spectral efficiency and system throughput increase to a certain degree.

• Journal of the Korea Society for Simulation
• /
• v.12 no.4
• /
• pp.51-59
• /
• 2003

Real-Time applications on Grid environment have several problems in terms of resource management addressed as follows; (1) dynamic resource allocation to provide QoS objectives, (2) heterogeneous resources that is different scale, or capacity in same unit, and (3) resource availability, and resource needs. This paper describes the techniques of resource manager (RM) handling above problems to support QoS of dynamic real-time applications on Grid. The contributions of this paper to solve problems are as follows: unification of dynamic resource requirements among heterogeneous hosts, control of resources in heterogeneous environments, and dynamic load balancing/sharing. Our heuristic allocation scheme works not only 257% better than random, 142% better than round robin, and 36.4% better than least load in QoS sensitivity, but also 38.6% better than random, 28.5% better than round robin, and 31.6% better than least load in QoS.

• Journal of the Korea Society of Computer and Information
• /
• v.22 no.3
• /
• pp.35-43
• /
• 2017

In IoT(Internet of Things) environment, users want to receive customized service by users' personal device such as smart watch and pendant. To fulfill this requirement, the mobile device should support a lot of functions. However, the miniaturization of mobile devices is another requirement and has limitation such as tiny display. limited I/O, and less powerful processors. To solve this limitation problem and provide customized service to users, this paper proposes a collaboration system for sharing various computing resources. The paper also proposes the method for reasoning and recommending suitable resources to compose the user-requested service in small device with limited power on expected time. For this goal, our system adopts MBTI(Myers-Briggs Type Indicator) to analyzes user's behavior pattern and recommends personalized resources based on the result of the analyzation. The evaluation in this paper shows that our approach not only reduces recommendation time but also increases user satisfaction with the result of recommendation.

• Journal of Communications and Networks
• /
• v.16 no.2
• /
• pp.140-145
• /
• 2014

In this paper, we propose an anti-interference cooperative spectrum sharing strategy for cognitive system, in which a secondary system can operate on the same spectrum of a primary system. Specifically, the primary system leases a fraction of its transmission time to the secondary system in exchange for cooperation to achieve the target rate. To gain access to the spectrum of the primary system, the secondary system needs to allocate a fraction of bandwidth to help forward the primary signal. As a reward, the secondary system can use the remaining bandwidth to transmit its own signal. The secondary system uses different bandwidth to transmit the primary and its own signal. Thus, there will be no interference felt at primary and secondary systems. We study the joint optimization of time and bandwidth allocation such that the transmission rate of the secondary system is maximized, while guaranteeing the primary system, as a higher priority, to achieve its target transmission rate. Numerical results show that the secondary system can gain significant improvement with the proposed strategy.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.11A
• /
• pp.1120-1127
• /
• 2007

In this paper, we propose a generalized processor sharing - dynamic resource allocation (GPS-DRA) scheme which allocates the required amount of resources to each hop dynamically in cellular-based multi-hop systems. In the hybrid-distributed system considered in this paper, a central controller such as a base station (BS) should allocate resources properly to each hop. However, due to changing channel condition with time, it is difficult to allocate as much amount of resources as each hop needs for transmission. GPS-DRA scheme allocates the required amount of resources dynamically to each hop based on the amount of resources used in previous frames by each hop. The amount of control overhead generated by GPS-DRA scheme can be very small because a central controller doesn't need to collect all link information for resource allocation. Our simulation results show that channel utilization increased about 16% and cell capacity increased about 65% compared to those of fixed resource allocation (FRA) scheme.

• Journal of The Institute of Information and Telecommunication Facilities Engineering
• /
• v.11 no.1
• /
• pp.10-15
• /
• 2012

Ultra wideband (UWB) technologies have been developed to exploit a new spectrum resource in substances and to realize ultra-high-speed communication, high precision geo-location, and other applications. The energy of UWB signal is extremely spread from near DC (Direct Current) to a few GHz. This means that the interference between conventional narrowband systems and UWB systems is inevitable. However, the interference effects had not previously been studied from UWB wireless systems to conventional wireless systems sharing the frequency bands such as broadcasting system. This paper experimentally evaluates the interference from two kinds of UWB sources, namely an orthogonal frequency division multiplex UWB source and an impulse radio UWB source, to a broadcasting transmission system. The S/N ratio degradation of broadcasting system is presented. From these experimental results, we show that in all practical cases UWB system can be coexisted 35m distance in-band broadcasting network.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2022.10a
• /
• pp.430-432
• /
• 2022

With the recent increase in interest in the open science movement in science and technology fields such as open access, open data, and open source, the movement to share and utilize publicly funded research products is materializing and revitalizing. In line with this trend, many efforts are being made to establish and revitalize a system for sharing and utilizing research data, which is a key resource for research in Korea. These efforts are mainly focused on collecting research data by field and institution, and linking it with DataON, a national research data platform, to search and utilize it. However, developed countries are building a system that can share and utilize not only such research data but also various types of R&D-related computing resources such as IaaS, PaaS, SaaS, and MLaaS. EOSC (European Open Science Cloud), ARDC (Australian Research Data Commons), and CSTCloud (China S&T Cloud) are representative examples. In Korea, the Korea Research Data Commons (KRDC) is designed and a core framework is being developed to facilitate the sharing of these computing resources. In this study, the necessity, concept, composition, and future plans of KRDC are introduced.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.5
• /
• pp.101-106
• /
• 2011

In this paper, our goal is to design the controller which operates a manufacturing system, discrete event system, guaranteeing user specification. In specially, based on supervisory control theory W. M. Wonham, our work consists in performing the controller using Petri nets possible parallelism. In addition, we consider the problem of allocation for resources sharing of the issues to consider when designing using Petri net. The controller can be generated by synthesis of user specification model and plant model after giving the management for the resource sharing. This created controller can control the deadlock and starvation which can occur in the case with resource sharing. Previous studies proposed the Constrained Synchronous Reachability graph to synthesis of the two Petri nets models. Therefore, we provide the controlled system which forbids a deadlock and starvation using the result of previous studies.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.16 no.2
• /
• pp.35-43
• /
• 2020

Cloud computing integrates computing resources such as servers, storage, and networks with virtualization technology to provide suitable services according to user needs. Due to the structural characteristics of sharing physical resources based on virtualization technology, threats to availability can occur, so it is essential to respond to availability threats in cloud computing. Existing over-provisioning method is not suitable because it can generate idle resources and cause under-provisioning to degrade or disconnect service. System resources must be allocated in real-time according to the system load to guarantee the cloud system's availability. Through appropriate management measures, it is necessary to reduce the system load and increase the performance of the system. This paper analyzes the work response time according to the allocation or migration of virtual machines and discusses an efficient resource management method considering the system load.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.5
• /
• pp.709-735
• /
• 2010

The reciprocal virtue of peer-to-peer networking has stimulated an explosion of peer population and service capacity, ensuring rapid content distribution in peer-to-peer networks. Critical issues such as peer churn, free riding, and skewed workload significantly affect performance results such as service agility, fairness, and resource utilization. To resolve these problems systematically, this study proposes a peer assignment scheme that supports fair peer-to-peer file sharing applications. The proposed scheme exploits the peer duality of both server-oriented peer capacity and client-oriented peer contribution. Accordingly, the system server can prioritize download requests and appropriately assign server peers to uploading file objects. Several functional extensions, including peer substitution and elimination, bandwidth adjustment, and distributed modification, help cope with subtle situations of service starvation and download blocking, and hence make the system design robust and amenable. Simulation results show this design is examined under both centralized and distributed peer-to-peer environments. Performance results confirm that the proposed mechanisms are simple but effective in maintaining service agility and fairness, without loss of overall service capacity in peer-to-peer files sharing systems.