• Journal of Korea Society of Digital Industry and Information Management
• /
• v.11 no.3
• /
• pp.69-77
• /
• 2015

MANET is composed of only the mobile nodes have a limited transmission range. The dynamic topology by the frequent movement of nodes makes routing difficult and is also cause exposed to security vulnerabilities. In this paper, we propose the security routing technique consisted of mechanism of two steps in order to respond effectively to attack by the modification of the routing information and transmit secure data. The hierarchical structure is used and the authentication node that issues the key of the nodes within each cluster is elected in this proposed method. The authentication node manages key issues and issued information for encrypting the routing information from the source node. The reliability value for each node is managed to routing trust table in order to secure data transmission. In the first step, the route discovery is performed using this after the routing information is encrypted using the key issued by the authentication node. In the second step, the average reliability value of the node in the found path is calculated. And the safety of the data transmission is improved after the average reliability value selects the highest path. The improved performance of the proposed method in this paper was confirmed through comparative experiments with CBSR and SEER. It was confirmed a better performance in the transmission delay, the amount of the control packet, and the packet transmission success ratio.

• ETRI Journal
• /
• v.36 no.1
• /
• pp.183-186
• /
• 2014

In this letter, we consider a cooperation system with multiple untrusted relays (URs). To keep the transmitted information confidential, we obtain joint channel characteristics (JCCs) through combining the channels from the source to the destination. Then, in the null space of the JCCs, jammers construct artificial noise to confuse URs when the source node broadcasts its data. Through a distributed implementation algorithm, the weight of each node can be obtained from its own channel state information. Simulation results show that high-level security of the system can be achieved when internal and external eavesdroppers coexist.

• Journal of applied mathematics & informatics
• /
• v.26 no.1_2
• /
• pp.235-249
• /
• 2008

On-demand routing protocol in ad hoc network is that establishes a route to a destination node only when it is required by a source node. But, it is necessary to reestablish a new route when an active route breaks down. The reconstruction process establishes another route by flooding messages from the source to the destination, cause not only heavy traffic but also long delays in route discovery. A good method for analyzing performance of protocols is important for deriving better systems. In this paper, we suggest the numerical formulas of a representative on-demand routing protocol AODV, ARMP, and RRAODV to estimate the performance of these routing protocols for analyzing the performance of these protocols. The proposed analytical models are very simple and straightforward. The results of analysis show good agreement with the results of computer simulations.

• Proceedings of the Korea Contents Association Conference
• /
• 2005.05a
• /
• pp.475-479
• /
• 2005

In this paper we constructed semantic net that can efficiently conform retrieval and reuse of object-oriented source code. In odor that initial relevance of semantic net was constructed using thesaurus to represent concept of object-oriented inheritance between each node. Also we made up for the weak points in spreading activation method that use to activate node and line of semantic net and to impulse activation value. Therefore we proposed the method to enhance retrieval time and to keep the quality of spreading activation.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2019.07a
• /
• pp.225-226
• /
• 2019

Code box 시스템은 프론트엔트 개발자를 위한 온라인 소스코드 저장소로 HTML. CSS, JavaScript를 작성하고 그 결과를 즉시 확인할 수 있으며, 소스코드의 버전관리 기능을 추가하여 소스코드의 변경에 따른 소스코드 관리 능력을 향상하도록 하였으며, 소스코드 작성 시 편의성을 향상시키기 위하여 코드 작성란에 문법자동완성과 Syntax Highlighting기능을 추가하였다. 또한 작성한 소스코드를 사용자들이 공유할 수 있으며 소스코드 작성 중 질문 사항이 발생하면 작성된 소스코드를 옮겨 실시간 질의 사항을 공유하도록 하였다.

• Journal of the military operations research society of Korea
• /
• v.26 no.2
• /
• pp.1-7
• /
• 2000

A quickest path in a network is a path that takes the shortest time to send the amount of data from the source node to the sink node. Martin and Santos presented a theorem on the quickest path by which a quickest path for the amount of data is determined. However, we find a counterexample to Martins and Santos' theorem. In this paper, we present the corrected theorem and give a revised algorithm for finding quickest paths.

• Annual Conference of KIPS
• /
• 2008.11a
• /
• pp.1314-1315
• /
• 2008

Recent research work has unearthed that multi-radio multi-channel wireless mesh networks offer considerable capacity gains over single-radio wireless mesh networks. In this paper, we present a new routing metric for multi-radio multi-channel wireless mesh networks. The goal of the metric is to choose multiple link/node disjoint paths between a source and destination node that, when used concomitantly, impart high end-to-end throughput. The proposed metric selects high fidelity paths that will produce elevated throughput with maximum fault tolerance.

• Journal of KIISE:Information Networking
• /
• v.36 no.1
• /
• pp.12-23
• /
• 2009

Sensor networks deployed in battlefields to support military operations or deployed in natural habitats to monitor the rare wildlifes must take account of protection of the location of valuable assets(i.e., soldiers or wildlifes) from an adversary or malicious tracing as well as the security of messages in transit. In this paper we propose a routing protocol GSLP(GPSR-based Source-Location Privacy) that is capable of enhancing the location privacy of an active source node(i.e., message-originating node) in the presence of multiple dormant sources(i.e., nodes lying nearby an asset whose location needs to be secured). Extended is a simple, yet scalable, routing scheme GPSR(greedy perimeter stateless routing) to select randomly a next-hop node with a certain probability for randomizing paths and to perform perimeter routing for detouring dormant sources so that the privacy strength of the active source, defined as safety period, keeps enhanced. The simulation results obtained by increasing the number of dormant sources up to 1.0% of the total number of nodes show that GSLP yields increased and nearly invariant safety periods, while those of PR-SP(Phantom Routing, Single Path), a notable existing protocol for source-location privacy, rapidly drop off as the number of dormant sources increases. It turns out that delivery latencies of GSLP are roughly less than two-fold of the shortest path length between the active source and the destination.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.10 no.6
• /
• pp.671-676
• /
• 2015

Cooperative networks eliminate shadow area using relay and enhance communication performance by creating virtual multi input multi output (MIMO) system. In this paper, we analyze the performance of cooperative networks which use coherent modulation scheme in source-relay nodes and differential modulation scheme in relay-destination nodes depending on the relay location. We consider the performance analysis of systems with and without the direct transmission between source and destination node where the direct transmission adopts differential modulation scheme. In addition, the performance of the system with fully differential modulation scheme is compared with the system using partially differential modulation scheme. The performance of system is based on the symbol error rate between source and destination node.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.12C
• /
• pp.1188-1193
• /
• 2007

This paper proposes a secure data forwarding scheme on source routing-based ad-hoc networks. The scheme uses two hash-key chains generated from a trusted third party to generate Message Authentication Codes for data integrity The selected MAC keys are delivered to the ad-hoc node using a pre-shared secret between the trusted third party and a node. The proposed scheme does not require the PKI, or the provisioning of the pre-shared secrets among the ad-hoc nodes.