• Title/Summary/Keyword: Network Operation

Search Result 3,341, Processing Time 0.033 seconds

A Session Key Exchange Scheme for Secure Vehicle Communication in V2I-based VANET Environments (V2I 기반의 VANET 환경에서 안전한 차량 통신을 위한 세션 키 교환 기법)

  • Ryu, Seung-Ho;Jung, Sou-Hwan
    • Journal of KIISE:Information Networking
    • /
    • v.35 no.4
    • /
    • pp.311-317
    • /
    • 2008
  • This paper proposes a session key exchange scheme for providing secure communication between Vehicles and Infrastructure in VANET. In the current VANET environment, IEEE 802.11i or PKI based mechanism is used to provide secure communication between V2I. However, since the vehicles and the frequent changes of network topology, VANET nodes have some difficulties to exchange the session key using IEEE 802.11i or PKI method. In the proposed scheme, Local Router is newly defined for exchanging the session key between moving vehicles and infrastructure. A session key is generated by XOR operation based on the random values between Local Router and OBU. As a result, the proposed scheme has a noticeable advantage on the fastness of key exchange by exchanging session keys between LR and OBU.

Design of Fault Diagnostic and Fault Tolerant System for Induction Motors with Redundant Controller Area Network

  • Hong, Won-Pyo;Yoon, Chung-Sup;Kim, Dong-Hwa
    • Proceedings of the Korean Institute of IIIuminating and Electrical Installation Engineers Conference
    • /
    • 2004.11a
    • /
    • pp.371-374
    • /
    • 2004
  • Induction motors are a critical component of many industrial processes and are frequently integrated in commercially available equipment. Safety, reliability, efficiency, and performance are some of the major concerns of induction motor applications. Preventive maintenance of induction motors has been a topic great interest to industry because of their wide range application of industry. Since the use of mechanical sensors, such as vibration probes, strain gauges, and accelerometers is often impractical, the motor current signature analysis (MACA) techniques have gained murk popularity as diagnostic tool. Fault tolerant control (FTC) strives to make the system stable and retain acceptable performance under the system faults. All present FTC method can be classified into two groups. The first group is based on fault detection and diagnostics (FDD). The second group is independent of FDD and includes methods such as integrity control, reliable stabilization and simultaneous stabilization. This paper presents the fundamental FDD-based FTC methods, which are capable of on-line detection and diagnose of the induction motors. Therefore, our group has developed the embedded distributed fault tolerant and fault diagnosis system for industrial motor. This paper presents its architecture. These mechanisms are based on two 32-bit DSPs and each TMS320F2407 DSP module is checking stator current, voltage, temperatures, vibration and speed of the motor. The DSPs share information from each sensor or DSP through DPRAM with hardware implemented semaphore. And it communicates the motor status through field bus (CAN, RS485). From the designed system, we get primitive sensors data for the case of normal condition and two abnormal conditions of 3 phase induction motor control system is implemented. This paper is the first step to drive multi-motors with serial communication which can satisfy the real time operation using CAN protocol.

  • PDF

Bitcoin Mining Profitability Model and Analysis (비트코인 채굴 수익성 모델 및 분석)

  • Lee, Jinwoo;Cho, Kookrae;Yum, Dae Hyun
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.28 no.2
    • /
    • pp.303-310
    • /
    • 2018
  • Bitcoin (BTC) is a cryptocurrency proposed by Satoshi Nakamoto in 2009. Bitcoin makes its transactions with no central authorities. This decentralization is accomplished with its mining, which is an operation that makes people compete to solve math puzzles to include new transactions into block, and eventually block chains (ledger) of bitcoin. Because miners need to solve a complex puzzles, they need a lot of computing resources. In return for miners' resources, bitcoin network gives newly minted bitcoins as a reward to miners when they succeed in mining. To prevent inflation, the reward is halved every 4 years. For example, in 2009 block reward was 50 BTC, but today, the block reward is 12.5 BTC. On the other hands, exchange rate for bitcoin and Korean Won (KRW) changed drastically from 924,000 KRW/BTC (January 12th, 2017) to 16,103,306 KRW/BTC (December 10th, 2017), which made mining more attractive. However, there are no rigorous researches on the profitability of bitcoin mining. In this paper, we evaluate the profitability of bitcoin mining.

