• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.10a
• /
• pp.75-78
• /
• 2007

Mobile IP provides hand-held devices with mobility which allows the user to do work over the network. However, handover time due transfer between access routers causes network delays and data loss. L2Trigger Handover expects this handover to take place, and executes L3 handover before L2 handover takes place, thereby reducing overall handover latency, although it still is an issue since handover latency between AR is not completely eliminated in L2 trigger handover. In this paper took into consideration where MIH is used in MIPv4 and using MIH Table when handover is about to occur in MN(Mobile Node), thereby pre-fetching data needed by Handover. In this way, when the handover is estimated, it improves the init time that L2trigger had. Furthermore we can find that we can execute the handover with shorten init time in smaller and narrow overlap length

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.11B
• /
• pp.1200-1206
• /
• 2009

In this paper, we propose an energy-efficient MAC(Medium Access Control) protocol for processing context information in ubiquitous sensor network environments. CASMAC(Context Aware Sensor MAC) use context information for energy-efficient operation and its operation principle is as follows. First, we make scenarios with possible prediction for CASMAC. And then we save setted context information in server. When event occur at specific sensor node, and then it send three times sample data to server. According to context information, server process sample data. If server process sample data with event, it receive continuous data from event occur node by a transmission request signal. And then server send data transmission stop signal to event occur node when it do not need to data. If server process sample data with no event, it have not reply. Through we make energy consumption tables and an energy consumption model, we simulate analysis of CASMAC performance. In a result, we gains about 5.7 percents energy reduction compared to SMAC.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.5A
• /
• pp.509-516
• /
• 2008

The Fast Handover in Hierarchical Mobile IPv6(F-HMIPv6) scheme provides a seamless handover in mobile IP networks effectively. However, there is a problem that the mobile node can lose its connectivity to the previous access router because of a sudden degradation of the link quality during fast handover procedure. Additionally, in many cases, the mobile node does not have enough time to exchange messages during the fast handover procedure, especially in case of movement with high speed during handover. In this paper, we propose a modification to F-HMIPv6 that significantly reduces the time to exchange messages during fast handover procedure and thereby increases the probability which the F-HMIPv6 can perform the fast handover in predictive mode.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.11
• /
• pp.2069-2074
• /
• 2006

The Next generation network may describe one integrated network by IP (Internet Protocol) convergence and combining various access technologies. The IP version 6 (IPv6) becomes fundamental protocol and the terminal offered various services is having mobility, multihoming, and intelligent as well as smaller. In this convergence network, which integrate mobile network, broad cast network, and Internet as well as PSTN, can provide all of the service. In this context, we will briefly present that the end node should be required ubiquitous computing and networking. That is to say that we must guarantee the end node in any time, my place, my where, and offer continuously services to the node. As like this, Service Mobility is given if a user can obtain subscribed and personalized services consistently even if connected to a foreign network service provider. In other words, Service mobility allows users to maintain access to their services even while moving or changing devices and network service providers. In this paper, we have to refer technical consideration items to make the service mobility framework.

• The KIPS Transactions:PartC
• /
• v.9C no.5
• /
• pp.709-718
• /
• 2002

Cluster based VOD systems require elaborate load balancing and buffer management techniques in order to ensure real-time display for multiuser concurrently. In this paper, we propose a new load balancing technique based on the dynamic buffer partitioning in cluster based VOD servers. The proposed technique evenly distribute the user requests into each service node according to its available buffer capacity and disk access rate. In each node, the dynamic buffer partitioning technique dynamically partitions the buffer to minimize the average waiting time for the requests that access the same continuous media. The simulation results show that our proposed technique decreases the average waiting time by evenly distributing the user requests compared with the exiting techniques and then increases the throughput in each node. Particularly under the overloaded condition in the cluster server, the simulation probes that the performance of the proposed technique is better two times than the Generalized Interval Caching based technique.

• Journal of Communications and Networks
• /
• v.11 no.6
• /
• pp.599-606
• /
• 2009

