• Journal of Korea Multimedia Society
• /
• v.9 no.2
• /
• pp.244-254
• /
• 2006

This paper presents an efficient hybrid technique to compact the trie indexing the huge forward table small enough to be stored into cache for speeding up IP lookup. It combines two techniques, an encoding scheme called bit-map and a controlled-prefix expanding scheme to replace slow memory search with few fast-memory accesses and computations. For compaction, the bit-map represents each index and child pointer with one bit respectively. For example, when one node denotes n bits, the bit-map gives a high compression rate by consumes $2^{n-1}$ bits for $2^n$ index and child link pointers branched out of the node. The controlled-prefix expanding scheme determines the number of address bits represented by all root node of each trie's level. At this time, controlled-prefix scheme use a dynamic programming technique to get a smallest trie memory size with given number of trie's level. This paper proposes standard that can choose suitable trie structure depending on memory size of system and the required IP lookup speed presenting optimal memory size and the lookup speed according to trie level number.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.4C
• /
• pp.437-445
• /
• 2009

Node of USN(Ubiquitous Sensor Network) environments uses radio based communication mechanism for a delivering message. Thus the multiple hop flooding is necessary for considering limited power and communicating unknown node long-range. However if there are many unknown nodes located in users' vision, the flooding of the radio base is insufficient alternative. Thus as a flash may be used to find a key in a darkness, a more direct and short range communication system is required. This study shall resolve such question through 2 different steps. First a Two kind of code method that convert Text message to color code shall be suggested. Second a hardware module, which may deliver various LED(light-emitting diode) color signal, shall be developed. The experiment may take place by fixing the entry angle of light and distance by setting a specific element as a standard mean.

• Journal of the Institute of Convergence Signal Processing
• /
• v.14 no.1
• /
• pp.45-50
• /
• 2013

Sensors have limited resources in sensor networks, so efficient use of energy is important. Representative clustering methods, LEACH, LEACHC, TEEN generally use direct transmission methods from cluster headers to a sink node to pass collected data. If clusters are located at a long distance from the sink node, the cluster headers exhaust a lot of energy in order to transfer the data. As a consequence, the life of sensors is shorten and re-clustering is needed. In the process of clustering, sensor nodes consume some energy and the energy depletion of the cluster headers meet another energy exhaustion. A method of transferring data from cluster headers to the sink using neighbor clusters is needed for saving energy. In this paper, we propose a novel routing method using a multi-hop transmission method in cluster sensor networks. This method uses the topology matrix which presents cluster topology. One-hop routing and two-hop routing are proposed in order to increase the energy efficiency.

• Journal of KIISE:Information Networking
• /
• v.28 no.3
• /
• pp.321-335
• /
• 2001

The explosive growth in wireless networking increasingly urges the demand to support mobility within the Internet which is what Mobile-IP aims to provide. Because the transmission of signals through open-air s easy to be attacked, it is important to provide secure transmission for mobile users and make them responsible for what they have done in networks. Although IETF provides a secret-key based security mechanism, those mechanisms suffer from scalability, efficiency and non-repudiation service problem. The proposed mechanism uses public-key based authentication optimizing the performance. It includes non-repudiation service on the side of mobile for airtight security in wireless network. The simulation results show that the proposed authentication reduces the total registration time. It especially minimizes the computation cost on the side of the mobile node and solves the power problem. In practice, the proposed authentication is feasible with reasonable performance and security service in macro mobility that Mobile-IP is intended to solve.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.1 s.45
• /
• pp.33-42
• /
• 2007

Mobile ad-hoc network(MANET) can increase independence and flexibility of network because it consists of mobile node without the aid of fixed infrastructure. But, Because of unrestriction for the participation and breakaway of node, it has the difficulty in management and stability which is a basic function of network operation. Therefore, to solve those problems, we suggest a distributed weighted clustering algorithm from a manageable and stable point of view. The suggested algorithm uses distributed weighted clustering algorithm when it initially forms the cluster and uses a concept which is distributed gateway and sub-cluster head to reduce the re-clustering to the minimum which occurs mobile nodes after forming the cluster. For performance evaluation, We compare DCA and WCA with the suggested algorithm on the basis of initial overhead, resubscriber rate and a number of cluster.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.11 no.2
• /
• pp.137-145
• /
• 1986