MLP Design Method Optimized for Hidden Neurons on FPGA (FPGA 상에서 은닉층 뉴런에 최적화된 MLP의 설계 방법)

  • Kyoung Dong-Wuk;Jung Kee-Chul
    • The KIPS Transactions:PartB
    • /
    • v.13B no.4 s.107
    • /
    • pp.429-438
    • /
    • 2006
  • Neural Networks(NNs) are applied for solving a wide variety of nonlinear problems in several areas, such as image processing, pattern recognition etc. Although NN can be simulated by using software, many potential NN applications required real-time processing. Thus they need to be implemented as hardware. The hardware implementation of multi-layer perceptrons(MLPs) in several kind of NNs usually uses a fixed-point arithmetic due to a simple logic operation and a shorter processing time compared to the floating-point arithmetic. However, the fixed-point arithmetic-based MLP has a drawback which is not able to apply the MLP software that use floating-point arithmetic. We propose a design method for MLPs which has the floating-point arithmetic-based fully-pipelining architecture. It has a processing speed that is proportional to the number of the hidden nodes. The number of input and output nodes of MLPs are generally constrained by given problems, but the number of hidden nodes can be optimized by user experiences. Thus our design method is using optimized number of hidden nodes in order to improve the processing speed, especially in field of a repeated processing such as image processing, pattern recognition, etc.

PC Cluster Based Parallel Genetic Algorithm-Tabu Search for Service Restoration of Distribution Systems (PC 클러스터 기반 병렬 유전 알고리즘-타부 탐색을 이용한 배전계통 고장 복구)

  • Mun Kyeong-Jun;Lee Hwa-Seok;Park June Ho
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.54 no.8
    • /
    • pp.375-387
    • /
    • 2005
  • This paper presents an application of parallel Genetic Algorithm-Tabu Search (GA-TS) algorithm to search an optimal solution of a service restoration in distribution systems. The main objective of service restoration of distribution systems is, when a fault or overload occurs, to restore as much load as possible by transferring the do-energized load in the out of service area via network reconfiguration to the appropriate adjacent feeders at minimum operational cost without violating operating constraints, which is a combinatorial optimization problem. This problem has many constraints with many local minima to solve the optimal switch position. This paper develops parallel GA-TS algorithm for service restoration of distribution systems. In parallel GA-TS, GA operators are executed for each processor. To prevent solutions of low fitness from appearing in the next generation, strings below the average fitness are saved in the tabu list. If best fitness of the GA is not changed for several generations, TS operators are executed for the upper $10\%$ of the population to enhance the local searching capabilities. With migration operation, best string of each node is transferred to the neighboring node after predetermined iterations are executed. For parallel computing, we developed a PC cluster system consists of 8 PCs. Each PC employs the 2 GHz Pentium IV CPU and is connected with others through ethernet switch based fast ethernet. To show the validity of the proposed method, proposed algorithm has been tested with a practical distribution system in Korea. From the simulation results, we can find that the proposed algorithm is efficient for the distribution system service restoration in terms of the solution quality, speedup, efficiency and computation time.

Design and Implementation of Object Reusing Methods for Mobile Vector Map Services (모바일 벡터 지도 서비스를 위한 객체 재사용 기법의 설계 및 구현)

  • Kim, Jin-Deog;Choi, Jin-Oh
    • The KIPS Transactions:PartD
    • /
    • v.10D no.3
    • /
    • pp.359-366
    • /
    • 2003
  • Although the reuse of the cached data for scrolling the map reduces the amount of passed data between client and server, it needs the conversions of data coordinates, selective deletion of objects, cache compaction and object structuring step in the clients. The conversion is a time- intensive operation due to limited resources of mobile phones such as low computing power, small memory. Therefore, in order to control the map efficiently in the vector map service based mobile phones, it is necessary to study the methods which reuse cached objects for reducing wireless network bandwidth and overwhelming the limited resources of mobile phones as well. This paper proposes the methods of reusing pre-received spatial objects for map control in the mobile vector map service system based on client-server architecture. The experiments conducted on the Web GIS systems with real data show that the proposed method is appropriate to map services for mobile phone. We also analyze the advantages and drawbacks between the reuse of cached data and transmission of raw data respectively.

