Yoon-Cheol Hwang

Location-Based Routing Algorithm Using Clustering in the MANET

Mobile ad hoc network(MANET) can increase independence and flexibility of network because it is consisted of mobile nodes without the aid of fixed infra, but, by unrestricted for the participation and breakaway of node, it has the difficulty in routing which is a basic function of network operation. To solve those problems, a suggestion is the location-based routing algorithm using geological or logical location information. The suggested algorithm which is based on cluster for location information of node is applicable to network of discrete situation, which guarantees extension and mobility. By performance verification compare DSR and AODV routing algorithm with packet transmission ratio, routing overheads, and average communication expense as node increases.

Advanced Efficiency and Stability Combined Weight Based Distributed Clustering Algorithm in MANET

A mobile ad-hoc network is a kind of autonomic network composed only of mobile nodes. The range of its availability is being expanded because of development of communication technology and terminal devices. However, since the nodes participating in network have mobility by themselves, the network topology has dynamic characteristics, compared with the existing fixed network, giving lots of influences on network performances. Therefore, this paper proposes a combined weight-based distribution clustering algorithm with hierarchical structure that can maintain topology of MANET as stable as possible, thereby optimizing network performance and making efficient resource allocation for mobile nodes. The proposed algorithm can optimize network performances in dynamic MANET environment and minimize energy consumption by improving the problems of efficiency and stability the existing clustering algorithms are facing with.

RFID Authentication Protocol Using Synchronized Secret Information

In this paper, we propose an RFID authentication protocol that enforces user privacy and protects against tag cloning. Our scheme is based on the use of a secret shared between tag and database that is refreshed to avoid tag tracing. Additionally, our protocol is very simple and it can be implemented easily with the use of standard cryptographic hash functions.

Key Pre-distribution Scheme for Little Storage Space and Strong Security Strength in Large-Scale Wireless Sensor Network

WSNs, since the attacks, such as jamming or eavesdropping without physical access, easily occur, security is one of the important requirements for WSNs. The key pre- distribution scheme, recently being researched for advances of security in WSNs, distributes keys with probability with the use of q-composite random key pre-distribution method, but there is a high probability that there is no key shared between sensor nodes, and it takes lots of time and energy to find out the shared key, therefore it is not suitable for WSNs. In order to enhance stability of a node that plays a role of gateway without depending on probabilistic key, this paper proposes a key pre-distribution scheme combined with random key pre-distribution scheme and double hash chain. Since the proposed scheme can maintain small storage space and strong security strength, it is more efficient than the existing schemes with the same security strengths. In addition, since it uses a small size of key generation key set, it can reduce a great deal of storage overhead.

NIS03-5: An Efficient Mutual Authentication Protocol using Biometric Information in Ubiquitous Computing

In a ubiquitous computing environment, various principals can be used at any one time with different devices interconnected by different networks. This paper proposes a mutual authentication method using the biometric information of each device in a situation where one device communicates with another in a heterogeneous environment. The proposed scheme avoids the use of centralized entities and is designed to be agile in a peer-to-peer environment.