The contention resolution algorithm with the limited packet delay time as well stable distribution as the packet delay time is proposed and implementes for improving the mean packet delay time in the network employing CSMA/CD as the access method. The implementation of node controller is based on IEEE 802.2 standard logical link control(LLC) and IEEE 802.3 standard medium access control(MAC). Some portion of IEEE 802.3 Standard MAC, and the Binary Exponential Back-off(BEB) algorithm is replaced by the proposed algorithm. From the view of normalized mean packet transmission delay time, the controller implemented here can be applicable to the office-automation system, and the factory-and laboratory-automation environment where the limited time criterion is very significant.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.9
• /
• pp.2022-2028
• /
• 2015

SpaceWire is a standard for high-speed links and networks between spacecraft components, which was invented for better, cheaper and faster on-board data handling in spacecraft. The standard defines timecode and its distribution which can be used for time synchronization among the nodes in a SpaceWire network. A timecode output from the time master which provides standard time over a SpaceWire network travels through links and routers to reach every nodes. While traveling, a timecode suffers from transmission delay and jitter which cause some difference in time synchronization among nodes. In this work, a simulator was developed using OMNeT++ to simulate the operation of a SpaceWire network and some analyses were performed on the transmission delay and jitter accompanied with a transmission of a timecode. The result will be used in the near future for the research of a precise time synchronization technique over a SpaceWire network.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.8
• /
• pp.2061-2074
• /
• 1998

In pattern recognition and image analysis upplications, a graph is a useful tool for complex obect representation and recognition. However it takes much time to pair proper nodes between the prototype graph and an input data graph. Futhermore it is difficult to decide whether the two graphs in a class are the same hecause real images are degradd in general by noise and other distortions. In this paper we propose a matching algorithm using a matrix. The matrix is suiable for simple and easily understood representation and enables the ordering and matching process to be convenient due to its predefined matrix manipulation. The nodes which constitute a gaph are ordered in the matrix by their geometrical positions and this makes it possible to save much comparison time for finding proper node pairs. for the classification, we defined a distance measure thatreflects the symbo's structural aspect that is the sum of the mode distance and the relation distance; the fornet is from the parameters describing the node shapes, the latter from the relations with othes node in the matrix. We also introduced a subdivision operation to compensate node merging which is mainly due t the prepreocessing error. The proposed method is applied to the recognition of musteal symbols and the result is given. The result shows that almost all, except heavily degraded symbols are recognized, and the recognition rate is approximately 95 percent.

• Journal of Internet Computing and Services
• /
• v.10 no.2
• /
• pp.65-73
• /
• 2009

IEEE802.11 Wireless LAN(WLAN) is being widely used in public space such as airport, and increases the networking boundary in campus and enterprise, and it has lastly attracted considerable attention for mesh network and converged network with other 3G mobile communication networks. In WLAN, load balancing among Access Points(AP) is an important issue for efficient resource management or supporting the Quality of Service(QoS) of traffic, but most researches focused on the AP selection in network entry or roaming of Stations(STA). In this paper, we propose an AP-Initiated Flow Redirection(FR) for AP load balancing by monitoring AP's availability in the true sense. When the AP's resource becomes almost saturated, that is used more than a specific threshold, the AP queries the roaming possible neighbor APs about their availability and calculates the distribution of traffic load with statistical methods such as entropy or chi-square. Finally, the AP decides flows and new APs for redirection and performs it. Our simulation results show that our FR mechanism increases the performance in the various views.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.8
• /
• pp.1493-1499
• /
• 2007

Real-time applications in a wireless sensor network environment require real-time transmissions from sensing nodes to sink nodes. Existing congestion control mechanisms have treated congestion problems in sensor networks, but they only adjust the reporting frequency or the sending rate in intermediate nodes. They were not suitable for real-time applications from the transmission delays point of view. In this paper, we suggest a new mechanism that can reduce the transmission delay and can increase the throughput for real-time applications in sensor network. This mechanism classifies data on the real-time characteristics, processes the data maintaining the real-time characteristics prior to the other data such as the non real-time data or the data lost the real-time characteristics. A modified frame format is also proposed in order to apply the mechanism to IEEE 802.15.4 MAC layer. The simulation based on ns-2 is accomplished in order to verify the performance of the suggested scheme from transmission delay and throughput standpoints. The simulation results show that the proposed algorithm has a better performance specifically when It applies to the real-time applications in sensor networks.