• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.3
• /
• pp.9-17
• /
• 2009

A Mobile Ad hoc network(MANET) is a network consisting of a set of wireless mobile nodes, which communicate with each other without centralized control or established infrastructure. In this paper, to obtain a better understanding of AODV(Ad hoc On-Demand Distance Vector Routing Protocol)and OLSR(Optimized Link State Routing Protocol) routing protocols, different performances are simulated and analyzed using OPNET modeler 14.5 with the various performance metrics, such as packet delivery ratio, end-to-end delay and routing overhead. As a conclusion, in static analysis, the routing overhead of OLSR is affected by the number of nodes, but not data traffic. In AODV case, it is affected by both data traffic and number of nodes. In mobility analysis, routing overhead is not greatly affected by mobility speed in AODV and OLSR, and the PDR(Packet Delivery Ration) of OLSR is decreased as the node speed increased, while AODV is not changed. AS to delay, AODV is always higher than OLSR in both static and nobility cases.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.11
• /
• pp.1146-1150
• /
• 2014

Recently, there has been interests in smart vessel technology, and it needs to consider an intelligent control system for efficient vessel manangement. In a smart vessel, however, it can cause a network overload due to a number of data transmission from a variety of sensor nodes and bridge nodes. In this letter, we propose an data transmission scheme with data fusion to reduce the number of traffic from the sensor nodes. Hence it can decrease network overload for intelligent vessel management.

• IEIE Transactions on Smart Processing and Computing
• /
• v.5 no.3
• /
• pp.169-177
• /
• 2016

To realize high-speed intrusion detection by accommodating many regular expression (regex)-based signatures and growing network link capacities, we propose the Service TimE-Aware Load-balancing (STEAL) algorithm. This work is motivated from the observation that utilization of a many-core network intrusion detection system (NIDS) is influenced by unfair computational distribution among many-core NIDS nodes. To avoid such unfair computational distribution, STEAL is designed to dynamically distribute a large volume of traffic among many-core NIDS nodes based on packet service time, which is represented by the deep packet time in many-core NIDS nodes. From experiments, we show that compared to the commonly used load-balancing algorithm based on arrival rate, STEAL increases the number of received packets (i.e., decreases the number of dropped packets) in many-core NIDS. Specifically, by integrating an open source NIDS (i.e. Bro) with STEAL, we show that even under attack-dominant traffic and with many signatures, STEAL can rapidly improve the performance of many-core NIDS to realize high-speed intrusion detection.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.05a
• /
• pp.601-603
• /
• 2013

The nodes of Ad-hoc network are made up of location registration for sending informations and a great number of packet transmissions to maintain routing route among the nodes. Under this environment, a huge number of traffics would be generated as mobility variable occurs more than in physical network. Hence, in this paper, focused on to study the relationship of nodes to analyze the extent of the traffic in order to control the traffics of the multi-hop in Ad-hoc.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.10a
• /
• pp.623-625
• /
• 2012

The nodes of Ad-hoc network are made up of location registration for sending informations and a great number of packet transmissions to maintain routing route among the nodes. Under this environment, a huge number of traffics would be generated as mobility variable occurs more than in physical network. Hence, in this paper, focused on to study the relationship of nodes to analyze the extent of the traffic in order to control the traffics of the multi-hop in Ad-hoc.

• Journal of Advanced Navigation Technology
• /
• v.11 no.4
• /
• pp.408-414
• /
• 2007

Research advances in the areas of micro-sensor device and wireless network technology, has made it possible to develop energy efficient and low cost wireless sensor nodes. In this paper, the forward error control (FEC) scheme for lower power consumption and excellent BER(Bit Error Rate) performance during transmission propose in multi-hop wireless sensor network based on FSK modem. The FEC technique uses extra processing power related to encoding and decoding, it is need complex functions to be built into the sensor node. The probability of receiving a correct bit and codeword for relaying a frame over h nodes to the sink node is calculated as a function of channel parameter, number of hops, number of bits transmitted and the distance between the different nodes.

• Smart Media Journal
• /
• v.12 no.3
• /
• pp.60-67
• /
• 2023

Hyperledger Indy is an open-source implementation of DID, a decentralized identity verification technology. Hyperledger Indy uses the RBFT consensus algorithm, and if there is a lack of consensus with more than a certain number of problem nodes in the pool, data is not added. This problem can be prevented in advance by adding a node, and a node monitoring system was implemented to operate automatically. The node monitoring system continuously checks the status of the pool and automatically adds nodes when there are more than a certain number of problematic nodes to prevent consensus problems from occurring. This proposed method can increase the availability of Hyperledger Indy and is a study that can be referenced in various blockchain services that use consensus algorithms.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.3 s.35
• /
• pp.11-18
• /
• 2005

In this paper, we propose a new technology mapping algorithm for CPLD consider area under time constraint. This algorithm detect feedbacks from boolean networks, then variables that have feedback are replaced to temporary variables. Creating the temporary variables transform sequential circuit to combinational circuit. The transformed circuits are represented to DAG. After traversing all nodes in DAG, the nodes that have output edges more than two are replicated and reconstructed to fanout free tree. Using time constraints and delay time of device, the number of graph partitionable multi-level is decided. Several nodes in partitioned clusters are merged by collapsing, and are fitted to the number of OR-terms in a given CLB by bin packing. Proposed algorithm have been applied to MCNC logic synthesis benchmark circuits, and have reduced the number of CLBs by $62.2\%$ than those of DDMAP. And reduced the number of CLBs by $17.6\%$ than those of TEMPLA.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.38 no.11
• /
• pp.804-809
• /
• 2001

In this paper, a shared channel scheme and routing algorithms are proposed to reduce the number of wavelength channels for the optical WDM multihop networks using the every-other-row-connecting bilayered ShuffleNet scheme. In the shared channel scheme proposed, 2P nodes share the common wavelength channel reducing the number of required channels compare to other ones. By assigning an effective address each node, packets can be routed to the destination nodes through the intermediate nodes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.2
• /
• pp.427-434
• /
• 1996

Hypercube has some advantages such as small diameter between nodes and relatively simple routing scheme, so it is one of the most popular interconnection networks used in real systems. But to make this structure more practical, it is required to reduce its diameter and to be able to expand it to any number of nodes. In this study, we proposed a Crossed Incomplete Hypercube structure. This scheme is based on the previous Crossed Hypercube topology that reduces the diameter about 50% and has the same complexity with general hypercube and is able to expand to any number of nodes. We also proposed a fixed routing scheme for this structure. In the repect of the average path and the average routing time, this structure shows an enhanced performance about 30% and it is enhanced about 20% ifn the average traffic density.