• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.27 no.4
• /
• pp.8-15
• /
• 2013

This paper proposes a DC-link voltage variation compensation method for a 3-level single phase converter for high-speed trains. Since 3-level NPC(Neutral Point Clamped) type converters have the split DC-link causing the inherent problem of voltage fluctuations in the upper and lower capacitors, reducing the voltage difference between the top and bottom capacitors is required. In this paper, compensation time proportional to the voltage difference is added to PWM switching time to solve the voltage variation. The compensation time is obtained by a PI controller. Simulation results demonstrate the validity of the proposed method.

• Proceedings of the KIPE Conference
• /
• 2004.07a
• /
• pp.6-10
• /
• 2004

This paper newly proposes the SRM drive system based on DC-link current information, from which the phase currents can be estimated in accuracy and also they can be used in driving SRM instead of the phase currents. Comparing to the general drive system based on the phase current information, it is verified through the simulation(which are peformed by RMxprt and Simplorer) that the proposed SRM drive system has the good performance in dynamic and steady-state responses of the speed control. Using the DC-link current information, all of the multi-phase currents can be easily estimated in driving the SRM.

• Korean Journal of Mathematics
• /
• v.20 no.4
• /
• pp.403-414
• /
• 2012

A voltage assignment on a graph was used to enumerate all possible 2-cell embeddings of a graph onto surfaces. The boundary of the surface which is obtained from 0 voltage on every edges of a very special diagram of a complete bipartite graph $K_{m,n}$ is surprisingly the ($m,n$) torus link. In the present article, we prove that every link is the boundary of a complete bipartite multi-graph $K_{m,n}$ for which voltage assignments are either -1 or 1 and that every link is the boundary of a complete bipartite graph $K_{2,n}$ for which voltage assignments are either -1, 0 or 1 where edges in the diagram of graphs may be linked but not knotted.

• Proceedings of the KIPE Conference
• /
• 2003.07b
• /
• pp.560-564
• /
• 2003

This paper proposes a simple control strategy based on the discontinuous PWM(DPWM) to balance the DC-link voltage of three-level Neutral-Point-Clamped(WPC) inverters at low modulation index. New DPWM methods in multi-level inverter are also introduced. The proposed DPWM method changes the path and duration to flow the neutral point current out of or into neutral point of the DC-link and it makes the overall fluctuation of the DC-link voltage zero during a sampling time of reference voltage vector. Therefore, the voltage of the DC-link can be balanced fairly well and also the voltage ripple of the DC-link is reduced significantly. Moreover, comparing with conventional methods, the proposed strategy is very simple. The validity of the proposed DPWM method is verified by experiment

• Journal of Electrical Engineering and Technology
• /
• v.8 no.4
• /
• pp.889-898
• /
• 2013

The shortest-path searching algorithm must not only find a global solution to the destination, but also solve a turn penalty problem (TPP) in an urban road transportation network (URTN). Although the Dijkstra algorithm (DA) as a representative node-based algorithm secures a global solution to the shortest path search (SPS) in the URTN by visiting all the possible paths to the destination, the DA does not solve the TPP and the slow execution speed problem (SEP) because it must search for the temporary minimum cost node. Potts and Oliver solved the TPP by modifying the visiting unit from a node to the link type of a tree-building algorithm like the DA. The Multi Tree Building Algorithm (MTBA), classified as a representative Link Based Algorithm (LBA), does not extricate the SEP because the MTBA must search many of the origin and destination links as well as the candidate links in order to find the SPS. In this paper, we propose a new Link-Based Single Tree Building Algorithm in order to reduce the SEP of the MTBA by applying the breaking rule to the LBA and also prove its usefulness by comparing the proposed with other algorithms such as the node-based DA and the link-based MTBA for the error rates and execution speeds.

• The KIPS Transactions:PartA
• /
• v.8A no.2
• /
• pp.157-166
• /
• 2001