For many mission-critical related wireless sensor network applications such as military and homeland security, user's access restriction is necessary to be enforced by access control mechanisms for different access rights. Public key-based access control schemes are more attractive than symmetric-key based approaches due to high scalability, low memory requirement, easy key-addition/revocation for a new node, and no key predistribution requirement. Although Wang et al. recently introduced a promising access control scheme based on elliptic curve cryptography (ECC), it is still burdensome for sensors and has several security limitations (it does not provide mutual authentication and is strictly vulnerable to denial-of-service (DoS) attacks). This paper presents an energy-efficient access control scheme based on ECC to overcome these problems and more importantly to provide dominant energy-efficiency. Through analysis and simulation based evaluations, we show that the proposed scheme overcomes the security problems and has far better energy-efficiency compared to current scheme proposed byWang et al.

• Journal of Korea Multimedia Society
• /
• v.4 no.5
• /
• pp.455-464
• /
• 2001

For future multimedia services, one of the most crucial issues is building an access network that can accommodate multimedia services in subscriber network. The VB5.2 interface of B-ISDN located between an access network and a service node allows dynamic allocation and release of ATM resources. The SG 13 of ITU-T is standardizing the B-BCC protocol, which is sequentially interworked with signaling protocols in the service node. To minimize a connection setup delay of the sequential interworking mode, we proposed the parallel interworking model in which the SN executes simultaneously the connection control protocol of VB5.2 interface and signaling protocol. We simulate two interworking models in terms of a connection setup delay and a completion ratio. The results of simulation show that our proposed parallel interworking model for the VB5.2 interface reduces the setup delay and has the similar completion ratio compared to the sequential interworking model. however, the connection setup delay of parallel interworking model becomes about seven tenths of that of the sequential interworking model and the improvement become larger as the arrival rate increased.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.10B
• /
• pp.1200-1209
• /
• 2011

In this paper, we propose a novel energy efficient MAC protocol which is based on orthogonal frequency division multiple access (OFDMA) and exploits the physical characteristic that propagation loss of acoustic wave depends on the distance. In the proposed scheme, sensor nodes are grouped according to the distance to sink node. Then, each group uses a different frequency band. The proposed scheme not only enables all sensor nodes to maintain the signal-to-noise ratio above a certain required level (Accepted Minimum SNR, AMS), but also reduces overall transmission power consumption. In addition, the dynamic sub-channel allocation is employed in order to improve data transmission rate. Simulations show that proposed MAC protocol has better performance in a delay-tolerant underwater acoustic sensor networks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.1C
• /
• pp.107-115
• /
• 2005

ATC (Abnormal traffic controller) is presented as next generation security technology to securely support reliable Internet service and to guarantee network survivability, which is deployed in Internet access point. The key concept of the ATC is abnormal traffic monitoring and traffic control technology. When fault factors exist continuously and/or are repeated, abnormal traffic control guarantees service completeness as much as possible. The ATC with control policy on abnormal traffic is superior to the ATC with blocking policy as well as conventional network node, when the ratio of effective traffic to abnormal traffic is higher than $30{\%}.$ When traffic intended unknown attack occurs, network IDS is high false positive probability and so is limited to apply. In this environment, the ATC can be a key player to help the network node such as router to control abnormal traffic.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.5
• /
• pp.265-273
• /
• 2002

With the explosive growth of WWW traffic, there is an increasing demand for the high performance Web servers to provide a stable Web service to users. The cluster-based Web server is a solution to core with the heavy access from users, easily scaling the server according to the loads. In the cluster-based Web sewer, a back-end node may not be able to serve some HTTP requests directly because it does not have the requested contents in its main memory. In this case, the back-end node has to retrieve the requested contents from its local disk or other back-end nodes in the cluster. To reduce service latency, we introduce a new prefetch scheme. The back-end nodes predict the next HTTP requests and prefetch the contents of predicted requests before the next requests arrive. We develop three prefetch algorithms bated on some useful information gathered from many clients'HTTP requests. Through trace-driven simulation, the service latency of the prefetch scheme is reduced by 10 ~ 25% as compared with no prefetch scheme. Among the proposed prefetch algorithms, Time and Access Probability-based Prefetch (TAP2) algorithm, which uses the access probability and the inter-reference time of Web object, shows the best performance.