• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.2
• /
• pp.298-306
• /
• 2015

In this paper, we propose an efficient resource allocation scheme for the integrated satellite/terrestrial networks. The proposed scheme is a frequency sharing technique to mitigate the inter-component interferences which can be generated between a satellite beam and terrestrial cells that are operated in the same frequency. The proposed dynamic resource allocation scheme can mitigate the total inter-component interference by optimizing the total transmission power and it can expect a result of which can lead to an increase in capacity. In such a system, the interference situation can be affected by the distributed traffic demands or up/down link communications environments. In this point of view, we evaluate the performance of the total consumed power, the amount of inter-component interference with respect to different traffic distributions and interference environments between the satellite beam and terrestrial systems.

• Journal of KIBIM
• /
• v.10 no.3
• /
• pp.43-53
• /
• 2020

BIM-based Cloud platform gained popularity coupled with the convergence of Fourth Industrial Revolution technology. However, most of the previous work has not guaranteed sufficient efficiency to meet user requirements according to BIM service. Furthermore, the Cloud environment is only used as a server and it does not consider cloud characteristics. For the processing of High Capacity Data like BIM and using seamless BIM service, Resource management technology is required in the cloud environment. In this paper, to solve the problems, we propose a BIM platform for BaaS and an efficient resource allocation scheme. We also proved the efficiency of resource for the proposed scheme by using existing schemes. By doing this, the proposed scheme looks forward to accelerating the growth of the BaaS through improving the user experience and resource efficiency.

• ETRI Journal
• /
• v.39 no.4
• /
• pp.546-557
• /
• 2017

In a long term evolution-advanced (LTE-A) system, the traffic overload of machine type communication devices is a challenge because too many devices attempt to access a base station (BS) simultaneously in a short period of time. We discuss the challenge of the gap between the theoretical maximum throughput and the actual throughput. A gap occurs when the BS cannot change the number of preambles for a random access channel (RACH) until multiple numbers of RACHs are completed. In addition, a preamble partition approach is proposed in this paper that uses two groups of preambles to reduce this gap. A performance evaluation shows that the proposed approach increases the average throughput. For 100,000 devices in a cell, the throughput is increased by 29.7% to 114.4% and 23.0% to 91.3% with uniform and Beta-distributed arrivals of devices, respectively.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.519-522
• /
• 1998

The Constructive Battle simulation Model is very important to the recent military training for the substitution of the field training. However, real battlefield systems operate under rea-time conditions, they are inherently distributed, concurrent and dynamic. In order to reflect these properties by the computer-based simulation systems which represent real world processes, we have been developing constructive simulation model for several years. The constructive simulation system is one of the famous real-time system software, nd the one common feature of all real-time systems is defined as the correctness of the system depend not only on the logical result of computation, but also on the time at which the results are produced. Conventionally, scheduling and resource allocation activities which have timing constraints are major problem of real-time computing systems. To overcome these constraints, we elaborated on these issues and developed the simulation system on commercially available hardware and operating system with lock-free resource allocation scheme and rae monotonic scheduling.

• Journal of Communications and Networks
• /
• v.8 no.1
• /
• pp.106-115
• /
• 2006

The current trend toward the utilization of the Internet as a common means for the offer of heterogeneous services imposes to address the issues related to end-to-end service assurance in the inter-domain scenario. In this paper, we first present an architecture for service management in networks based on service level specifications (SLS). The architecture is designed to be independent both of the specific network technology adopted and of the high level service semantics. Then, we focus on a specific functionality of the proposed architecture: Resource allocation in the multi-domain scenario. A distributed admission control algorithm is introduced, its complexity is evaluated and a comparison with related solutions is provided.

• Proceedings of the IEEK Conference
• /
• 2007.07a
• /
• pp.195-196
• /
• 2007