Performance Evaluation of Scheduling Algorithms according to Communication Cost in the Grid System of Co-allocation Environment (Co-allocation 환경의 그리드 시스템에서 통신비용에 따른 스케줄링 알고리즘의 성능 분석)

  • Kang, Oh-Han;Kang, Sang-Seong;Kim, Jin-Suk
    • The KIPS Transactions:PartA
    • /
    • v.14A no.2
    • /
    • pp.99-106
    • /
    • 2007
  • Grid computing, a mechanism which uses heterogeneous systems that are geographically distributed, draws attention as a new paradigm for the next generation operation of parallel and distributed computing. The importance of grid computing concerning communication cost is very huge because grid computing furnishes uses with integrated virtual computing service, in which a number of computer systems are connected by a high-speed network. Therefore, to reduce the execution time, the scheduling algorithm in grid environment should take communication cost into consideration as well as computing ability of resources. However, most scheduling algorithms have not only ignored the communication cost by assuming that all tasks were dealt in one cluster, but also did not consider the overhead of communication cost when the tasks were processed in a number of clusters. In this paper, the functions of original scheduling algorithms are analyzed. More importantly, the functions of algorithms are compared and analyzed with consideration of communication cost within the co allocation environment, in which a task is performed separately in many clusters.

Design of High Speed Modular Exponentiation Operation Method for RSA Algorithm (RSA 알고리즘 부하 경감을 위한 고속 모듈러 멱승 연산 알고리즘 설계)

  • Kim, Kap-Yol;Lee, Chul-Soo;Park, Seok-Cheon
    • The KIPS Transactions:PartC
    • /
    • v.15C no.6
    • /
    • pp.507-512
    • /
    • 2008
  • At a recent, enterprises based on online-service are established because of rapid growth of information network. These enterprises collect personal information and do customer management. If customers use a paid service, company send billing information to customer and customer pay it. Such circulation and management of information is big issue but most companies don't care of information security. Actually, personal information that was managed by largest internal open-market was exposed. For safe customer information management, this paper proposes the method that decrease load of RSA cryptography algorithm that is commonly used for preventing from illegal attack or hacking. The method for decreasing load was designed by Binary NAF Method and it can operates modular Exponentiation rapidly. We implemented modular Exponentiation algorithm using existing Binary Method and Windows Method and compared and evaluated it.

A Study of Parallel Operation of Module Power using CAN Communication (CAN통신을 이용한 모듈전원의 병렬운전에 관한 연구)

  • Park, Seong-Mi;Lee, Sang-Hyeok;Park, Sung-Jun;Lee, Bae-Ho
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.12 no.8
    • /
    • pp.3603-3609
    • /
    • 2011
  • In this paper, we proposes new load-sharing algorism for equal current division using CAN communication. Proposed algorithm is different from conventional analog method, it performed strong Load-sharing using bi-direction high speed communication. Each modules constitution on independence controller (voltage controller, electric current controller). In parallel system prototype, each module have controller and performed load-sharing according to master module integral value. Also additional controller use for getting each module situations that fault situation of module and fault locate of module. we implemented high efficient load-sharing and redundancy. In this paper, we verify the validity of proposed algorithm using PSIM program and prototype.

U-Bus Advertisement Business Model and System Implementation based on Wireless Networks (무선망 기반의 U-버스광고 비즈니스 모델 및 시스템 구축 방안)

  • Roh, Su-Sung;Kim, Do-Nyun
    • The Journal of the Korea Contents Association
    • /
    • v.10 no.7
    • /
    • pp.88-97
    • /
    • 2010
  • Recently the more convenient services are provided to people in the city in line with the change of city paradigm and the recent development of ubiquitous. For example, Information on bus arrivals an effective advertisement the combination of high technology and departures through smart-phones. However, in respect of the mobile advertisement, because of difficulties such as the means of transferring the mass storage data or the burden of communication charges. there need means to improve such difficulties. This study has been conducted aiming to overcome such difficulties. This study suggests the strategic differentiation plan through the analysis of the media characteristics such as real time service information when in traveling, U-Bus business model in the category of mobile advertisement, etc. and also the concrete system establishment plan from the operation center via network to the delivery of the advertisement through vehicle terminals. In respect that this study suggests the implications as a practical business model through the fusion of high technology and diverse media. It has great significance.