• Proceedings of the Korean Society of Computer Information Conference
• /
• 2014.01a
• /
• pp.353-354
• /
• 2014

무선 센서 네트워크(WSN)환경에서는 저가의 센서 노드를 구성하기 위해 배터리, 제한된 에너지 등과 같은 하드웨어적인 제약을 갖고 있다. 특히, 센서 노드의 제한된 에너지는 네트워크 수명과 직접적인 관련이 있기 때문에 네트워크의 수명을 연장하기 위한 효율적인 기법들이 요구되는 실정이다. 이를 위해 본 논문에서는 WSN환경에서 고정 노드와 모바일 노드를 혼용하여 음영지역을 최소화할 수 있는 모바일 노드 이동 기법을 제안한다. 이는 대표 노드를 선정하여 네트워크의 밀도를 제어하고 각 노드들의 거리에 따라 신호 세기를 제어한다. 이를 통해 네트워크 지역의 확장과 각 노드의 에너지를 효율적으로 사용할 수 있다.

• The KSFM Journal of Fluid Machinery
• /
• v.15 no.3
• /
• pp.12-18
• /
• 2012

The Lattice Boltzmann Method has developed for solving the Boltzmann equation in Cartesian domains containing immersed boundaries of arbitrary geometrical complexity moving with prescribed kinematics. When a immersed boundaries are sweeping the fixed fluid node, refilling the node information in a vicinity of fluid nodes is one of the important issues in Lattice Boltzmann Method. In this study, we propose a simple refill algorithm for the particle distribution function based on a proper velocity, density and strain rate to enhance accuracy and stability of the method. The refill scheme based on a asymptotic analysis of LBGK model has improved accuracy than interpolation schemes. The proposed scheme in this study is validated by the simulations of an impulsively started rotating circular cylinder to investigate adaptability for fluid-structure interaction (FSI) problem. This refill scheme has improved stability and accuracy especially at high Reynolds number region.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.8B
• /
• pp.739-746
• /
• 2004

An ATM/AAL2 is standardized to transmit delay sensitive application services, which has small size packet, efficiently. An AAL2 transmission scheme is used to deliver voice and data traffic on the lob interface between base station (Node-B) and Radio Network Controller (RNC) in UMTS network. To predict AAL2 performance, a detailed end-to-end UMTS network performance simulator was developed. We performed detailed simulation(cell packing density and bandwidth gain) for voice and data services in UTRAN. The results indicate that the maximum bandwidth gain in Node-B is about 17% and the bandwidth gain of AAL2 multiplexing in $I_{ub}$ for data services is less than that for voice service. Futhermore, the more offered load increase the more the bandwidth gain decreases in a concentrator.

• Journal of Information Processing Systems
• /
• v.14 no.4
• /
• pp.926-940
• /
• 2018

In clustering-based approaches, cluster heads closer to the sink are usually burdened with much more relay traffic and thus, tend to die early. To address this problem, distance-aware clustering approaches, such as energy-efficient unequal clustering (EEUC), that adjust the cluster size according to the distance between the sink and each cluster head have been proposed. However, the network lifetime of such approaches is highly dependent on the distribution of the sensor nodes, because, in randomly distributed sensor networks, the approaches do not guarantee that the cluster energy consumption will be proportional to the cluster size. To address this problem, we propose a novel approach called CACD (Clustering Algorithm Considering node Distribution), which is not only distance-aware but also node density-aware approach. In CACD, clusters are allowed to have limited member nodes, which are determined by the distance between the sink and the cluster head. Simulation results show that CACD is 20%-50% more energy-efficient than previous work under various operational conditions considering the network lifetime.

• Journal of Communications and Networks
• /
• v.11 no.5
• /
• pp.455-463
• /
• 2009

We consider the challenges of finding good puncturing patterns for rate-compatible low-density parity-check code (LDPC) codes over additive white Gaussian noise (AWGN) channels. Puncturing is a scheme to obtain a series of higher rate codes from a lower rate mother code. It is widely used in channel coding but it causes performance is lost compared to non-punctured LDPC codes at the same rate. Previous work, considered the role of survived check nodes in puncturing patterns. Limitations, such as single survived check node assumption and simulation-based verification, were examined. This paper analyzes the performance according to the role of multiple survived check nodes and multiple dead check nodes. Based on these analyses, we propose new algorithm to find a good puncturing pattern for LDPC codes over AWGN channels.

