• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.11
• /
• pp.3892-3912
• /
• 2021

The recent rapid growth of mobile network traffic places multi-access edge computing in an important position to reduce network load and improve network capacity and service quality. Contrasting with traditional mobile cloud computing, multi-access edge computing includes a base station cooperative cache layer and user cooperative cache layer. Selecting the most appropriate cache content according to actual needs and determining the most appropriate location to optimize the cache performance have emerged as serious issues in multi-access edge computing that must be solved urgently. For this reason, a cache placement algorithm based on comprehensive utility in big data multi-access edge computing (CPBCU) is proposed in this work. Firstly, the cache value generated by cache placement is calculated using the cache capacity, data popularity, and node replacement rate. Secondly, the cache placement problem is then modeled according to the cache value, data object acquisition, and replacement cost. The cache placement model is then transformed into a combinatorial optimization problem and the cache objects are placed on the appropriate data nodes using tabu search algorithm. Finally, to verify the feasibility and effectiveness of the algorithm, a multi-access edge computing experimental environment is built. Experimental results show that CPBCU provides a significant improvement in cache service rate, data response time, and replacement number compared with other cache placement algorithms.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.10 no.1
• /
• pp.99-104
• /
• 2014

Nowadays, various researches fulfill in many communication engineering area for B4G (Beyond Forth Generation). Next LTE-A (Long Term Evolution Advanced), MU-MIMO (Multi-User Multi Input Multi Output) method raises to upgrade throughput performance. However, the method of user selection is not decided because of many types and discussions in MU-MIMO system. Many existing methods are powerful for enhancing performance but have various restrictions in practical implementation. Fairness problem is primary restriction in this area. Existing papers emphasis algorithm to increase sum-rate but we introduce an algorithm about dealing with fairness problem for real commercialization implementation. Therefore, this paper introduces new user selection method in MU-MIMO system. This method overcomes a fairness problem in SUS (Semiorthogonal User Selection) algorithm. We can use the method to get a similar sum-rate with SUS and a high fairness performance. And this paper uses a hybrid method with SC-SUS (Superposition Coding SUS) algorithm and SUS algorithm. We find a threshold value of optimal performance by experimental method. We show this performance by computer simulation with MATLAB and analysis that results. And we compare the results with another paper's that different way to solve fairness problem.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.2
• /
• pp.65-71
• /
• 2014

This paper present the multi-modal user distance estimation system using mono camera and mono microphone basically equipped with a mobile device. In case of a distance estimation method using an image, we is estimated a distance of the user through the skin color region extraction step, a noise removal step, the face and eyes region detection step. On the other hand, in case of a distance estimation method using speech, we calculates the absolute difference between the value of the sample of speech input. The largest peak value of the calculated difference value is selected and samples before and after the peak are specified as the ROI(Region of Interest). The samples specified perform FFT(Fast Fourier Transform) and calculate the magnitude of the frequency domain. Magnitude obtained is compared with the distance model to calculate the likelihood. We is estimated user distance by adding with weights in the sorted value. The result of an experiment using the multi-modal method shows more improved measurement value than that of single modality.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.44.1-44
• /
• 2001

This paper discusses the interacting mobile robots for tele-operation system using the world wide web. In multi-agent and web-based teleoperation environment the problem of communication delay must be solved for the efficient and robust control of the system. The standard graphic user interface(GUI)is implemented using Java Programing language. The web browser is used to integrate the virtual environment and the standard GUI(Java applet) in a single user interface. Users can access a dedicated WWWserver and download the user interface. Reinforcement learning is applied to indirect control in order to autonomously operate without the need of human intervention. Java application has been developed to communicate and control multi robots using WWW. The effectiveness of our multi robots system is verified by simulation and experiments ...

• Journal of information and communication convergence engineering
• /
• v.7 no.3
• /
• pp.286-291
• /
• 2009

In this paper, the performance of ultra-wideband (UWB) single input multiple output (SIMO) systems to achieve high data rate communications is studied in dense multipath environments. The effects of spatial and temporal diversities on the performance of multi-user time-hopping UWB systems using binary pulse position modulation (2PPM) are analyzed. The reduced-complexity Rake receivers based on the selective combining (called SRake) and partial combining (called PRake) are considered. The theoretical and simulation results show that the BER performance of the UWB system can be enhanced as the number of array elements and/or Rake fingers increases. Moreover, we observe that SRake is more effective for the IR-UWB systems to achieve a good BER performance, as compared with PRake.

• Journal of Communications and Networks
• /
• v.18 no.4
• /
• pp.629-638
• /
• 2016

In this paper, we investigate an energy-efficient resource allocation problem in a two-way relay (TWR) network consisting of multiple user pairs and an amplify-and-forward (AF) relay. As the users and relay have individual energy efficiencies (EE), we formulate a multi-objective optimization problem (MOOP). A single-objective optimization problem (SOOP) of the MOOP is introduced using a weighted-sum method, which achieves a single Pareto optimal point of the MOOP. To derive the algorithm for the SOOP, we propose a more tractable equivalent problem using the Karush-Kuhn-Tucker conditions of the SOOP, which guarantees convergence at the local optimal points. The proposed equivalent problem can be efficiently solved by the proposed iterative algorithm. Numerical results demonstrate the effectiveness of the proposed algorithm in achieving the optimal EE in multi-user AF TWR networks.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.6
• /
• pp.1193-1198
• /
• 2012

In this paper, we design and implement A4 sized, web-based POP(Print On Demand) system using multi-layer technique. We Propose the framework of POP system, which uses multi-layer technique, uses highly accessible web-service, produces template, enables a user to easily edit, and allows the user to instantly print edited files. This system will be widely used in web-based electronic publication and e-book.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.703-704
• /
• 2008

Multi-agent technologies are essential in realizing the upcoming ubiquitous environment. In the multi-agent environment, each agent has its own set of services and stores these services in the service repository of the multi-agent system. By using this repository, the user can retrieve the most appropriate service. In this paper, we propose an efficient service repository architecture that can improve the existing agent-based service discovery.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.10 no.7
• /
• pp.1010-1021
• /
• 1999

In this paper, error performance of DS/CDMA GMSK system has been analyzed in a radio channel which is characterized by multi-user interference(MUI) and Nakagami fading. The DS/CDMA GMSK system adopts Maximum Ratio Combining(MRC) diversity and co-channel interference (CCI) to enhance system performance. Using the derived error probability equation, the error performance of DS/CDMA GMSK system has been evaluated and shown in figures to discuss as a function of PN code length(N), number of multi-user(K), number of diversity branch(L), and bit energy per noise power ratio ($E_b/N_0$), fading index(m). The results show that there is a substantial enhancement in performance by employing an MRC diversity or a CCI canceller. Additional improvement can be obtained when the MRC diversity and the CCI canceller are adopted in cascade form. Consequently, we expected that proposed system structure is reliable to the voice communication system in Nakagami fading, multi-user interferences and multipath channel.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.3
• /
• pp.190-198
• /
• 2013

Since the facilities for the remote users tend to be deployed in distributed manner, authentication schemes for multi-server communication settings, which provide various web services, are required for real-world applications. A typical way to authenticate a remote user relies on password authentication mostly. However, this method is vulnerable to attacks and inconvenient as the system requires users to maintain different identities and corresponding passwords. On the other hand, the user can make use of a single password for all servers, but she may be exposed to variants of malicious attacks. In this paper, we propose an efficient and secure authentication scheme based on a brokered authentication along with smart-cards in multi-server environment. Further we show that our scheme is secure against possible attacks and analyze its performance with respect to communication and computational cost.