Go to the main menu
Skip to content
Go to bottom
REFERENCE LINKING PLATFORM OF KOREA S&T JOURNALS
> Journal Vol & Issue
The KIPS Transactions:PartC
Journal Basic Information
Journal DOI :
Korea Information Processing Society
Editor in Chief :
Volume & Issues
Volume 14C, Issue 7 - Dec 2007
Volume 14C, Issue 6 - Oct 2007
Volume 14C, Issue 5 - Aug 2007
Volume 14C, Issue 4 - Aug 2007
Volume 14C, Issue 3 - Jun 2007
Volume 14C, Issue 2 - Apr 2007
Volume 14C, Issue 1 - Feb 2007
Selecting the target year
An Authentication Scheme for Filtering Injected Bogus Data in Sensor Networks
Cho, Kwan-Tae ; Kim, Young-Ho ; Lee, Dong-Hoon ;
The KIPS Transactions:PartC, volume 14C, issue 5, 2007, Pages 389~394
DOI : 10.3745/KIPSTC.2007.14-C.5.389
Recently, a location-based threshold-endorsement(LTE) scheme is proposed to thwart bogus data injection attacks. The scheme exhibits much greater filtering power than earlier symmetric schemes and results in enhanced energy savings. In this paper, we show that LTE has fatal vulnerabilities. We also propose an improved scheme that mitigates the weakness and thereby achieves the original claims without lessening remarkable filtering power intended in LTE.
A Short Path Data Routing Protocol for Wireless Sensor Network
Ahn, Kwang-Seon ;
The KIPS Transactions:PartC, volume 14C, issue 5, 2007, Pages 395~402
DOI : 10.3745/KIPSTC.2007.14-C.5.395
Wireless sensor networks have many sensor nodes which response sudden events in a sensor fields. Some efficient routing protocol is required in a sensor networks with mobile sink node. A data-path template is offered for the data announcement and data request from source node and sink node respectively. Sensed data are transferred from source node to sink node using short-distance calculation. Typical protocols for the wireless networks with mobile sink are TTDD(Two-Tier Data Dissemination) and CBPER(Cluster-Based Power-Efficient Routing). The porposed SPDR(Short-Path Data Routing) protocol in this paper shows more improved energy efficiencies from the result of simulations than the typical protocols.
A Secure Data Transmission Mechanism for Sensor Network Communication
Doh, In-Shil ; Chae, Ki-Joon ;
The KIPS Transactions:PartC, volume 14C, issue 5, 2007, Pages 403~410
DOI : 10.3745/KIPSTC.2007.14-C.5.403
For reliable sensor network communication, secure data transmission mechanisms are necessary. In our work, for secure communication, we cluster the network field in hexagonal shape and deploy nodes according to Gaussian distribution. After node deployment, clusterheads and gateway nodes in each cluster play the role of aggregating and delivering the sensed data with suity information all the way to the base station. Our mechanism decreases the overhead and provides food performance. It also has resilience against various routing attacks.
Design of the Covered Address Generation using the Super Increasing Sequence in Wireless Networks
Choun, Jun-Ho ; Kim, Sung-Chan ; Jang, Kun-Won ; Do, Kyung-Hwa ; Jun, Moon-Seog ;
The KIPS Transactions:PartC, volume 14C, issue 5, 2007, Pages 411~416
DOI : 10.3745/KIPSTC.2007.14-C.5.411
The General security method of wireless network provides a confidentiality of communication contents based on the cryptographic stability against a malicious host. However, this method exposes the logical and physical addresses of both sender and receiver, so transmission volume and identification of both may be exposed although concealing that content. Covered address scheme that this paper proposes generates an address to which knapsack problem using super increasing sequence is applied, and replaces the addresses of sender and receiver with addresses from super increasing sequence. Also, proposed method changes frequently secret addresses, so a malicious user cannot watch a target system or try to attack the specific host. Proposed method also changes continuously a host address that attacker takes aim at. Accordingly, an attacker who tries to use DDoS attack cannot decide the specific target system.
Performance Analysis of Routing Protocols for WLAN Mesh Networks
Park, Jae-Sung ; Lim, Yu-Jin ; Ahn, Sang-Hyun ;
The KIPS Transactions:PartC, volume 14C, issue 5, 2007, Pages 417~424
DOI : 10.3745/KIPSTC.2007.14-C.5.417
Mesh networks using WLAN technology have been paid attention as a key wireless access technology. However, many technical issues still exist for its successful deployment. One of those issues is the routing problem that addresses the path setup through a WLAN mesh network for the data exchanges between a station and a wired network. Since the characteristics of a WLAN mesh network can be very dynamic, the use of single routing protocol would not fit for all environments whether it is reactive or proactive. Therefore, it is required to develop an adaptive routing protocol that modifies itself according to the changes in the network parameters. As a logical first step for the development, an analytical model considering all the dynamic features of a WLAN mesh network is required to evaluate the performance of a reactive and a proactive routing scheme. In this paper, we propose an analytical model that makes us scrutinize the impact of the network and station parameters on the performance of each routing protocol. Our model includes the size of a mesh network, the density of stations, mobility of stations. and the duration of network topology change. We applied our model to the AODV that is a representative reactive routing protocol and DSDV that is a representative proactive routing protocol to analyze the tradeoff between AODV and DSDV in dynamic network environments. Our model is expected to help developing an adaptive routing protocol for a WLAN mesh network.
An Efficient Route Discovery using Adaptive Expanding Ring Search in AODV-based MANETs
Han, Seung-Jin ;
The KIPS Transactions:PartC, volume 14C, issue 5, 2007, Pages 425~430
DOI : 10.3745/KIPSTC.2007.14-C.5.425
Without the aid of stationary infrastructure, maintaining routing information for all nodes is inefficient in the Mobile Ad hoc Networks(MANET). It is more efficient when every time routing information is necessary that the source node broadcasts a query message to neighbour nodes. The source node using Ad hoc On-Demand distance Vector(AODV), which is one of the routing protocols of MANET, uses the Expanding Ring Search(ERS) algorithm which finds a destination node efficiently. In order to reduce the congestion of the network, ERS algorithm does not broadcast Route REQuest(RREQ) messages in the whole network. When the timer expires, if source node does not receive Route REPly(RREP) messages from the destination node, it gradually increases TTL value and broadcasts RREQ messages. Existing AODV cost a great deal to find a destination node because it uses a fixed NODE_TRAVERSAL_TIME value. Without the message which is added in existing AODV protocols, this paper measures delay time among the neighbours' nodes by making use of HELLO messages. We propose Adaptive ERS(AERS) algorithm that makes NET_TRAVERSAL_TIME optimum which apply to the measured delay time to NODE_TRAVERSAL_TIME. AERS suppresses the unnecessary messages, making NET_TRAVERSAL_TIME optimum in this paper. So we will be able to improve a network performance. We prove the effectiveness of the proposed method through simulation.
A Study on Low-Cost RFID System Mutual Authentication Scheme using Key Division
Kang, Soo-Young ; Lee, Im-Yeong ;
The KIPS Transactions:PartC, volume 14C, issue 5, 2007, Pages 431~438
DOI : 10.3745/KIPSTC.2007.14-C.5.431
RFID system is core technology that construct ubiquitous environment for replacement of barcode technology. Use ratio of RFID system rapidly increase because the technology has many good points such as identification speed, storage space, convenience etc. But low-cost tag operates easily by query of reader, so the system happened user privacy violent problem by tag information exposure. The system studied many ways for security application, but operation capability of low-cost tag is about
gates, but only
gates allocated security part. So it is difficult to apply security to the system. Therefore, this scheme uses dividing 64 bits and reduces arithmetic, so proposed scheme provide mutual authentication that can apply to low-cost RFID system. Existing methods divide by 4 and used 96 bits. However, that reduces 32 bits length for lightweight and reduced from communication number of times of 7 times to 5 times. Also, because offer security by random number than existing scheme that generate two random numbers, that is more efficient. However, uses hash function for integrity that was not offered by XOR arithmetic and added extension of proposed scheme. Extended scheme is not offered efficiency than methods that use XOR arithmetic, but identification distance is mode that is proposed secure so that can use in for RFID system.
On the Privacy Preserving Mining Association Rules by using Randomization
Kang, Ju-Sung ; Cho, Sung-Hoon ; Yi, Ok-Yeon ; Hong, Do-Won ;
The KIPS Transactions:PartC, volume 14C, issue 5, 2007, Pages 439~452
DOI : 10.3745/KIPSTC.2007.14-C.5.439
We study on the privacy preserving data mining, PPDM for short, by using randomization. The theoretical PPDM based on the secure multi-party computation techniques is not practical for its computational inefficiency. So we concentrate on a practical PPDM, especially randomization technique. We survey various privacy measures and study on the privacy preserving mining of association rules by using randomization. We propose a new randomization operator, binomial selector, for privacy preserving technique of association rule mining. A binomial selector is a special case of a select-a-size operator by Evfimievski et al.. Moreover we present some simulation results of detecting an appropriate parameter for a binomial selector. The randomization by a so-called cut-and-paste method in  is not efficient and has high variances on recovered support values for large item-sets. Our randomization by a binomial selector make up for this defects of cut-and-paste method.
Protocol-independent Information Modeling and Web Services Implementation for Resource Management in NGN Transport Stratum
Yim, Young-Eun ; Kwon, Tae-Hyun ; Kim, Choon-Hee ; Han, Tae-Man ; Jeong, You-Hyeon ; Cha, Young-Wook ;
The KIPS Transactions:PartC, volume 14C, issue 5, 2007, Pages 453~462
DOI : 10.3745/KIPSTC.2007.14-C.5.453
NGN is a packet-based converged network to support session and non-session based services in QoS-enabled broadband transport technologies. Resource and admission control functions(RACF) of NGN have been considering COPS and SNMP as resource management protocols to collect network topology and resource status information of transport network. This paper defines requirements of resource management in NGN transport network, and proposes protocol independent information model to keep consistency of data models of each resource management protocol. Based on this information model described with UML class diagram, we designed and implemented NGN resource management system on Web Services.