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 15C, Issue 6 - Dec 2008
Volume 15C, Issue 5 - Oct 2008
Volume 15C, Issue 4 - Aug 2008
Volume 15C, Issue 3 - Jun 2008
Volume 15C, Issue 2 - Apr 2008
Volume 15C, Issue 1 - Feb 2008
Selecting the target year
Plat-Based Key Pre-Distribution Scheme in Sensor Network
Maeng, Young-Jae ; Mohaisen, Abedelaziz ; Lee, Kyung-Hee ; Nyang, Dae-Hun ;
The KIPS Transactions:PartC, volume 15C, issue 1, 2008, Pages 1~8
DOI : 10.3745/KIPSTC.2008.15-C.1.1
The security of wireless sensor networks is a challenging research area where the resources constraints are a bottleneck for any successful security design. Due to their computational feasibility, symmetric key algorithms that require key pre-distribution are more desirable for use in these networks. In the pre-distribution scheme, keys or keying materials are assigned to each node prior deployment to guarantee a secure communication within the entire network. Though several works are introduced on this issue, yet the connectivity and resiliency are imperfectly handled. In this paper, we revisit the grid based key pre-distribution scheme aiming to improve the connectivity, introduce a higher resiliency level, simplify the logic of key establishment and maintain same level of used of resources usage. The core of our modification relies on introducing the novel plat-based polynomial assignment and key establishment mechanism. To demonstrate the advantageous properties of our scheme over the revisited one, details of consumed resources, resulting connectivity, security and comparisons with relevant works are introduced.
Mutual Attestation Protocol using Software-based Attestation Scheme in Sensor Network Environments
Heo, Kyung-Soo ; Choi, Hyun-Woo ; Jang, Hyun-Su ; Eom, Young-Ik ;
The KIPS Transactions:PartC, volume 15C, issue 1, 2008, Pages 9~18
DOI : 10.3745/KIPSTC.2008.15-C.1.9
Prevention of attacks being made through program modification in sensor nodes is one of the important security issues. The software-based attestation technology that verifies the running code by checking whether it is modified or not in sensor nodes is being used to solve the attack problem. However, the current software-based attestation techniques are not appropriate in sensor networks because not only they are targeting static networks that member nodes does not move, but also they lacks consideration on the environment that the trusted verifier may not exist. This paper proposes a mutual attestation protocol that is suitable for sensor networks by using SWATT(Software-based ATTestation) technique. In the proposed protocol, sensor nodes periodically notify its membership to neighbor nodes and carry out mutual attestation procedure with neighbor nodes by using SWATT technique. With the proposed protocol, verification device detects the sensor nodes compromised by malicious attacks in the sensor network environments without trusted verifier and the sensor networks can be composed of only the verified nodes.
A Data Centric Storage based on Adaptive Local Trajectory for Sensor Networks
Lim, Hwa-Jung ; Lee, Joa-Hyoung ; Yang, Dong-Il ; Tscha, Yeong-Hwan ; Lee, Heon-Guil ;
The KIPS Transactions:PartC, volume 15C, issue 1, 2008, Pages 19~30
DOI : 10.3745/KIPSTC.2008.15-C.1.19
Sensor nodes are used as a storage space in the data centric storage method for sensor networks. Sensor nodes save the data to the node which is computed by hash table and users also access to the node to get the data by using hash table. One of the problems which the data centric storage method has is that queries from many users who are interested in the popular data could be concentrated to one node. In this case, responses for queries could be delayed and the energy of heavy loaded node could be dissipated fast. This would lead to reduction of network life time. In this paper, ALT, Data Centric Storage based on Adaptive Local Trajectory, is proposed as scalable data centric storage method for sensor network. ALT constructs trajectory around the storage node. The scope of trajectory is increased or decreased based on the query frequency. ALT distributes the query processing loads to several nodes so that delay of response is reduced and energy dissipation is also distributed.
Asynchronous Ranging Method using Estimated Frequency Differences in Wireless Sensor Networks
Nam, Yoon-Seok ; Huh, Jae-Doo ;
The KIPS Transactions:PartC, volume 15C, issue 1, 2008, Pages 31~36
DOI : 10.3745/KIPSTC.2008.15-C.1.31
The clock frequency difference of sensor nodes is one of main parameters in TOF estimation and affect to degrade ranging algorithms to estimate positions of mobile nodes in wireless sensor networks. The specification of IEEE802.15.4a describes asynchronous TWR and SDS-TWR insensitive to frequency difference without any additional network synchronization. But the TWR and SDS-TWR can not eliminate sufficiently the effect of frequency difference of node pair, packet processing delay and its difference. Especially use of low cost oscillator with wide range offset, sensor node with different hardware and software can make the positioning errors worse. We propose an estimation method of frequency differences, and apply the measured frequency differences to TWR and SDS-TWR. We evaluate the performance of the proposed algorithm with simulation, and make certain that the proposed method enhances the performance of existing algorithms with positioning errors less than 25 cm.
A Crossover Node Discovery and Local Repair Mechanism for Reducing the Signaling Delay of Resource Reservation on HMIPv6 Networks
Byun, Hae-Sun ; Lee, Mee-Jeong ;
The KIPS Transactions:PartC, volume 15C, issue 1, 2008, Pages 37~44
DOI : 10.3745/KIPSTC.2008.15-C.1.37
In order to minimize the signaling delay for a resource reservation on the new routing path after the handover of Mobile Node(MN) is completed, it is important to discover the crossover node where the old and new routing paths meet. With the 크로스오버 노드 being found, the signaling messages only need to be transferred on the changed part of the end-to-end path. The crossover node is generally discovered using the end-to-end Session ID(SID) of the established session between MN and Correspondent Node(CN). However, in the Hierarchical Mobile IPv6(HMIPv6) network, if the Mobile Anchor Point (MAP) reserves the resource by aggregate with the Home Agent(HA), the crossover node discovery cannot be performed in the general way since the aggregate SID that has established between the previous MAP and HA is different from the that of the current MAP and HA after MN's handover. In this paper, we propose a mechanism to discover the crossover node within the tunnel between the MAP and the HA in an HMIPv6 network, assuming that the Next Steps in Signaling(NSIS) is deployed for the resource reservation and the aggregate reservation is applied over the MAP and HA tunnel. The local repair required for the change of path is performed upon the crossover node discovery. The simulation results show that the proposed scheme reduces the signaling delay for the reservation and outperforms the existing scheme with respect to throughput during the handover.
An Efficient Reactive Routing Protocol based on the Multi-rate Aware MAC for Mobile Ad Hoc Networks
Lee, Jae-Hwoon ; Lim, Yu-Jin ; Ahn, Sang-Hyun ;
The KIPS Transactions:PartC, volume 15C, issue 1, 2008, Pages 45~50
DOI : 10.3745/KIPSTC.2008.15-C.1.45
Mobile ad hoc networks (MANETs) allow mobile nodes to communicate among themselves via wireless multiple hops without the help of the wired infrastructure. Therefore, in the MANET, a route setup mechanism that makes nodes not within each other's transmission range communicate is required and, for this, the Ad-hoc On-demand Distance Vector (AODV) was proposed as one of the reactive routing protocols well suited for the characteristics of the MANET. AODV uses the hop count as the routing metric and, as a result, a node selects the farthest neighbor node as its next hop on a route, which results in a problem of deteriorating the overall network throughput because of selecting a relatively low data rate route. In this paper, we propose an efficient reactive routing protocol based on the multi-rate aware MAC. Through the simulations, we analyze the performance of our proposed mechanism and, from the simulation results, we show that our proposed mechanism outperforms the existing mechanism.
Design and Evaluation of a New Multicast Protocol in Large Micro-Mobility Environments
Kang, Ho-Seok ; Shim, Young-Chul ;
The KIPS Transactions:PartC, volume 15C, issue 1, 2008, Pages 51~60
DOI : 10.3745/KIPSTC.2008.15-C.1.51
Micro-mobility protocols have been developed to reduce the control message overhead due to movements of mobile nodes. With the spread of mobile devices, services using mobile nodes are increasing and multicast services are becoming more important in providing multimedia services. In this paper we propose a new multicast protocol suitable for micro-mobility environments. The proposed protocol is designed to maintain optimal multicast routing paths and continue to provide multicast services without disruption in spite of frequent handoffs due to movements of mobile nodes. We used simulation to evaluate the proposed protocol, compared its performance with existing multicast protocols for mobile environments including bi-directional tunneling, remote subscription, and MMA, and observed that the proposed protocol exhibited better performance in terms of transmission success ratio and overhead on the network.
Design and Implementation of the Management Agent for Mobile Devices based on OMA DM
Shin, Jae-Young ; Jung, Young-Woo ; Ko, Kwang-Sun ; Eom, Young-Ik ;
The KIPS Transactions:PartC, volume 15C, issue 1, 2008, Pages 61~68
DOI : 10.3745/KIPSTC.2008.15-C.1.61
With the rapid advancement of mobile communication, mobile devices are evolving into convergence devices with various multimedia capabilities. But, high performance of devices demands complicated settings, and thus contains latent error possibilities, and poor system performance caused by the collision of different softwares. To solve these problems, device management becomes an important issue. Open Mobile Alliance(OMA) developed OMA DM(Device Management), which is a device management standard. Recently released OMA DM v1.2 provides improved mobile device management methods compared to earlier versions. This paper introduces design and implementation of OMA DM v1.2 based management agent. By using Tree and Description Serialization(TNDS) for acquiring, adding, and editing objects in the mobile devices, it provides more effective device management with small amount of network traffic.
An Efficient Exchange-Method of a User Profile for Adapted Contents Services
Kim, Kyung-Sik ; Lim, Jong-Hyun ; Kim, Seung-Hoon ; Lee, Jae-Dong ;
The KIPS Transactions:PartC, volume 15C, issue 1, 2008, Pages 69~78
DOI : 10.3745/KIPSTC.2008.15-C.1.69
In this paper, we propose the effective exchange-method of a user profile for adapted contents services in the contents adaptation system. The profiles continuously exchange among the devices of contents adaption system for providing the adapted contents to a user. The profile should be also exchanged according to periodic, aperiodic, event, request and response. Consequently, a lot of network traffic occur and computing power require. Solving theses problem, the profile exchange research needs. we analyze creation information, exchange information, and exchange form of the profile information in contents adaptation system for effective profile exchange and define exchange procedure of the profile using the analyzed profile information. we also propose providing method of the profile configured information for decreasing profile processing time and user setting method for decreasing the number of profile transmission. As a result of performance evaluation, providing method of the profile configured information reduce 7% processing time and user setting method decrease the number of profile transmission are effective to exchange the profile.