• Journal of Satellite, Information and Communications
• /
• v.5 no.1
• /
• pp.32-37
• /
• 2010

The algorithm of multiple channel signal processing requires the flexibility of variable frequency band, efficient allocation of transmission power, and flexible frequency band reallocation to satisfy various service types which requires different transmission rates and frequency band. There are three methods including per-channel approach, multiple tree approach, and block approach performing frequency band reallocation method by channelization and dechannelization in the multiple-channel signal. This paper proposes an improved per-channel approach for converting the frequency band of multiple carrier signals efficiently. The proposed algorithm performs decimation and interpolation using CIC(cascaded integrator comb filter), half-band filter, and FIR filter. In addition, it performs filtering of each sub-channel, and reallocates channel band through FIR low-pass filter in the multiple-channel signal. The computer simulation result shows that the perfect reconstruction of output signal and the flexible frequency band reallocation is performed efficiently by the proposed algorithm.

• Journal of Satellite, Information and Communications
• /
• v.7 no.2
• /
• pp.97-103
• /
• 2012

A very low complexity QRD-M algorithm based on limited search area is proposed for MIMO systems. The conventional QRD-M algorithm calculates Euclidean distance between all constellation symbols and the temporary detection symbol at each layer. We found that performance will not be degraded even if we adaptively restrict the search area of the candidate symbols only to the neighboring points of temporary detection symbol according to the channel condition at each layer. As a channel condition indicator, we employ the channel gain ratio among the layers without necessity of SNR estimation. The simulation results show that the proposed scheme effectively achieves near optimal performance while maintaining the overall average computation complexity much smaller than the conventional QRD-M algorithm.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.66 no.1
• /
• pp.89-99
• /
• 2017

Many works have attempted to solve the scalability, the availability, and the low-latency problems of peer-to-peer (P2P) live video streaming; yet, the problems still remain. While tree-based systems are vulnerable to churn, the mesh-based systems suffer from high delay and overhead. The DHT-aided chunk-driven overlay (DCO) [1] tried to tackle these problems by using the distributed hash table (DHT), which structures into a mesh-based overlay to efficiently share the video segment. However, DCO fully depends on the capacity of the users' device which is small and unstable, i.e., the users' device may leave and join the network anytime, and the video server's bandwidth can be insufficient when the number of users joining the network suddenly increases. Therefore, cloud assist is introduced to overcome those problems. Cloud assist can be used to enhance the availability, the low-latency, and the scalability of the system. In this paper, the DHT is used to maintain the location of the streaming segments in a distributed manner, and the cloud server is used to assist other peers when the bandwidth which required for sharing the video segment is insufficient. The simulation results show that by using the threshold and cloud assist, the availability and the low-latency of the video segments, and the scalability of the network are greatly improved.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.11
• /
• pp.2187-2192
• /
• 2016

A data-centric routing protocol considering a data aggregation technique at relay nodes is required to increase the lifetime of wireless sensor networks. An energy-efficient data-centric routing algorithm is proposed by considering a tradeoff between acquisition time and energy consumption in the wireless sensor network. First, the proposed routing scheme decides the sink node among all sensor nodes in order to minimize the maximum distance between them. Then, the proposed routing extends its tree structure in a way to minimize the link cost between the connected nodes for reducing energy consumption while minimizing the maximum distance between sensor nodes and a sink node for rapid information gathering. Simulation results show that the proposed data-centric routing algorithm has short information acquisition time and low energy consumption; thus, it achieves high energy efficiency in the wireless sensor network compared to conventional routing algorithms.

• Journal of KIISE:Information Networking
• /
• v.30 no.5
• /
• pp.595-603
• /
• 2003

To provide mobile nodes with continuous communication services, it is important to reduce the packet losses during handoffs. The handoffs of mobile nodes cause packet losses and decrease of TCP throughput on account of a variety of factors. One of those is the congestion in the new cell. Due to the congestion, not only the node moving into the cell but also the already existing nodes that were successfully communicating in the cell suffer the performance degradation. In this paper we propose a new handoff mechanism called‘packet freeze control’, which avoids the congestion caused by handoffs by regulating the influx of traffic burst into the new cell. Packet freeze control is applicable to a wireless network domain in which FAs(Foreign Agents) are connected hierarchically and constitute a logical tree. It gradually increases the number of packets transferred to the new cell by buffering packets in the FAs on the packet delivery path over the wireless network domain. The simulation results show that the proposed mechanism not only reduces the packet losses but also enhances the TCP throughput of other mobile nodes in the cell.

• Journal of Information Processing Systems
• /
• v.16 no.4
• /
• pp.959-974
• /
• 2020

