• Title/Summary/Keyword: Optimal Network Design

Search Result 742, Processing Time 0.031 seconds

Design and Implementation of a Mobile Middleware System for Mobile Business (모바일 비즈니스를 위한 모바일 미들웨어 시스템 설계 및 구현)

  • Lee, Il-Joo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39B no.2
    • /
    • pp.102-113
    • /
    • 2014
  • Present communication and network environment have been moving rapidly toward wireless and mobile base from existing wired internet base. This change of trend influences greatly on business methods accordingly. Therefore many enterprises are trying hard to adopt mobile business in order to gain competitive edge of their products and they are in need of more effective and stable mobile solutions. However, the method of establishing optimal mobile computing environment and how to handle existing business process and use vast amount of database are still needed. Therefore this paper tries to realize a mobile middleware system as a mobile business establishment supporting tool that could link various computational resource on wired internet with wireless LAN, mobile phone network, and mobile devices. To accomplish that specific goal, this paper provides a powerful tool of mobile and wireless application data access that could expand the line of business already set up in general enterprises easily and rapidly into mobile environment. When this suggested solution is applied in the field of industry, it can economically change legacy business process into mobile environment without having to change existing logic and resources at all.

The Design of Regenerating Codes with a Varying Number of Helper Nodes (다양한 도움 노드의 수를 가지는 재생 부호의 설계)

  • Lee, Hyuk;Lee, Jungwoo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.12
    • /
    • pp.1684-1691
    • /
    • 2016
  • Erasure codes have recently been applied to distributed storage systems due to their high storage efficiency. Regenerating codes are a kind of erasure codes, which are optimal in terms of minimum repair bandwidth. An (n,k,d)-regenerating code consists of n storage nodes where a failed node can be recovered with the help of the exactly d numbers of surviving nodes. However, if node failures occur frequently or network connection is unstable, the number of helper nodes that a failed node can contact may be smaller than d. In such cases, regenerating codes cannot repair the failed nodes efficiently since the node repair process of the codes does not work when the number of helper nodes is less than d. In this paper, we propose an operating method of regenerating codes where a failed node can be repaired from ${\bar{d}}$ helper nodes where $$k{\leq_-}{\bar{d}}{\leq_-}d$$.

Load-balanced multi-agent model for moving patient management in mobile distribution environment (모바일 분산 환경에서 이동형 환자관리를 위한 부하 균형 다중 에이전트 모델)

  • Lee, Mal-Rye;Kim, Eun-Gyung;Zang, Yu-Peng;Lee, Jae-Wan
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.4
    • /
    • pp.809-816
    • /
    • 2010
  • This paper proposed about a load-balanced multi-agent model in mobile distribution environment to monitor moving patients and to deal with a situation of emergency. This model was designed to have a structure based on distribution framework by expanding a mobile system, and provides healthcare services based on real time situational information on moving patients. In order to overcome the limitation of middleware when we design system, we provided an abstract layer between applications and their base network infrastructure so that balance between QoS requests and network life can be maintained. In addition, clustering was used in cells for the efficient load distribution among multi-agents. By using Clustering FCM, we got optimal resources and had solve about transmission delay.

A study of 10GHz Slot Patch Antenna for Wireless Communication (무선 통신용 10GHz 대역 슬롯 패치 안테나 연구)

  • Park, Yong-Wook
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.16 no.4
    • /
    • pp.599-604
    • /
    • 2021
  • In the information age, internet was developed from the wired access to the wireless Internet access. When a surge in demand for wireless Internet access, efficiency and performance of 2.4 and 5GHz band which leads to saturation of the communication was significantly fall. In this paper, we studied the design and fabrication of slot patch antenna to be used in wireless communication systems operating at around 10GHz band. To obtain optimal antenna parameters such as patch size, inter patch space, sL, sW, feed L, feed w, slot patch antenna was simulated by HFSS(High Frequency Structure Simulator). From these parameters, slot and patch antenna is fabricated using FR-4 substrate of dielectric constant 4.4. The characteristics of fabricated antenna were analyzed by network analyzer. The fabricated slot patch antenna showed a center frequency as 10.23GHz, the minimum return loss as -32dB, and -10dB bandwidth as 420MHz respectively.

