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 17C, Issue 6 - Dec 2010
Volume 17C, Issue 5 - Oct 2010
Volume 17C, Issue 4 - Aug 2010
Volume 17C, Issue 3 - Jun 2010
Volume 17C, Issue 2 - Apr 2010
Volume 17C, Issue 1 - Feb 2010
Selecting the target year
Mutual Authentication Mechanism for Secure Group Communications in Sensor Network
Ko, Hye-Young ; Doh, In-Shil ; Chae, Ki-Joon ;
The KIPS Transactions:PartC, volume 17C, issue 6, 2010, Pages 441~450
DOI : 10.3745/KIPSTC.2010.17C.6.441
Recently, a lot of interest is increased in sensor network which gathers various data through many sensor nodes deployed in wired and wireless network environment. However, because of the limitation in memory, computation, and energy of the sensor nodes, security problem is very important issue. In sensor network, not only the security problem, but also computing power should be seriously considered. In this paper, considering these characteristics, we make the sensor network consist of normal sensor nodes and clusterheaders with enough space and computing power, and propose a group key rekeying scheme adopting PCGR(Predistribution and local Collaborationbased Group Rekeying) for secure group communication. In our proposal, we enhance the security by minimizing the risk to safety of the entire network through verifying the new key value from clusterheader by sensor nodes. That is, to update the group keys, clusterheaders confirm sensor nodes through verifying the information from sensor nodes and send the new group keys back to authentic member nodes. The group keys sent back by the clusterheaders are verified again by sensor nodes. Through this mutual authentication, we can check if clusterheaders are compromised or not. Qualnet simulation result shows that our scheme not only guarantees secure group key rekeying but also decreasesstorage and communication overhead.
SR-ARQ Retramsission Persistence Management to Avoid TCP Spurious Timeout in a Wireless Environment
Kim, Beom-Joon ; Han, Je-Chan ;
The KIPS Transactions:PartC, volume 17C, issue 6, 2010, Pages 451~458
DOI : 10.3745/KIPSTC.2010.17C.6.451
To detect and recover packet losses over wireless links is very important in terms of reliability in packet transmission. Most wireless communication systems adopt an automatic repeat request (ARQ) protocol operating at link layer. However, it has been constantly addressed that the interaction not harmonized sufficiently between ARQ and TCP rather degrades TCP performance. In this paper, therefore, we propose an improved scheme from the aspect of the interaction with TCP loss recovery mechanism that can be applied to selective repeat ARQ (SR-ARQ) protocol and prove that the proposed scheme improves TCP performance significantly by OPNET simulations.
Implementation and Performance Evaluation of Reporting Interval-adaptive Sensor Control Scheme for Energy Efficient Data Gathering
Shon, Tae-Shik ; Choi, Hyo-Hyun ;
The KIPS Transactions:PartC, volume 17C, issue 6, 2010, Pages 459~464
DOI : 10.3745/KIPSTC.2010.17C.6.459
Due to the application-specific nature of wireless sensor networks, the sensitivity to such a requirement as data reporting latency may vary depending on the type of applications, thus requiring application-specific algorithm and protocol design paradigms which help us to maximize energy conservation and thus the network lifetime. In this paper, we implement and evaluate a novel delay-adaptive sensor scheduling scheme for energy-saving data gathering which is based on a two phase clustering (TPC), in wireless sensor networks. The TPC is implemented on sensor Mote hardwares. With the help of TPC implemented, sensors selectively use direct links for control and forwarding time critical sensed data and relay links for data forwarding based on the user delay constraints given. Implementation study shows that TPC helps the sensors to increase a significant amount of energy while collecting sensed data from sensors in a real environment.
On Improving Reliability of E-ODMRP
Jung, Young-Woo ; Park, Joon-Sang ;
The KIPS Transactions:PartC, volume 17C, issue 6, 2010, Pages 465~470
DOI : 10.3745/KIPSTC.2010.17C.6.465
In this paper we propose a method which can be used to enhance the reliability of E-ODMRP (Enhanced On-Demand Multicast Routing Protocol). E-ODMRP has low overhead compared to its predecessors since it performs periodic refresh at a rate dynamically adapted to the nodes` mobility and adopts the local recovery. Upon detecting a broken route, a node performs a local search to graft to the forwarding mesh proactively. However in E-ODMRP there is no packet recovery mechanism. A receiver may lose some packets when it is detached from the multicast tree. We propose a simple packet recovery mechanism that can be incorporated into E-ODMRP for enhanced reliability. We show via simulation that our mechanism effectively enhances the reliability of E-ODMRP.
Channel Variation Tracking based Effective Preferred BS Selection Scheme of Idle Mode Mobile device for Mobile WiMAX System
Lee, Kang-Gyu ; Youn, Hee-Yong ;
The KIPS Transactions:PartC, volume 17C, issue 6, 2010, Pages 471~484
DOI : 10.3745/KIPSTC.2010.17C.6.471
In the wireless communication systems, the power consumption of a mobile device is very important issue due to its battery limitations. Hence most of the standards for wireless networks including a mobile WiMAX system are supporting their own power saving mode in way that a mobile device is able to reduce its energy usage while in the mode. However, those standards just define the arrangement of special time intervals, called a paging listening interval, during which the device needs to receive the paging-related control messages, and they do not specify how to effectively reduce the power in many different network environments. This means the amount of power spent by the device is very dependent on the implementations of individual device-vendors, and undesirable paging loss may happen according to the channel conditions. To reduce unnecessary power usage and the risk of paging loss, this paper proposes the effective frequency/BS selection algorithm applicable to a mobile device operating in the power saving mode, which serves the device with better BS based on the tracking for channel variation. This algorithm consists of the channel estimation phase during each paging listening interval, the tracking phase for the measured results, the frequency reselection phase based on the tracking activity, and the preferred BS reselection phase. Thus the proposed method can improve the paging performance while the device is moving in the network. Also the simulation result shows that the presented scheme is superior to other candidates in energy efficiency due to the channel-adaptive frequency/BS selection.
Cooperative Frame Aggregation in IEEE 802.11n Wireless Networks
Song, Tae-Won ; Pack, Sang-Heon ;
The KIPS Transactions:PartC, volume 17C, issue 6, 2010, Pages 485~490
DOI : 10.3745/KIPSTC.2010.17C.6.485
IEEE 802.11n supports two frame aggregation schemes, aggregation for MAC service data unit (A-MSDU) and aggregation for MAC protocol data unit (A-MPDU), to improve throughput at the MAC layer. In this paper, we propose a cooperative frame aggregation (CoFA), which can recover erroneous frames in a cooperative manner based on A-MPDU. Specifically, CoFA receive multiple frames from direct and relay paths, and combined multiple frames jointly. Numerical results show that CoFA outperforms direct transmission and relay transmission over diverse channel conditions.
An Efficient AP Selection Strategy in Wi-Fi based Vechicle-to-Infrastructure Communications
Hwang, Jae-Ryong ; Lee, Hwa-Ryong ; Choi, Jae-Hyuk ; Yoo, Joon ; Kim, Chong-Kwon ;
The KIPS Transactions:PartC, volume 17C, issue 6, 2010, Pages 491~498
DOI : 10.3745/KIPSTC.2010.17C.6.491
Wi-Fi based vehicle-to-infrastructure (V2I) communication is an emerging solution to improve the safety, traffic efficiency, and comfort of passengers. However, due to the high mobility of vehicles and the limited coverage of Wi-Fi APs, the V2I system may suffer from frequent handoffs although roadside APs can support cost effective Internet connectivity. Such problem of V2I systems can be overcome with Mobile AP (MAP) platform. The MAPs yield longer service duration by moving along with vehicles, yet they provide a lower link capacities than the roadside APs. In this paper, we propose a new association control mechanism that effectively determines whether the vehicle will select a fixed roadside-AP or a nearby MAP in mobile vehicular network environments. We consider both the achievable link bandwidth and available connection duration as a selection criterion and provide their run-time estimation method. Extensive simulation using real traces show significant performance improvements.
Dynamic Probabilistic Flooding Algorithm based-on the Number of Child and Sibling Nodes in Wireless Sensor Networks
Jeong, Hyo-Cheol ; Yoo, Young-Hwan ;
The KIPS Transactions:PartC, volume 17C, issue 6, 2010, Pages 499~504
DOI : 10.3745/KIPSTC.2010.17C.6.499
The flooding is the simplest and effective way to disseminate a packet to all nodes in a wireless sensor network (WSN). However, basic flooding makes all nodes transmit the packet at least once, resulting in the broadcast storm problem in a serious case, in turn network resources become severely wasted. Particularly, power is one of the most valuable resources of WSNs as nodes are powered by battery, then the waste of energy by the basic flooding lessens the lifetime of WSNs. In order to solve the broadcast storm problem, this paper proposes a dynamic probabilistic flooding that utilizes the neighbor information like the number of child and sibling nodes. Simulation results show that the proposed method achieves a higher packet delivery ratio with the similar number of duplicate packets as compared to existing schemes.