• Journal of Korea Society of Industrial Information Systems
• /
• v.14 no.3
• /
• pp.50-57
• /
• 2009

We propose a network node search scheme to address the network fragmentation due to high node mobility in the VANET. VANET is very similar to MANET in that a multi-hop ad-hoc network is configured by wireless communication between vehicles without any network infrastructure. However, high speed mobility, high node density, and frequent topology change induce frequent network fragmentation so that overall network traffic can be increased. In this paper, new broadcasting protocol called an adaptive relay node search protocol is proposed to decrease the network fragmentation. It reduces the network fragmentation and network traffic by researching nodes outside the dangerous area only in case of network fragmentation. Simulation results show that the proposed protocol decreases network fragmentation by up to 39.9% and increase informed rate by up to 41.9% compared to the existing broadcasting protocol.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.13 no.1
• /
• pp.8-14
• /
• 2013

A low density parity check (LDPC) decoder provides a most powerful error control capability for mobile communication devices and storage systems, due to its performance being close to Shannon's limit. In this paper, we introduce an efficient overlapped LDPC decoding algorithm using a upper dual-diagonal parity check matrix structure. By means of this algorithm, the LDPC decoder can concurrently execute parts of the check node update and variable node update in the sum-product algorithm. In this way, we can reduce the number of clock cycles per iteration as well as reduce the total latency. The proposed decoding structure offers a very simple control and is very flexible in terms of the variable bit length and variable code rate. The experiment results show that the proposed decoder can complete the decoding of codewords within 70% of the number of clock cycles required for a conventional non-overlapped decoder. The proposed design also reduces the power consumption by 33% when compared to the non-overlapped design.

• Journal of information and communication convergence engineering
• /
• v.8 no.6
• /
• pp.623-629
• /
• 2010

A geographical routing protocol is typically utilized for a route selection of VANET. Even if it is conceptually well adapted into VANET, message delivery tends to be unreliable with frequent network partitions, which mainly come from the inherent characteristics such as high mobility and irregular traffic density. In this paper, we deal with a method to enable reliable message delivery with reflecting the traffic density on routing decision. By concatenating the message delivery cost of each of inbetween junction section, $1^{st}$ and $2^{nd}$ shortest paths are initially determined. When it is not possible to deliver the message on a junction on the 1st path, we utilize two novel ideas, that is, letting the message stay on the junction to find out a new relay node, and putting a replicated copy to reach via a detour path. By using the NS-2 network simulator, our method has been examined in terms of message delivery rate and delay. It shows that our method is much efficient than the other method in the low density environment, while it brings similar results in the high density environment.

• International Journal of High-Rise Buildings
• /
• v.12 no.1
• /
• pp.35-47
• /
• 2023

The transport system and its infrastructure are not only the fundamental means of sustaining the operation of contemporary cities, but also important drivers for the evolution of urban form. Rail transit, critical to improving the operational efficiency and optimizing the spatial layout in cities, is one of the critical conditions for high-density areas with limited land and concentrated resources to be compact to take on complex challenges. As a node element of infrastructure, rail transit entrances are the most important points connecting the rail transit system with urban space. Although influenced by urban form, their quantity and location also influence and shape the evolution of urban space form. Based on the development gap of high-density areas in various contexts, focusing on various rail transit stations in Asia, this research analyzes the correlation between rail transit entrances and peripheral high-density urban form in a delicate, dynamic and granular way. The research considers both horizontal and vertical perspectives, in combination with the urban evolution process in time series, to explore the development trend of high-density urban form in Asia from the aspect of correlation, and building a new foundation for research on urban form, suitable for different types of cities.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.2 s.34
• /
• pp.49-57
• /
• 2005

In this paper. a CLB-based CPLD low power technology mapping algorithm for trade-off is proposed. To perform low power technology mapping for CPLD, a given Boolean network has to be represented to DAG. The proposed algorithm consists of three step. In the first step, TD(Transition Density) calculation have to be Performed. Total power consumption is obtained by calculating switching activity of each nodes in a DAG. In the second step, the feasible clusters are generated by considering the following conditions : the number of output. the number of input and the number of OR-terms for CLB within a CPLD. The common node cluster merging method, the node separation method, and the node duplication method are used to produce the feasible clusters. The proposed algorithm is examined by using benchmarks in SIS. In the case that the number of OR-terms is 5, the experiments results show reduction in the power consumption by 30.73$\%$ comparing with that of TEMPLA, and 17.11$\%$ comparing with that of PLAmap respectively