Game-Based Content Caching and Data Sponsor Scheme for the Content Network (콘텐츠 네트워크 환경에서 게임이론을 이용한 콘텐츠 캐싱 및 데이터 스폰서 기법)

  • Won, JoongSeop;Kim, SungWook
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.8 no.7
    • /
    • pp.167-176
    • /
    • 2019
  • Recently, as the types of services that can be enjoyed in mobile telecommunication networks such as social networks and video streaming are increasing, mobile users(MUs) can access mobile contents easily by consuming mobile data. However, under a mobile telecommunication environment, MUs have to pay a high data fee to a network service provider(SP) in order to enjoy contents. The 'data sponsor' technique, introduced as a way to solve this problem, has attracted attention as a breakthrough method for enhancing contents accessibility of MUs. In this paper, we propose an algorithm that determines the optimal discount rate through the Stackelberg game in the data sponsor environment. We also propose an algorithm to design edge caching, which caches highly popular content for MUs on edge server, through many-to-many matching game. Simulation results clearly indicate that the profit for CP's content consumption is improved by about 6~11%, and the profit of CP according to the ratio of edge caching is improved by about 12% than the other existing schemes under data sponsor environment.

A Distributed Scheduling Algorithm based on Deep Reinforcement Learning for Device-to-Device communication networks (단말간 직접 통신 네트워크를 위한 심층 강화학습 기반 분산적 스케쥴링 알고리즘)

  • Jeong, Moo-Woong;Kim, Lyun Woo;Ban, Tae-Won
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.24 no.11
    • /
    • pp.1500-1506
    • /
    • 2020
  • In this paper, we study a scheduling problem based on reinforcement learning for overlay device-to-device (D2D) communication networks. Even though various technologies for D2D communication networks using Q-learning, which is one of reinforcement learning models, have been studied, Q-learning causes a tremendous complexity as the number of states and actions increases. In order to solve this problem, D2D communication technologies based on Deep Q Network (DQN) have been studied. In this paper, we thus design a DQN model by considering the characteristics of wireless communication systems, and propose a distributed scheduling scheme based on the DQN model that can reduce feedback and signaling overhead. The proposed model trains all parameters in a centralized manner, and transfers the final trained parameters to all mobiles. All mobiles individually determine their actions by using the transferred parameters. We analyze the performance of the proposed scheme by computer simulation and compare it with optimal scheme, opportunistic selection scheme and full transmission scheme.

Introducing Smart Learning Framework in the Digital World: Towards the Enhancement of Technology-Driven Innovation of Arabic Smart Learning

  • Alkhammash, Eman H.
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.11
    • /
    • pp.331-337
    • /
    • 2022
  • Smart learning is augmented with digital, context-aware, and adaptable technologies to encourage students to learn better and faster. To ensure that digital learning is successful and that implementation is efficient, it is critical that the dimensions of digital learning are arranged correctly and that interactions between the various elements are merged in an efficient and optimal manner. This paper builds and discusses a basic framework for smart learning in the digital age, aimed to improve students' abilities and performance in learning. The proposed framework consists of five dimensions: Teacher, Technology, Learner, Digital content, and Evaluation. The Teacher and Learner dimensions operate on two levels: (a) an abstract level to fit in knowledge and skills or interpersonal characteristics and (b) a concrete level in the form of digital devices used by teachers and learners. Moreover, this paper proposes asynchronous online course delivery model. An Arabic smart learning platform has been developed, based on these smart learning core dimensions and the asynchronous online course delivery model, because despite the official status of this language in many countries, there is a lack of Arabic platforms to teach Arabic. Moreover, many non-native Arabic speakers around the world have expressed an interest in learning it. The Arabic digital platform consists of over 70 lessons classified into three competence levels: beginner, intermediate, and advanced, delivered by Arabic experts and Arabic linguists from various Arab countries. The five dimensions are described for the Arabic platform in this paper. Learner dimension is the Arabic and non-Arabic speakers, Teacher dimension is Arabic experts and Arabic linguistics, Technology dimension consists of technology for Arabic platform that includes web design, cloud computing, big data, etc. The digital contents dimension consists of web-based video, records, etc. The evaluation dimension consists of Teachers rating, comments, and surveys.

