• Journal of the Korea Society for Simulation
• /
• v.16 no.2
• /
• pp.17-26
• /
• 2007

In this paper, we propose a basic virtual grid-based routing algorithm in order to devise an efficient routing method in ad hoc networks using the location information of nodes, energy level, etc. A packet is forwarded to the X-axis direction at first based on the location information of a destination node, and then it is forwarded to the Y-axis direction as its location becomes close to the destination from the viewpoint of the X-axis. Due to the selection of next hop nodes to deliver a packet from a certain node to a destination node, we can regard the whole network as a virtual grid network. The proposed routing algorithm determines routing paths using the local information such as the location information of a destination and its neighbor nodes. Thus, the routing path setup is achieved locally, by which we can expect reduction in network traffics and routing delays to a destination. To evaluate the performance of the proposed routing algorithm, we used the network simulator ns2 and compared its network throughput with that of an existing routing algorithm.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.1 s.343
• /
• pp.133-142
• /
• 2006

This paper suggests an efficient method of protection ratio(PR) calculation and shows some results of point-to-point radio relay system for frequency coordination. The proposed PR can be expressed as a function of C/N of modulation scheme, noise-to-interference ratio(N/I), multiple interference allowance, fade margins of multi-Path and rain attenuation and net filter discrimination. And PR calculation is performed in view of fade margin, modulation scheme, distance, and interference for actual point-to-point radio relay frequency. According to results for 6.2 GHz, 64-QAM and 60 km at BER 10-6, fade margin and co-channel Protection ratio reveal 41.1dB and 74.9 dB, respectively The merit of presented method provides a systematic and easy calculation by means of PR correction factor related with various parameters and can apply the same concept to frequency coordination of millimeter wave radio relay system.

• Journal of IKEEE
• /
• v.22 no.3
• /
• pp.522-531
• /
• 2018

A public-key cryptography processor EC-RSA was designed, which integrates a 224-bit prime field elliptic curve cryptography (ECC) defined in the FIPS 186-2 as well as RSA with 2048-bit key length into a single hardware structure. A finite field arithmetic core used in both scalar multiplication for ECC and exponentiation for RSA was designed with 32-bit data-path. A lightweight implementation was achieved by an efficient hardware sharing of the finite field arithmetic core and internal memory for ECC and RSA operations. The EC-RSA processor was verified by FPGA implementation. It occupied 11,779 gate equivalents (GEs) and 14 kbit RAM synthesized with a 180-nm CMOS cell library and the estimated maximum clock frequency was 133 MHz. It takes 867,746 clock cycles for ECC scalar multiplication resulting in the estimated throughput of 34.3 kbps, and takes 26,149,013 clock cycles for RSA decryption resulting in the estimated throughput of 10.4 kbps.

• Journal of Environmental Science International
• /
• v.25 no.1
• /
• pp.127-134
• /
• 2016

This study is conducted to get current state of data collection and utilization of the trees damaged by pine wilt disease, and to efficiently collect and utilize of the trees damaged by the pine wilt disease and abandoned fumigation-treated trees at forecasts. The method to control pine wilt disease damaged area is mostly fumigation treatment system, and there is no collection and utilization of damaged trees because of absence of efficient collection system, lack of collection cost, and absence of policy, etc. A survey is conducted that asked about the satisfaction degree for the trees damaged by pine wilt disease collection and use divided into 6 topics. It was positively recognized that the need and problem of the trees damaged by pine wilt disease, and results and satisfaction of forestry mechanization while it was mostly negatively recognized that the policy satisfaction for prevention and collection, satisfaction of collection and use, collection and forestry mechanization, and satisfaction of foundation equipment for forestry mechanization, etc. As a result of path analysis, it is necessary to promote a high-tech forestry mechanization to improve satisfaction level of results and satisfaction of forestry mechanization for the trees damaged by pine wilt disease collection and utilization, it is also need to make an effort in various ways for improve satisfaction level of satisfaction of collection and utilization.

• Convergence Security Journal
• /
• v.14 no.4
• /
• pp.3-8
• /
• 2014

Wireless Ad hoc Network is threatened from many types of attacks because of its open structure, dynamic topology and the absence of infrastructure. Attacks by malicious nodes inside the network destroy communication path and discard packet. The damage is quite large and detecting attacks are difficult. In this paper, we proposed attack detection technique using secure authentication infrastructure for efficient detection and prevention of internal attack nodes. Cluster structure is used in the proposed method so that each nodes act as a certificate authority and the public key is issued in cluster head through trust evaluation of nodes. Symmetric Key is shared for integrity of data between the nodes and the structure which adds authentication message to the RREQ packet is used. ns-2 simulator is used to evaluate performance of proposed method and excellent performance can be performed through the experiment.