High efficiency video coding (HEVC) employs quadtree coding tree unit (CTU) structure to improve its coding efficiency, but at the same time, it also requires a very high computational complexity due to its exhaustive search processes for an optimal coding unit (CU) partition. With the aim of solving the problem, a fast CU size decision optimal algorithm based on neighborhood prediction is presented for HEVC in this paper. The contribution of this paper lies in the fact that we successfully use the partition information of neighborhood CUs in different depth to quickly determine the optimal partition mode for the current CU by neighborhood prediction technology, which can save much computational complexity for HEVC with negligible RD-rate (rate-distortion rate) performance loss. Specifically, in our scheme, we use the partition information of left, up, and left-up CUs to quickly predict the optimal partition mode for the current CU by neighborhood prediction technology, as a result, our proposed algorithm can effectively solve the problem above by reducing many unnecessary prediction and partition operations for HEVC. The simulation results show that our proposed fast CU size decision algorithm based on neighborhood prediction in this paper can reduce about 19.0% coding time, and only increase 0.102% BD-rate (Bjontegaard delta rate) compared with the standard reference software of HM16.1, thus improving the coding performance of HEVC.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.7 no.4
• /
• pp.118-129
• /
• 2008

This paper describes an IEEE 802.15.4-based hierarchical sensor network model for a VAWS(Vehicle Approach Warning System) which provides the drivers of vehicles approaching a sharp turn with the information about vehicles approaching the same turn from the opposite end. In the proposed network model, a tree-structured topology, that can prolong the lifetime of network is formed in a self-organizing manner by a topology control protocol. A simple but efficient routing protocol, that creates and maintains routing tables based on the network topology organized by the topology control protocol, transports data packets generated from the sensor nodes to the base station which then forwards it to a display processor. These protocols are designed as a network layer extension to the IEEE 802.15.4 MAC. In the simulation, which models a scenario with a sharp turn, it is shown that the proposed network model achieves a high-level performance in terms of both energy efficiency and throughput simultaneously.

• Journal of Advanced Navigation Technology
• /
• v.23 no.4
• /
• pp.302-308
• /
• 2019

Aircraft data network (ADN) is a data networking for signal transmission among avionic systems in aircraft, and it mostly has been applied MIL-STD-1553B that guarantees high reliability considering its application environments. However, commercial Ethernet has been widely applied for ADN recently, and its range of applications have increased. Ethernet provides high speed of data transmission, however, it could not guarantee quality of service (QoS) so high as MIL-STD-1553B. In this paper, we propose dynamic routing and priority based data transmission schemes in order to improve the QoS of legacy Ethernet. Our propose schemes can be applied to Ethernet switch, and it is able to manage network traffic efficiently, and reduce the time for data transmission. We analyze the packet transmission time for both legacy and proposed schemes in Ethernet environments using simulation, and we show that our proposed scheme can reduce the time for data transmission compare to legacy spanning tree protocol.

• Journal of the Korean Society of Environmental Restoration Technology
• /
• v.24 no.4
• /
• pp.61-75
• /
• 2021

Roadside greenery in the city is not only a means of reducing fine dust, but also an indispensable element of the city in various aspects such as improvement of urban thermal environment, noise reduction, ecosystem connectivity, and aesthetics. However, in studies dealing with the effect of reducing fine dust through trees in existing urban spaces, microscopic aspects such as the adsorption effect of plants were dealt with, structural changes such as the width of urban buildings and streets, and the presence or absence of trees, Impact studies that reflect the actual form of In this study, the effect of greenery composition applicable to urban space on PM2.5 was simulated through the microclimate epidemiologic model ENVI-met, and field measurements were performed in parallel to verify the results. In addition, by analyzing the results of fine dust background concentration, wind speed, and leaf area index, the sensitivity to major influencing variables was tested. As a result of the study, it was confirmed that the fine dust reduction effect was the highest in the case with a high planting amount, and the reduction effect was the greatest at a low background concentration. Based on this, the cost of planting street green areas and the effect of reducing PM2.5 were compared. The results of this study can contribute as a basis for considering the effect of pedestrian space on air quality when planning and designing street green spaces.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.3
• /
• pp.125-132
• /
• 2022

The Ministry of Environment recently analyzed the output data of 10 fine dust measuring stations and, as a result, announced that about 60% had an error that the existing atmospheric measurement concentration was higher. In order to accurately predict fine dust, the wind direction and measurement position must be corrected. In this paper, in order to solve these problems, fuzzy rules are used to solve these problems. In addition, in order to calculate the fine particulate sensation index actually felt by pedestrians on the street, a computer simulation experiment was conducted to calculate the fine particulate sensation index in consideration of weather conditions, temperature conditions, humidity conditions, and wind conditions.