A Study on CFD Result Analysis of Mist-CVD using Artificial Intelligence Method (인공지능기법을 이용한 초음파분무화학기상증착의 유동해석 결과분석에 관한 연구)

  • Joohwan Ha;Seokyoon Shin;Junyoung Kim;Changwoo Byun
    • Journal of the Semiconductor & Display Technology
    • /
    • v.22 no.1
    • /
    • pp.134-138
    • /
    • 2023
  • This study focuses on the analysis of the results of computational fluid dynamics simulations of mist-chemical vapor deposition for the growth of an epitaxial wafer in power semiconductor technology using artificial intelligence techniques. The conventional approach of predicting the uniformity of the deposited layer using computational fluid dynamics and design of experimental takes considerable time. To overcome this, artificial intelligence method, which is widely used for optimization, automation, and prediction in various fields, was utilized to analyze the computational fluid dynamics simulation results. The computational fluid dynamics simulation results were analyzed using a supervised deep neural network model for regression analysis. The predicted results were evaluated quantitatively using Euclidean distance calculations. And the Bayesian optimization was used to derive the optimal condition, which results obtained through deep neural network training showed a discrepancy of approximately 4% when compared to the results obtained through computational fluid dynamics analysis. resulted in an increase of 146.2% compared to the previous computational fluid dynamics simulation results. These results are expected to have practical applications in various fields.

  • PDF

Path Loss Prediction Using an Ensemble Learning Approach

  • Beom Kwon;Eonsu Noh
    • Journal of the Korea Society of Computer and Information
    • /
    • v.29 no.2
    • /
    • pp.1-12
    • /
    • 2024
  • Predicting path loss is one of the important factors for wireless network design, such as selecting the installation location of base stations in cellular networks. In the past, path loss values were measured through numerous field tests to determine the optimal installation location of the base station, which has the disadvantage of taking a lot of time to measure. To solve this problem, in this study, we propose a path loss prediction method based on machine learning (ML). In particular, an ensemble learning approach is applied to improve the path loss prediction performance. Bootstrap dataset was utilized to obtain models with different hyperparameter configurations, and the final model was built by ensembling these models. We evaluated and compared the performance of the proposed ensemble-based path loss prediction method with various ML-based methods using publicly available path loss datasets. The experimental results show that the proposed method outperforms the existing methods and can predict the path loss values accurately.

A new meta-heuristic optimization algorithm using star graph

  • Gharebaghi, Saeed Asil;Kaveh, Ali;Ardalan Asl, Mohammad
    • Smart Structures and Systems
    • /
    • v.20 no.1
    • /
    • pp.99-114
    • /
    • 2017
  • In cognitive science, it is illustrated how the collective opinions of a group of individuals answers to questions involving quantity estimation. One example of this approach is introduced in this article as Star Graph (SG) algorithm. This graph describes the details of communication among individuals to share their information and make a new decision. A new labyrinthine network of neighbors is defined in the decision-making process of the algorithm. In order to prevent getting trapped in local optima, the neighboring networks are regenerated in each iteration of the algorithm. In this algorithm, the normal distribution is utilized for a group of agents with the best results (guidance group) to replace the existing infeasible solutions. Here, some new functions are introduced to provide a high convergence for the method. These functions not only increase the local and global search capabilities but also require less computational effort. Various benchmark functions and engineering problems are examined and the results are compared with those of some other algorithms to show the capability and performance of the presented method.