• Journal of Korea Multimedia Society
• /
• v.13 no.1
• /
• pp.122-132
• /
• 2010

The analysis of ocean environment offers us essential information for ocean exploration. But ocean environment has a lot of environmental variables such as the movements of nodes by an ocean current, corrosion by salt water, attenuation of radio wave, occurrences of multi-path and difficulty of sensor nodes' deployment. It is accordingly difficult and complex to gather and process the environmental information through ocean data communication due to these constraints of ocean environment unlike the terrestrial wireless networks. To overcome these problems, we organized ocean communication network for monitoring underwater environment by real experiment in Gyeongpoho similar to ocean environment. Therefore, this paper aims at overcoming major obstacles in ocean environment, effectively deploying sensor nodes for ocean environment monitoring and defining an efficient structure suitable for communication environment by the implementation of ocean environment monitoring system in Gyeongpoho.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.10
• /
• pp.1879-1885
• /
• 2017

This paper discusses the trajectory tracking system of unmanned ground vehicles based on predictive control. Because the unmanned ground vehicles can not satisfactorily complete the path tracking task, highly efficient and stable trajectory control system is necessary for unmanned ground vehicle to be realized intelligent and practical. According to the characteristics of unmanned vehicle, this paper built the kinematics tracking models firstly. Then studied algorithm solution with the tools of the optimal stability analysis method and proposed a tracking control method based on the model predictive control. The controller used a kinematics-based prediction model to calculate the predictive error. This controller helps the unmanned vehicle drive along the target trajectory quickly and accurately. The designed control strategy has the true robustness, simplicity as well as generality for kinematics model of the unmanned vehicle. Furthermore, the computer Simulink/Carsim results verified the validity of the proposed control method.

• Journal of Communications and Networks
• /
• v.6 no.3
• /
• pp.269-279
• /
• 2004

A new online multi-layer integrated routing (MLIR) scheme that combines IP (electrical) layer routing with WDM (optical) layer routing is investigated. It is a highly efficient and cost-effective routing scheme viable for the next generation integrated optical Internet. A new simplified weighted graph model for the integrated optical Internet consisted of optical routers with multi-granularity optical-electrical hybrid switching capability is firstly proposed. Then, based on the proposed graph model, we develop an online integrated routing scheme called differentiated weighted fair algorithm (DWFA) employing adaptive admission control (routing) strategies with the motivation of service/bandwidth differentiation, which can jointly solve multi-layer routing problem by simply applying the minimal weighted path computation algorithm. The major objective of DWFA is fourfold: 1) Quality of service (QoS) routing for traffic requests with various priorities; 2) blocking fairness for traffic requests with various bandwidth granularities; 3) adaptive routing according to the policy parameters from service provider; 4) lower computational complexity. Simulation results show that DWFA performs better than traditional overlay routing schemes such as optical-first-routing (OFR) and electrical-first-routing (EFR), in terms of traffic blocking ratio, traffic blocking fairness, average traffic logical hop counts, and global network resource utilization. It has been proved that the DWFA is a simple, comprehensive, and practical scheme of integrated routing in optical Internet for service providers.

• Journal of KIISE:Information Networking
• /
• v.31 no.2
• /
• pp.123-130
• /
• 2004

Routing and wavelength assignment(RWA) problem is an important issue in optical transport networks based on wavelength division multiplexing(WDM) technique. It is typically solved using a combination of linear programming and graph coloring, or path selection based graph algorithms. Such methods are either complex or make extensive use of heuristics. In this paper we propose a novel and efficient approach which basically obtains the maximum edge disjoint paths (EDPs) for each source-destination demand pair. And those EDPs obtained are stored in Lookup Table and used for the update of weight matrix. Routes are determined in order by the weight matrix for the demand set. The comprehensive computer simulation shows that the Proposed algorithm uses similar or fewer wavelengths with significantly less execution time than bounded greedy approach (BGA) for EDP which is currently known to be effective in practice.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37C no.11
• /
• pp.1148-1161
• /
• 2012

Recently, developments in the field of communication and network technologies induced new paradigm in the defense weapon system. As a consequence, military authorities develop the Tactical Information Communication Network(TICN) system to adapt to the changing paradigm. One of the most important functions of TICN is real-time communication. As a result, TICN system needs to receive real-time information from the battlefield, and the key technology to support these features is MANET(Mobile Ad-Hoc Network) routing protocol. In this paper, we analyze problems of the shortest path scheme in tactical Ad-Hoc networks, which is widely used in common Ad-Hoc networks. We propose efficient routing protocol for tactical MANET by considering the environment of small combat units, such as node position, speed and data size. The proposed algorithm shows reliable data transfer and low latency in battlefield.