The purpose of this paper is to analyze the resource allocation problem in a self organizing network from the viewpoint of game theory. The main focus is to suggest the model and analyze a power control algorithm in wireless ad-hoc networks using non cooperative games. Our approach is based on a model for the level of satisfaction and utility a wireless user in a self organizing network derives from using the system. Using this model, we show a distributed power control scheme that maximizes utility of each user in the network. Formulating this as a non-cooperative game we will show the feasibility of such power control as well as existence of the Nash Equilibrium achieved by the non-cooperative game.

• Journal of information and communication convergence engineering
• /
• v.14 no.1
• /
• pp.21-25
• /
• 2016

N-screen is a promising technology to improve support for multimedia multicasting, content sharing, content mobility, media scalability, and seamless mobility. In this paper, the WiMedia distributed-MAC (D-MAC) protocol is adopted for development of a seamless N-screen wireless service. Furthermore, to provide a multi-hop, one source multi-use N-screen service through point to point streaming in a seamless D-MAC protocol, a dynamic multi-frame transmission technology is proposed. In this technology, a dynamic time slot allocation scheme and a multi-hop resource reservation scheme are combined. In the proposed dynamic time slot allocation scheme, two thresholds, a hard threshold and a soft threshold, are included to satisfy the power consumption and delay requirements. A multi-frame DRP reservation scheme is proposed to minimize end-to-end delay during the multi-hop transmissions between N-screen devices. The proposed dynamic multi-frame transmission scheme enhances N-screen performance in terms of the multi-hop link establishment success rate and link establishment time compared to the conventional WiMedia D-MAC system.

• International Journal of Internet, Broadcasting and Communication
• /
• v.16 no.2
• /
• pp.119-126
• /
• 2024

The volume of genomic data is constantly increasing in various modern industries and research fields. This growth presents new challenges and opportunities in terms of the quantity and diversity of genetic data. In this paper, we propose a distributed cloud system for integrating and managing large-scale gene databases. By introducing a distributed data storage and processing system based on the Hadoop Distributed File System (HDFS), various formats and sizes of genomic data can be efficiently integrated. Furthermore, by leveraging Spark on YARN, efficient management of distributed cloud computing tasks and optimal resource allocation are achieved. This establishes a foundation for the rapid processing and analysis of large-scale genomic data. Additionally, by utilizing BigQuery ML, machine learning models are developed to support genetic search and prediction, enabling researchers to more effectively utilize data. It is expected that this will contribute to driving innovative advancements in genetic research and applications.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.21 no.6
• /
• pp.163-171
• /
• 2021

In this paper, the energy transaction system was optimized by applying a resource allocation algorithm and deep reinforcement learning in the distributed power system. The power demand and supply environment were predicted by deep reinforcement learning. We propose a system that pursues common interests in power trading and increases the efficiency of long-term power transactions in the paradigm shift from conventional centralized to distributed power systems in the power trading system. For a realistic energy simulation model and environment, we construct the energy market by learning weather and monthly patterns adding Gaussian noise. In simulation results, we confirm that the proposed power trading systems are cooperative with each other, seek common interests, and increase profits in the prolonged energy transaction.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.5
• /
• pp.1790-1806
• /
• 2015

Utility-based routing is a special type of routing approach using a composite utility metric when making routing decisions in ad hoc and sensor networks. Previous studies on the utility-based routing all use fixed retry limit and a very simple distance related energy model, which makes the utility maximization less efficient and the implementation separated from practice. In this paper, we refine the basic utility model by capturing the correlation of the transmit power, the retry limit, the link reliability and the energy cost. A routing algorithm based on the refined utility model with adaptive transmit power and retry limit allocation is proposed. With this algorithm, packets with different priorities will automatically receive utility-optimal delivery. The design of this algorithm is based on the observation that for a given benefit, there exists a utility-maximum route with optimal transmit power and retry limit allocated to intermediate forwarding nodes. Delivery along the utility-optimal route makes a good balance between the energy cost and the reliability according to the value of the packets. Both centralized algorithm and distributed implementations are discussed. Simulations prove the satisfying performance of the proposed algorithm.