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 16C, Issue 6 - Dec 2009
Volume 16C, Issue 5 - Oct 2009
Volume 16C, Issue 4 - Aug 2009
Volume 16C, Issue 3 - Jun 2009
Volume 16C, Issue 2 - Apr 2009
Volume 16C, Issue 1 - Feb 2009
Selecting the target year
Classification and Performance Evaluation of Reputation-Based Trust Model in Ad-hoc Networks
Park, Seong-Soo ; Lee, Jong-Hyouk ; Chung, Tai-Myoung ;
The KIPS Transactions:PartC, volume 16C, issue 2, 2009, Pages 143~150
DOI : 10.3745/KIPSTC.2009.16-C.2.143
In trust-based networks, it is very important how to decide a node is trustworthy when one node performs communications with other node. In current networks based on trust, a node creates a new trust value from observation and then establishes an intercommunication path through the process of evaluating a targeted communication node. In our paper, we propose four trust models in which a new node enters a cluster and finds a target node to create a communication in ad-hoc networks. The proposed models have been classified according to the existence of reputation server and the trust evaluation functions. Through the proposed model, we found that new node finds target node more quickly in which there exists a reputation server in the cluster and considers neighbor node`s recommendation as well as own experience information when calculates trust values. As our performance analysis, we focus the communication delay time to generate a final trust value for each trust model.
Energy Efficient Distributed Intrusion Detection Architecture using mHEED on Sensor Networks
Kim, Mi-Hui ; Kim, Ji-Sun ; Chae, Ki-Joon ;
The KIPS Transactions:PartC, volume 16C, issue 2, 2009, Pages 151~164
DOI : 10.3745/KIPSTC.2009.16-C.2.151
The importance of sensor networks as a base of ubiquitous computing realization is being highlighted, and espicially the security is recognized as an important research isuue, because of their characteristics.Several efforts are underway to provide security services in sensor networks, but most of them are preventive approaches based on cryptography. However, sensor nodes are extremely vulnerable to capture or key compromise. To ensure the security of the network, it is critical to develop security Intrusion Detection System (IDS) that can survive malicious attacks from "insiders" who have access to keying materials or the full control of some nodes, taking their charateristics into consideration. In this perper, we design a distributed and adaptive IDS architecture on sensor networks, respecting both of energy efficiency and IDS efficiency. Utilizing a modified HEED algorithm, a clustering algorithm, distributed IDS nodes (dIDS) are selected according to node`s residual energy and degree. Then the monitoring results of dIDSswith detection codes are transferred to dIDSs in next round, in order to perform consecutive and integrated IDS process and urgent report are sent through high priority messages. With the simulation we show that the superiorities of our architecture in the the efficiency, overhead, and detection capability view, in comparison with a recent existent research, adaptive IDS.
An Authentication and Handoff Mechanism using AAA and HMIPv6 on NEMO Environment
Choi, Kyung ; Kim, Mi-Hui ; Chae, Ki-Joon ;
The KIPS Transactions:PartC, volume 16C, issue 2, 2009, Pages 165~182
DOI : 10.3745/KIPSTC.2009.16-C.2.165
Mobile IPv6 spends considerable bandwidth considering that its signal volume is proportional to the mobile and also it should be strengthened to support the binding signal volume, the traffic, and effective mobility. So, the study in NEMO(Network Mobility), an extended version of Mobile IPv6, has been conducted. NEMO provides its mobility by putting several mobiles and more than one portable router into one unit called as mobile network. Because nodes access Internet via the portable router at this time, it receives transparency without any additional work and that much reduces binding signal while solving binding storm. By supporting mobility, NEMO is able to have various mobile structures which realize several networks hierarchically and it is necessary to improve its safety and security by authenticating among the upper networks or the lower ones while moving. Also, it is extremely required to begin a study in the device to improve efficiency accompanied with mobility, which is executed by the fast hand-off as well as the safe authentication. For those reasons, this paper not only classifies various NEMO mobile scenarios into 7 ways, but also provides AAA authentication of each scenario, the authentication through the safety authentication and fast handoff authentication using F+HMIPv6 and the way to reduce both signaling volume and packet delays efficiently during the handoff.
A New Pairwise Key Pre-Distribution Scheme for Wireless Sensor Networks
Kim, Tae-Yeon ;
The KIPS Transactions:PartC, volume 16C, issue 2, 2009, Pages 183~188
DOI : 10.3745/KIPSTC.2009.16-C.2.183
Wireless sensor networks will be broadly deployed in the real world and widely utilized for various applications. A prerequisite for secure communication among the sensor nodes is that the nodes should share a session key to bootstrap their trust relationship. The open problems are how to verify the identity of communicating nodes and how to minimize any information about the keys disclosed to the other side during key agreement. At any rate, any one of the existing schemes cannot perfectly solve these problems due to some drawbacks. Accordingly, we propose a new pre-distribution scheme with the following merits. First, it supports authentication services. Second, each node can only find some indices of key spaces that are shared with the other side, without revealing unshared key information. Lastly, it substantially improves resilience of network against node capture. Performance and security analyses have proven that our scheme is suitable for sensor networks in terms of performance and security aspects.
The Privacy Protection Mechanism Applicable to Private Zone of Mobile RFID Systems
Kim, Dong-Chul ; Chun, Ji-Young ; Choi, Eun-Young ; Lee, Dong-Hoon ;
The KIPS Transactions:PartC, volume 16C, issue 2, 2009, Pages 189~198
DOI : 10.3745/KIPSTC.2009.16-C.2.189
Mobile RFID system is a next generation technology which combines the existing RFID systems with mobile systems. It is newly expected to provide additional services and will be broadly used in everyday life; however, it sometimes causes the privacy or security problems generated by existing RFID systems and the additional privacy or security problems. Moreover, even if many methods have been proposed to solve those problems, it is still difficult to adapt to reality or to guarantee the security perfectly. Therefore, in this paper, we propose the secure and practicable privacy protection mechanism suitable to mobile RFID systems. proposing mechanism is applicable the mechanism to Private Zone of mobile RFID systems which require to protect the privacy. This mechanism suggests that own tagging-products needed to protect privacy using mobile reader of personal don`t provide any information to other readers except their own reader. In addition to, proposing mechanism is the efficient mechanism which largely reduces the process to maintain the synchronization when happen to the DoS attack or system error.
An Efficient and Secure Group Key Distribution Protocol for IP-based Pay-TV Systems
Kim, Jung-Yoon ; Choi, Hyoung-Kee ;
The KIPS Transactions:PartC, volume 16C, issue 2, 2009, Pages 199~208
DOI : 10.3745/KIPSTC.2009.16-C.2.199
Recently,IP-based broadcasting systems,such as Mobile-TV and IP-TV, have been widely deployed. These systems require a security system to allow only authorized subscribers access to broadcasting services. We analyzed the Conditional Access System, which is a security system used in the IP-based Pay-TV systems. A weakness of the system is that it does not scale well when the system experiences frequent membership changes. In this paper, we propose a group key distribution protocol which overcomes the scalability problem by reducing communication and computation overheads without loss of security strength. Our experimental results show that computation delay of the proposed protocol is smaller than one of the Conditional Access System. This is attributed to the fact that the proposed protocol replaces expensive encryption and decryption with relatively inexpensive arithmetic operations. In addition, the proposed protocol can help to set up a secure channel between a server and a client with the minimum additional overhead.
Efficient Flooding Mechanisms with Considering Data Transmission Characteristics of the Wireless Sensor Network
Ahn, Sang-Hyun ; Lim, Yu-Jin ; Kim, Mahn-Hee ;
The KIPS Transactions:PartC, volume 16C, issue 2, 2009, Pages 209~216
DOI : 10.3745/KIPSTC.2009.16-C.2.209
In the wireless sensor network, flooding is required for the dissemination of queries and event announcements. The simple flooding causes the implosion and the overlap problems, so the simple flooding may result in the reduced network lifetime. Therefore, in this paper, we propose the flooding overlay structure (FOS) so that the overhead caused by flooding can be reduced. We propose two variants of FOS mechanisms, the centralized FOS (CFOS) and the distributed FOS (DFOS). In CFOS, the sink collects the network topology information and selects forwarding nodes based on that information. On the other hand, DFOS allows each sensor node to decide whether to act as a forwarding node or not based on its local information. For the performance evaluation of our proposed mechanisms, we carry out NS-2 based simulations and compare ours with the simple flooding and the gossiping. The simulation results indicate that the proposed FOS mechanisms outperform the simple flooding in terms of the network lifetime and the gossiping in terms of the data delivery ratio.
The Number of ONU based Priority Scheduling Mechanism for IPTV Multicast Service
Kwon, Young-Hwan ; Choi, Jun-Kyun ;
The KIPS Transactions:PartC, volume 16C, issue 2, 2009, Pages 217~222
DOI : 10.3745/KIPSTC.2009.16-C.2.217
This paper proposes the number of Optical Network Unit (ONU) based priority scheduling mechanism over Ethernet Passive Optical Network (EPON) to support multicast Quality of Service (QoS) for Internet Protocol Television (IPTV) service. Multicast QoS is effected by the receivers` number of a packet because multicast efficiency is determined by how many receivers are received multiple copied packets. Therefore, the proposed mechanism assigns a priority with the number of ONUs to allocate high priority to IPTV services used by many people and firstly transmits a packet with high priority. By doing so, we show that the proposed mechanism support favorite IPTV services with better and stable QoS in spite of congestion.
Cross-Layer Service Discovery Scheme for Hybrid Ad-hoc Networks
Kim, Moon-Jeong ; Eom, Young-Ik ;
The KIPS Transactions:PartC, volume 16C, issue 2, 2009, Pages 223~228
DOI : 10.3745/KIPSTC.2009.16-C.2.223
Efficient service discovery mechanism is a crucial feature for a hybrid ad-hoc network supporting extension of a wireless ad-hoc network to the Internet. We propose an efficient cross-layer service discovery mechanism using non-disjoint multi-path source routing protocol for hybrid ad-hoc networks. Our scheme has advantages of multi-path routing protocol and cross-layer service discovery. Intuitively, it is not difficult to imagine that the cross-layer service discovery mechanism could result in a decreased number of messages compared to the traditional approach for handling routing independently from service discovery. By simulation, we show that faster route recovery is possible by maintaining multiple routing paths in each node, and the route maintenance overhead can be reduced by limiting the number of multiple routing paths and by maintaining link/node non-disjoint multi-path.
Ranging Enhancement using Frequency Offset Compensation in High Rate UWB
Nam, Yoon-Seok ; Jang, Ik-Hyeon ;
The KIPS Transactions:PartC, volume 16C, issue 2, 2009, Pages 229~236
DOI : 10.3745/KIPSTC.2009.16-C.2.229
UWB signal with high resolution capability can be used to estimate ranging and positioning in wireless personal area networks. The clock frequency differences of nodes have serious affects on asynchronous ranging methods to estimate locations of mobile nodes. The specification of high rate UWB describes successive TWR method with the estimation of a relative clock frequency offset. In this paper, we complete the ranging equations using relative frequency offset and time information, and propose a method to estimate the exact frequency offsets. We evaluate the ranging algorithms with simulation. The results show that the performances of the algorithms using frequency offsets are very close without noise. But, at noise environment, the method of exact frequency offsets shows better performance than that of relative frequency offsets.
Adaptive Congestion Control for Effective Data Transmission in Wireless Sensor Networks
Lee, Joa-Hyoung ; Gim, Dong-Gug ; Jung, In-Bum ;
The KIPS Transactions:PartC, volume 16C, issue 2, 2009, Pages 237~244
DOI : 10.3745/KIPSTC.2009.16-C.2.237
The congestion in wireless sensor network increases the ratio of data loss and causes the delay of data. The existing congestion protocols for wireless sensor network reduces the amount of transmission by control the sampling frequency of the sensor nodes related to the congestion when the congestion has occurred and was detected. However, the control method of sampling frequency is not applicable on the situation which is sensitive to the temporal data loss. In the paper, we propose a new congestion control, ACT - Adaptive Congestion conTrol. The ACT monitors the network traffic with the queue usage and detects the congestion based on the multi level threshold of queue usage. Given network congestion, the ACT increases the efficiency of network by adaptive flow control method which adjusts the frequency of packet transmission and guarantees the fairness of packet transmission between nodes. Furthermore, ACT increases the quality of data by using the variable compression method. Through experiment, we show that ACT increases the network efficiency and guarantees the fairness to sensor nodes compared with existing method.
Doughnut: An improved P2P Pastry Overlay Network with Efficient Locality and Caching
Kim, Myung-Won ; Kwak, Hu-Keun ; Chung, Kyu-Sik ;
The KIPS Transactions:PartC, volume 16C, issue 2, 2009, Pages 245~256
DOI : 10.3745/KIPSTC.2009.16-C.2.245
Pastry overlay network is one of structured P2Ps using DHT(Distributed Hash Table). To reduce the number of messages among nodes, Rosary and LAR have been proposed by exploiting spatial locality and caching, respectively, in the Pastry. Rosary consists of Inter-Pastry and Intra-Pastry. A root node is assigned as a representative in each Intra-Pastry and it has the responsibility of Inter-Pastry and Intra-Pastry routing. Therefore, Rosary has several disadvantages; 1) low fault tolerance in case of root node failure 2) routing hop count increases because of the use of root nodes compared to the existing structured P2Ps, and 3) the communication load is concentrated in some specific areas. LAR has inefficient problems in that caching is not distributed among nodes in Intra-Pastry and caching is used by only nodes in the Intra-Pastry. In this paper, we propose an improved Pastry called Doughnut to overcome the above problems of Rosary and LAR. By dividing nodes with the local characteristics, the Doughnut consists of Inter-Pastry and Intra-Pastry, and all nodes have the responsibility of Inter-Pastry and Intra-Pastry routing. This results in that all nodes perform the role of the existing root node. This solves the problems of the reducing of fault-tolerance, the increasing of routing hop count, and the not-distributed communication load. Also Doughnut can use cache effectively because it guarantees the even cache distribution in local(Intra-Pastry) and the cache contents in local can be used in the other local. The proposed algorithm is implemented using simulator and the experimental results show the effectiveness of the proposed method compared to the existing method.
A Light-weight PKM Mutual Authentication Protocol for Improving Initial Authentication in WiMAX
Jeong, Yoon-Su ; Kim, Yong-Tae ; Park, Gil-Cheol ; Lee, Sang-Ho ;
The KIPS Transactions:PartC, volume 16C, issue 2, 2009, Pages 257~266
DOI : 10.3745/KIPSTC.2009.16-C.2.257
Now a days, as increased the use of mobile units like a laptop computer and PDA, the demand for high speed internet service is increasing. On the other hand, PKMv2 which is provided from IEEE 802.16e cannot support fully on the security of high speed internet service. This paper proposes light-weight mutual authentication protocol which solved security problem of PKMv2 related to integrity of mobile node for transmission of safe high speed data of mobile node operating in mobile WiMAX environment. Proposed mutual authentication protocol increases the efficiency as the user in network can move in network safely without additional procedure of authentication between subscriber and base station after user`s initial authentication. Also, the proposed mutual authentication protocol is safe from the security attack (the man-in-the-middle attack and reply attack) between subscriber and base station by generating a key adopt to PRF() function using random number and secret value in order to secure certification.
A DFS-ALOHA Algorithm with Slot Congestion Rates in a RFID System
Lee, Jae-Ku ; Choi, Seung-Sik ;
The KIPS Transactions:PartC, volume 16C, issue 2, 2009, Pages 267~274
DOI : 10.3745/KIPSTC.2009.16-C.2.267
For the implementation of a RFID system, an anti-collision algorithm is required to identify multiple tags within the range of a RFID Reader. There are two methods of anti-collision algorithms for the identification of multiple tags, conclusive algorithms based on tree and stochastic algorithms based on slotted ALOHA. In this paper, we propose a Dynamic Framed Slotted ALOHA-Slot Congestion(DFSA-SC) Algorithm. The proposed algorithm improves the efficiency of collision resolution. The performance of the proposed DFSA-SC algorithm is showed by simulation. The identification time of the proposed algorithm is shorter than that of the existing DFSA algorithm. Furthermore, when the bit duplication of the tagID is higher, the proposed algorithm is more efficient than Query Tree algorithm.
Design of Context-Aware Module for Convergence Service Enabler in BcN Environment
Jeong, Jong-Myung ; Kim, Ji-Ho ; Song, Oh-Young ;
The KIPS Transactions:PartC, volume 16C, issue 2, 2009, Pages 275~284
DOI : 10.3745/KIPSTC.2009.16-C.2.275
Fast development of network technology and digitalization of various kinds of information are accelerating the convergence of between them. Accordingly, an environment for integrated service is needed, where users can be provided with various kinds of information such as voice, video, and text, using even different kinds of devices in heterogeneous networks for communication and broadcasting. In general, enablers integrate several functions to provide with various services in application layer based on IMS in BcN including even different kinds of networks. But in order to receiving convergence services, we must reason the environment of the user through the profiles of the networks and the devices and provide a suitable service to the user. In this paper, we will propose an efficient architecture and functions of a context-aware module which decides the appropriate services based on the profiles in the IMS enabler and its convergence service environments.