A simulation package has been developed as an event-driven system that can handle the hardware configuration of STC104 and algorithm proposed in the sister paper of ‘Study on High Speed Routers(II).’After various STC104 topology of meshes, torus, and hypercubes are constructed using up to 512 switches, the performance of each topology has been analyzed under different message generation rate in terms of throughputs, latency, and packet blocking time. Modified multicast algorithms for STC104 have been proposed for STC104 after U-mesh and U-torus in order to overcome the multicasting difficulty because of the point-to-point communication method found in STC104. The performance of the multicast algorithms have been analyzed over meshes and torus configuration. Throughput gets higher in the order of mesh, torus, and hypercube. Throughput difference among topology were distinctive in the zone of high message generation rate. Latency and blocking time increased in the order of hypercube, torus, and mesh. U-mesh and U-torus of software multicast showed similar throughput, however, U-mesh peformed slightly better result. These algorithms showed eight to ten times better results compared to individual message pass for 90 destination nodes. Multi-link environment also showed better performance than single-link environment because multi-link network used the extra links for communication.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.1
• /
• pp.193-214
• /
• 2017

In this paper, we study the problem of network utility maximization in a CSMA based multi-hop wireless network. Existing work in this aspect typically adopted continuous time Markov model for performance modelling, which fails to consider the channel conflict impact in actual CSMA networks. To maximize the utility of a CSMA based wireless network with channel conflict, in this paper, we first model its weighted network capacity (i.e., network capacity weighted by link queue length) and then propose a distributed link scheduling algorithm, called CSMA based Maximal-Weight Scheduling (C-MWS), to maximize the weighted network capacity. We derive the upper and lower bounds of network utility based on C-MWS. The derived bounds can help us to tune the C-MWS parameters for C-MWS to work in a distributed wireless network. Simulation results show that the joint optimization based on C-MWS can achieve near-optimal network utility when appropriate algorithm parameters are chosen and also show that the derived utility upper bound is very tight.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.10C
• /
• pp.929-936
• /
• 2009

In this paper, we consider designing a multi-input multi-output (MIMO) overlay system for fixed MIMO wireless link, where a frequency flat narrowband channel is shared by multiple transmitter and receiver pairs. Assuming the perfect knowledge of the second-order statistics of the received legacy signals and the composite channels from the overlay transmitter to the legacy receivers, the jointly optimal linear precoder and decoder matrices of the MIMO overlay system is derived to minimize the total mean squared error (MSE) of the data symbol vector, subject to total average transmission power and zero interference induced to legacy MIMO systems already existing in the frequency band of interest. Furthermore, the necessary and sufficient condition for the existence of the optimal solution is also derived.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.4
• /
• pp.2223-2242
• /
• 2019

Distance Vector-Hop (DV-Hop) algorithm is widely used in node localization. It often suffers the wormhole attack. The current researches focus on Double-Wormhole-Node-Link (DWNL) and have limited attention to Multi-Wormhole-Node-Link (MWNL). In this paper, we propose a security DV-Hop algorithm (AMLDV-Hop) to resist MWNL. Firstly, the algorithm establishes the Neighbor List (NL) in initialization phase. It uses the NL to find the suspect beacon nodes and then find the actually attacked beacon nodes by calculating the distances to other beacon nodes. The attacked beacon nodes generate and broadcast the conflict sets to distinguish the different wormhole areas. The unknown nodes take the marked beacon nodes as references and mark themselves with different numbers in the first-round marking. If the unknown nodes fail to mark themselves, they will take the marked unknown nodes as references to mark themselves in the second-round marking. The unknown nodes that still fail to be marked are semi-isolated. The results indicate that the localization error of proposed AMLDV-Hop algorithm has 112.3%, 10.2%, 41.7%, 6.9% reduction compared to the attacked DV-Hop algorithm, the Label-based DV-Hop (LBDV-Hop), the Secure Neighbor Discovery Based DV-Hop (NDDV-Hop), and the Against Wormhole DV-Hop (AWDV-Hop) algorithm.

• ETRI Journal
• /
• v.35 no.5
• /
• pp.919-922
• /
• 2013

A MIMO multi-way relay channel with full data exchange in which K users exchange messages with each other via the help of a single relay is considered. For the case in which each link is quasi-static Rayleigh fading and the relay is full-duplex, the fundamental diversity-multiplexing tradeoff (DMT) is investigated, and we show that a compress-and-forward relay protocol can achieve the optimal DMT.