• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.3_4
• /
• pp.130-137
• /
• 2003

This paper presents the problem of partitioning the Single-Stage Shuffle-Exchange Network(SSEN). An algorithm, named SSEN_to_PSEN, is devised to transform an SSEN into a Partitionable Shuffle-Exchange Network (PSEN). The proposed algorithm presents that the SSEN can be partitioned into independent sub-networks without additional links for N $\leq$ 8. Additional links are needed in order to partition an SSEN, but only when N $\geq$ 16. The running time of the algorithm SSEN_to_PSEN is $\theta$(NlogN). By comparing with a hypercube network, the PSEN is less expensive than a hypercube network even when some additional links are added. By partitioning, a large PSEN in a massively parallel machine can compute various problems for multiple users simultaneously, thereby the processing efficiency of the machine is improved.

• Journal of Energy Engineering
• /
• v.26 no.3
• /
• pp.123-130
• /
• 2017

The district heating system has been successfully implemented with higher efficiency levels of energy production and reduction of carbon emissions during heat generation. Traditionally the system consisted of small number of production and demand sites, but, recently it has evolved into a network with large number of sites interconnected each other. By connecting multiple sites into a network, heat from low-cost production sites can be supplied to distant demand sites so as to lower the total operation cost. In this study, we simulate and analyze distict heating networks focused on critical links. a critical link is defined as a link in which capacity is fully utilized. If a newtork has critical links, then those cricial links become bottlenecks and it is difficult to improve the overall network efficiency.

• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.480-483
• /
• 1997

A fossil power plant can be modeled by a lot of algebraic equations and differential equations. When we simulate a large, complicated fossil power plant by a computer such as workstation or PC, it takes much time until overall equations are completely calculated. Therefore, new processing systems which have high computing speed is ultimately needed to develope real-time simulators. Vital points of real-time simulators are accuracy, computing speed, and deadline observing. In this paper, we present a enhanced strategy in which we can provide powerful computing power by parallel processing of DSP processors with communication links. We designed general purpose DSP modules, and a VME interface module. Because the DSP module is designed for general purpose, we can easily expand the parallel system by just connecting new DSP modules to the system. Additionally we propose methods about downloading programs, initial data to each DSP module via VME bus, DPRAM and processing sequences about computing and updating values between DSP modules and CPU30 board when the simulator is working.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.05a
• /
• pp.1310-1312
• /
• 2007

Throughput improvement problem in wireless mesh network can be alleviated by equipped mesh router with multiple radios tuned into orthogonal channels. However, some links on the same channel also can be activated concurrently if the Signal-to-Noise and Interference Ratio (SNIR) at their receiver endpoints is not lower than the threshold. We propose a greedy algorithm to investigate the problem of how to schedule a set of feasible transmission under physical interference model by using the spatial time-division multiple-access (STDMA) scheme. We also consider the fairness in scheduling to prevent some border nodes from starvation. We evaluate our algorithms through extensive simulation and the results show that our algorithms can achieve better aggregate throughput and fairness performance than 802.11 standard.

• 제어로봇시스템학회:학술대회논문집
• /
• 1993.10a
• /
• pp.82-87
• /
• 1993

A supervisory controller design technique for multiple-AGV systems is presented in this paper. The guidepath is represented in the form of a network, and its modifications are easily tested. The network has two-layered structure, where the path sets between each two nodes are made in advance using the K-shortest path algorithm. Occupation times for all links are stored in link-occupation table, and are updated after the dispatching time. Dispatching and scheduling for each AGV are optimized in terms of minimum-time objectives. In all times, the paths are guaranteed to be conflict-free and deadlock-free. The simplicity and flexibility on this control scheme make the supervisory suitable for real applications.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.34C no.5
• /
• pp.19-32
• /
• 1997

So far, the multiple path MINs to provide redundant paths in the traditional UPP MINs have been realized by adding additional hardware such as extra stages, duplicated data links, or multiple copies of sthe MIN. And the traditional MINs do not exploit locality: communication with all processor-memory paris takes the same amount of time. Also so far there has been little progress for exploiting locality of reference in MINs. In this paper, we present a new topology MIN, hybrid MIN that is constructed with 2N-3 SEs which is far fewer SEs than that of traditional MINs. Although the hybrid MIN is constructed with 2N-3 SEs, the hybrid MIN satisfies full access capability (FAC) and has redundant paths(but providing single path for 2 memory modules of each processor). Moreover the has redundant paths (but providing single path for 2 memory modules of each processor). Moreover the Hybrid MIN provides shortcut path between pairs which have frequent dat acommunication (locality of reference). Its performance under varing degrees of localized communication is analyzed.

• Journal of the Institute of Convergence Signal Processing
• /
• v.2 no.1
• /
• pp.71-79
• /
• 2001

ATM networks with long-distance links, causing long propagation delays, may require virtual end system functions to provide ABR services. We survey several issues for implementing the control functions for ABR service in multiple VCs, required in the virtual ends, and propose a structure for implementation. In the proposed design, shared memory structure is used to control the cell emission of the multiple VCs for the ABR services in the virtual end systems.

• Journal of the Korean Society for Aviation and Aeronautics
• /
• v.20 no.3
• /
• pp.22-27
• /
• 2012

In oceanic flight routes, HF radio and satellite data links have been used for air-to-ground communication, but these systems have long propagation delay and low data throughput. In this paper, we propose a reliable system to overcome the weakness of current HF radio and satellite communication systems for oceanic aeronautical flight routes. The proposed scheme uses only one aeronautical VHF channel in multi-hop oceanic communication environments and supports a hybrid type of multiple access, which consists of random access and TDMA (Time Division Multiple Access) scheme. The proposed system improves performance on delay and throughput as an effective solution to communicate end-to-end on the oceanic flight routes and strengthens the reliability of oceanic aeronautical communication.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.5
• /
• pp.1944-1956
• /
• 2021

This paper considers a cellular two-way relay network with one base station (BS), one relay station (RS), and two users. The two users are far from the BS and no direct links exist, and the two users exchange messages with the BS via the RS. A non-orthogonal multiple access (NOMA) and network coding (NC)-based decode-and-forward (DF) two-way relaying (TWR) scheme TWR-NOMA-NC is proposed, which is able to reduce the number of channel-uses to three from four in conventional time-division multiple access (TDMA) based TWR approaches. The achievable sum-rate performance of the proposed approach is analyzed, and a closed-form expression for the sum-rate upper bound is derived. Numerical results show that the analytical sum-rate upper bound is tight, and the proposed TWR-NOMA-NC scheme significantly outperforms the TDMA-based TWR and NOMA-based one-way relaying counterparts.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.9A
• /
• pp.844-855
• /
• 2006

The communication system using multiple antennas improves link reliability or system capacity using tx & rx diversity, spatial multiplexing, and beamforming technique with services and characteristics of channel environment. This system is sensitive to spatial channel environment. In case of diversity, the lower correlation among links as a LoS environment, the better performance is acquired. In practical channel environment, However, there is high correlation, and there is high performance difference between ideal case and practical case. On the contrary, in case of beamforming, the higher correlation among links, the better performance is acquired. If we use the spatial adaptive transmission technique with spatial channel characteristics, we can get the system that maintains minimum link reliability and guarantees the overall system performance. In this paper, we propose the adaptive transmission and reception technique which use diversity or beamforming technique with channel characteristics.