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
Design and Analysis of a Secure Protocol for the P3P Standard
Choi, Hyun-Woo ; Jang, Hyun-Su ; Ko, Kwang-Sun ; Kim, Gu-Su ; Eom, Young-Ik ;
The KIPS Transactions:PartC, volume 14C, issue 7, 2007, Pages 545~552
DOI : 10.3745/KIPSTC.2007.14-C.7.545
P3P(Platform for Privacy Preference) that is used in the World Wide Web is a standard to define and negotiate policies about definition, transmission, collection, and maintenance of personal information. Current P3P standard provides methods that define client personal information protection policy and P3P policy associated with web server. It also provides a method that compares these two policies. The current P3P standard, however, does not handle detail functions for safe transmission of the personal information and data. Also, it does not handle problems that can be induced by the detail functions. In this paper, in order to solve these problems, we propose a Secure P3P(S-P3P) protocol, which is a security protocol for the current P3P standard, offers mutual authentication between the web server and the client, and guarantees integrity and confidentiality of the messages and data. Furthermore, a S-P3P protocol provides non-repudiation on transmission and reception of personal information that is transmitted from the client to the web server.
Communication-Efficient Representations for Certificate Revocation in Wireless Sensor Network
Maeng, Young-Jae ; Mohaisen, Abedelaziz ; Lee, Kyung-Hee ; Nyang, Dae-Hun ;
The KIPS Transactions:PartC, volume 14C, issue 7, 2007, Pages 553~558
DOI : 10.3745/KIPSTC.2007.14-C.7.553
In this paper, we introduce a set of structures and algorithms for communication efficient public key revocation in wireless sensor networks. Unlike the traditional networks, wireless sensor network is subjected to resources constraints. Thus, traditional public key revocation mechanisms such like the ordinary certificate revocation list is unsuitable to be used. This unsuitability is due to the huge size of required representation space for the different keys` identifiers and the revocation communication as the set of revoked keys grow. In this work, we introduce two communication-efficient schemes for the certificate revocation. In the first scheme, we utilize the complete subtree mechanism for the identifiers representation which is widely used in the broadcast encryption/user revocation. In the second scheme, we introduce a novel bit vector representation BVS which uses vector of relative identifiers occurrence representation. We introduce different revocation policies and present corresponding modifications of our scheme. Finally, we show how the encoding could reduce the communication overhead as well. Simulation results and comparisons are provided to show the value of our work.
An NSIS based Resource Reservation Protocol for Hose model VPN Service
Byun, Hae-Sun ; Lee, Mee-Jeong ;
The KIPS Transactions:PartC, volume 14C, issue 7, 2007, Pages 559~570
DOI : 10.3745/KIPSTC.2007.14-C.7.559
In this paper, we define a Hose-NSIS-QoSM, which reserves and manages resources according to the hose based resource provisioning mechanisms for supporting the VPN QoS(Quality of Service) using the NSIS(Next Step in Signaling) signaling protocol. Specifically, we specify the NSIS message objects, the structures of QoS NSLP(NSIS Signaling Layer Protocol)/NTLP(NSIS Transport Layer Protocol)/RMF(Resource Management Function) state tables and the processing of the signaling messages in NSIS nodes. Also, we compare the Hose-NSIS-QoSM with the Hose-RSVP-TE-QoSM that supports the hose based VPN QoS in the MPLS networks using the extended RSVP-TE mechanism.
An Adaptive Relay Node Selection Scheme for Alert Message Propagation in Inter-vehicle Communication
Kim, Tae-Hwan ; Kim, Hie-Cheol ; Hong, Won-Kee ;
The KIPS Transactions:PartC, volume 14C, issue 7, 2007, Pages 571~582
DOI : 10.3745/KIPSTC.2007.14-C.7.571
Vehicular ad-hoc networks is temporarily established through inter-vehicle communication without any additional infrastructure aids. It requires a immediate message propagation because it mainly deals with critical traffic information such as traffic accidents. The distance-based broadcast scheme is one of the representative broadcast schemes for vehicular ad-hoc network. In this scheme, a node to disseminate messages is selected based on a distance from a source node. However, a message propagation delay will be increased if the relay nodes are not placed at the border of transmission range of the source node. In particular, when the node density is low, the message propagation delay is getting longer. In this paper, we propose a time-window reservation based relay node selection scheme. A node receiving the alert message from the source node has its time-window and randomly selects its waiting time within the given time-window range. A proportional time period of the given time-window is reserved in order to reduce the message propagation delay. The experimental results show that the proposed scheme has shorter message propagation delay than the distance-based broadcast scheme irrespective of node density in VANET. In particular, when the node density is low, the proposed scheme shows about 26% shorter delay and about 46% better performance in terms of compound metric, which is a function of propagation latency and network traffic.
Minimizing non-optimal paths in multi-hop ad hoc network adopted IEEE 802.11 PSM
Whang, Do-Hyeon ; Lee, Jang-Su ; Kim, Sung-Chun ;
The KIPS Transactions:PartC, volume 14C, issue 7, 2007, Pages 583~588
DOI : 10.3745/KIPSTC.2007.14-C.7.583
It is easy to implement a temporary network with a mobile ad-hoc network in which mobile nodes have without using a infrastructure network. They depend on their limited power. Recently, it is a hot issue to save the energy in a mobile ad-hoc network because a mobile nodes have a limited energy. Research of IEEE 802.11 PSM was proposed in a single hop ad-hoc assumption. If IEEE 802.11 PSM is applied to multi hop ad-hoc network, non-optimal paths will be generated by the mobile nodes which didn`t receive a message of routing request. Non-optimal paths increase not only a network latency but also energy consumption of mobile nodes. Reconfiguring algorithm of non-optimal paths caused by the mobile nodes which didn`t receive a message of routing request is proposed in this paper. A mobile node can overhear the data in his range. A wireless medium is shared by all mobile nodes using the same bandwidth. All mobile nodes lookout the non-optimal paths with these properties of a medium, if non-optimal path is generated, optimal reconfiguring will be accomplished by modifying routing table of itself or sending a request message of routing update to nearby nodes. By reconfiguring the non-optimal paths to optimized ones, network latency and energy consumption was decreased. It is confirmed to ignore the overhead caused by a algorithm presented in this paper through the result of the simulation.
Efficient Flooding in Ad hoc Networks using Cluster Formation based on Link Density
Lee, Jae-Hyun ; Kwon, Kyung-Hee ;
The KIPS Transactions:PartC, volume 14C, issue 7, 2007, Pages 589~596
DOI : 10.3745/KIPSTC.2007.14-C.7.589
Although flooding has the disadvantages like a transmission of duplicated packets and a packet collision, it has been used frequently to find a path between a source and a sink node in a wireless ad hoc network. Clustering is one of the techniques that have been proposed to overcome those disadvantages. In this paper, we propose a new flooding mechanism in ad hoc networks using cluster formation based on the link density which means the number of neighbors within a node`s radio reach. To reduce traffic overhead in the cluster is to make the number of non-flooding nodes as large as possible. Therefore, a node with the most links in a cluster will be elected as cluster header. This method will reduce the network traffic overhead with a reliable network performance. Simulation results using NS2 show that cluster formation based on the link density can reduce redundant flooding without loss of network performance.
System Optimization, Full Data Rate and Transmission Power of Decode-and-Forward Cooperative Communication in WSN
Kim, Gun-Seok ; Kong, Hyung-Yun ;
The KIPS Transactions:PartC, volume 14C, issue 7, 2007, Pages 597~602
DOI : 10.3745/KIPSTC.2007.14-C.7.597
In conventional cooperative communication data rate is 1/2 than non cooperative protocols. In this paper, we propose a full data rate DF (Decode and Forward) cooperative transmission scheme. Proposed scheme is based on time division multiplexing (TDM) channel access. When DF protocol has full data rate, it can not obtain diversity gain under the pairwise error probability (PEP) view point. If it increases time slot to obtain diversity gain, then data rate is reduced. The proposed algorithm uses orthogonal frequency and constellation rotation to obtain both full data rate and diversity order 2. Moreover, performance is analyzed according to distance and optimized components that affect the system performance by using computer simulation. The simulation results revealed that the cooperation can save the network power up to 7dB over direct transmission and 5dB over multi-hop transmission at BER of
. Besides, it can improve date rate of system compared with the conventional DF protocol.
Performance Analysis of Handover Trigger Based on Signal Strength Measurement
Park, Jae-Sung ; Lim, Yu-Jin ;
The KIPS Transactions:PartC, volume 14C, issue 7, 2007, Pages 603~610
DOI : 10.3745/KIPSTC.2007.14-C.7.603
Effective handover decision is important for providing seamless services to mobile users. In this paper, we propose an analysis framework to evaluate the performance of handover decision based on received signal strength (RSS) measurements in terms of the late notification and false alarm probability. In our framework, we consider mobility of a mobile user, signaling delays for exchanging messages related to handover protocols, cell sizes and RSS measurement interval to stabilize RSS reading due to random measurement errors. By quantitatively scrutinizing the impact of each parameter on the late notification and false alarms, we suggest the research directions for effective handover decision mechanism that may provide fast and reliable handover.
A Fuzzy Routing Protocol for Wireless Sensor Network
Lee, Byong-Kwon ; Jeon, Joong-Nam ;
The KIPS Transactions:PartC, volume 14C, issue 7, 2007, Pages 611~620
DOI : 10.3745/KIPSTC.2007.14-C.7.611
Distributing the routing path over the entire network is an important factor to maintain the lifetime of wireless sensor network as long as possible. This paper proposes a fuzzy routing protocol that decides a routing path based on the fuzzy control rules. The fuzzy controller receives the energy values, distances, and hop counts of possible route paths as input, and the inference engine produces the contribution factors for each of route paths. The route path with the largest contribution factor is elected as the final routing path. The nodes contained in the routing path reduce their energy after transmitting a data packet so as to prevent the same route path from being selected repeatedly. It makes the network traffic spreaded over the network resulting longer network lifetime. The computer simulations on TinyOS have shown that the fuzzy routing protocol is more energy efficient and has longer network lifetime compared to the existing routing protocols.