• Proceedings of the IEEK Conference
• /
• 2001.06a
• /
• pp.269-272
• /
• 2001

Since Multi-way Search Tree reduces the number of the memory access by increasing the branch factor, it is considered a method to archive the high-speed IP address lookup. Using the combination of initial 16 bit may and Multi-way Search Tree, it also reduces the search time of If address lookup. Multi-way Search Tree consists of K keys and K＋1 key pointers. This paper shows how the E update of Multi-way Search Tree which consists of the one pointer within a node can be performed. Using the one pointer within a node, it increases the number of keys within a node and reduces the search time of IP lookup. We also describes IP updating methods such as modification, Insertion and Deletion of address entries. Our update scheme performs better than the method which rebuilds the entire IP routing table when IP update processes.

• Journal of information and communication convergence engineering
• /
• v.7 no.3
• /
• pp.258-262
• /
• 2009

A Practical application of environmental monitoring system based on wireless sensor node network with the core of embedded system STR711FR2 microprocessor is presented in the paper. The adaptable and classifiable wireless sensor node network is used to achieve the data acquisition and multi-hop wireless communication of parameters of the monitoring base station environment including repeaters. The structure of the system is proposed and the hardware architecture of the system is designed, and the system operating procedures is proposed. As a result of field test, designed hardware platform operated with 50kbps bit rate and 5MHz channel spacing at 2040Hz. The wireless monitoring system can be managed and swiftly retreated without support of base station environmental monitoring.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.1B
• /
• pp.56-61
• /
• 2000

The maximum number of nodes in WDM self healing ring network in limited by several factors including network architecture and ASE noise due to EDFAs at each optical ADM node. In this paper, the maximum node numbers for several protection architectures and bit rates limited by ASE are calculated and compared with the number limited by wavelength numbers. Appropriate design rules can be deduced from these results.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.7
• /
• pp.799-803
• /
• 2010

The KDB-tree is a traditional indexing scheme for retrieving multidimensional data. Much research for KDB-tree family frequently addresses the low storage utilization and insufficient retrieval performance as their two bottlenecks. The bottlenecks occur due to a number of unnecessary splits caused by data insertion orders and data skewness. In this paper, we propose a novel index structure, called as $KDB_{CS}^+$-tree, to process skewed data efficiently and improve the retrieval performance. The $KDB_{CS}^+$-tree increases the number of fan-outs by exploiting bit-vectors for representing splitting information and pointer elimination. It also improves the storage utilization by representing entries as a hierarchical structure in each internal node.

• Journal of Korea Society of Industrial Information Systems
• /
• v.15 no.3
• /
• pp.11-21
• /
• 2010

Increase in the number of sensor nodes in sensor networks and sensor node to automatically assign addresses are needed. The method developed to address existing severe wasting, coordinators have all address information, each sensor node when addressing the shortcomings are a lot of traffic. In this paper, 6LoWPAN automatically from the sensor nodes capable of efficiently addressing Hop-Count based hierarchical address allocation algorithm is proposed. How to propose a hop-count of divided areas are separated, with no overlap and can be assigned a unique address, DAD(Duplicate Address Detection) reduced area. Perform DAD to reduce traffic, packet transmission in the IP header destination address, respectively, with a minimum 32-bit compression and packet transmission over a non-compression method to reduce the number of 11.1%.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.1
• /
• pp.131-143
• /
• 1996

In this paper, we propose the improved structure of fully interconnected ATM Switch to develop the small sized switch element and represent practical implementation of switch network. As the part II of the full study about structure and implementation of fully interconnected ATM Switch, this paper especially describes the implementation of an ATM switching element with 8 input port and 8 output port at 155 Mbits/sec each. The single board switching element is used as a basic switching block in a small sized ATm switch for ATM LAN Hub and customer access node. This switch has dedicated bus in 12 bit width(8 bit data + 4 bit control signal) at each input and output port, bit addressing and cell filtering scheme. In this paper, we propose a practical switch architecture with fully interconnected buses to implement a small-sized switch and to provide multicast function withoutany difficulty. The design of switching element has become feasible using advanced CMOS technology and Embedded Gate Array technology. And, we also represent Application Specific Integrated Circuit(ASIC) of Switch Output Multiplexing Unit(SOMU) and 12 layered Printed Circuit Board for interconnection network of switch.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.7
• /
• pp.433-439
• /
• 2014

This paper proposes an architecture of two-stage string matching engine with content-addressable memory(CAM) and parallel bit-split string matchers for deep packet inspection(DPI). Each long signature is divided into subpatterns with the same length, where subpatterns are mapped onto the CAM in the first stage. The long pattern is matched in the second stage using the sequence of the matching indexes from the CAM. By adopting CAM and bit-split string matchers, the memory requirements can be greatly reduced in the heterogeneous string matching environments.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.10a
• /
• pp.886-889
• /
• 2014

In this paper, we evaluate a physical layer security performance of orthogonal space-time block code(OSTBC) using one-bit feedback in the presence of an eavesdropper in wiretap channels, where we assume spatially correlated MIMO(multiple-input multiple-output) channels. In this paper, we present the one-bit feedback based OSTBC(F-OSTBC) scheme and compare security outage performances of F-OSTBC, conventional OSTBC, and transmission antenna selection schemes for various spatial correlation conditions at each node.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.4A
• /
• pp.315-321
• /
• 2010

In Ad-hoc networks, centralized power control is not suitable due to the absence of base stations, which perform the power control operation in the network to optimize the system performance. Therefore, each node should perform power control algorithm distributedly instead of the centralized one. The conventional distributed power control algorithm does not consider the adaptive bit loading operation to change the MCS (modulation and coding scheme) according to the received SINR (signal to interference and noise ratio), which limits the system throughput. In this paper, we propose a novel distributed bit loading and power control algorithm, which considers the adaptive bit loading operation to increase total system throughput and decrease outage probability. Simulation results show that the proposed algorithm performs much better than the conventional algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.12
• /
• pp.2392-2400
• /
• 2015

Zigbee, which was a representative standard technology for dealing low energy and mesh networks in large deployment area such as smart home, smart building, and massive sensor networks, has been developed and deployed for increasing communication area by using Ad hoc method. It has been originally developed based on IEEE 802.15.4 standard so every node needs 48bit unique address defined by IEEE. However, it is absolutely inefficient to assign an unique address to every communication node where it would be deployed through large-scale network area, e.g., smart lighting and massive sensor networks, because there could be variously multiple companies to deploy network infrastructure and they could have different policy to assign node ID. To prevent the problem, this paper proposes a method of dynamic PANID assignment in overall Personal Coordinators, and also proposes a method for addressing PANID conflict problem which could be derived from dynamic PANID assignment.