• Title/Summary/Keyword: 이동성 관리 기법

Search Result 590, Processing Time 0.036 seconds

Design of Fast Handover Mechanism in Proxy Mobile IPv6 Networks (Proxy Mobile IPv6 네트워크에서 Fast Handover 기법 설계)

  • Park, Byung-Joo;Han, Youn-Hee;Kim, Bong-Ki
    • Journal of KIISE:Information Networking
    • /
    • v.35 no.4
    • /
    • pp.301-310
    • /
    • 2008
  • In the existing literature, the handover process reveals numerous problems manifested by high movement detection latency. FMIPv6 can reduce packet loss using a tunnel-based handover mechanism. However, this mechanism may cause performance degradation due to the out-of-sequence packets. Recently. Proxy Mobile IPv6 is proposed for network-based mobility management to reduce overhead in mobile node. PMIPv6 can decrease handover latency which related overhead in MN by using network agent. In this paper, we proposed optimized fast handover scheme called Fast Proxy Mobile IPv6 (EF-PMIPv6). The proposed EF-PMIPv6 can support fast handover using fast IAPP and ND schemes. Further, a mathematical analysis is provided to show the benefits of our scheme. In the analysis, various parameters are used to compare our scheme with the current procedures, while our approach focuses on the reduction of handover latency.

Practical Use of Recent Section on Incremental Log Analysis technique (최신구간을 활용한 점진적 로그 분석 기법)

  • 김명순;박병준
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2003.04d
    • /
    • pp.496-498
    • /
    • 2003
  • 본 논문에서 최신구간을 활용하여 패턴의 최신성을 보장하고 최신구간내 패턴의 누락 없이 모든 패턴을 발견할 수 있는 점진적 로그 분석 기법을 제안한다. 즉, 주기마다 최신구간이 이동되면서, 동시에 패턴의 최신성 여부가 결정되고, 이동된 최신구간내 패턴이 될 후보 패턴을 미리 예측하여 보다 합리적인 패턴 관리할 수 있다. 따라서 일반적인 점진적 로그 분석 기법에서 간과된 대량의 로그에 숨겨진 패턴은 적어도 해당 최신구간내에서 모두 발견될 수 있고 최신성도 보증된다.

  • PDF

Design and Performance Analysis of Cost-Effective and Fast Inter-Domain NEMO Scheme with Multicasting Support (멀티캐스팅 지원의 비용효과적인 도메인간 빠른 NEMO 기법의 설계 및 성능분석)

  • Han, Sunghee;Jeong, Jongpil
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.1 no.2
    • /
    • pp.87-98
    • /
    • 2012
  • In recent years, there are many data and multimedia services that are supported by WiFi-enabled mobile devices. As a result, the demand for the ability to connect to the Internet anywhere is rapidly increasing and network infrastructure is becoming increasingly important. The design of cost-efficient network mobility (NEMO) protocol is intended to reduce the demand for limited wired/wireless network bandwidth at the signaling of mobility support and packet delivery operations. In this paper, we propose a cost-effective inter-LMA domain mobility management scheme which provides fast handover with multicasting support in NEMO environments. And our Fast PR-NEMO scheme is compared with N-PMIPv6, rNEMO, and PR-NEMO. In conclusion, our proposed scheme shows the best performance in terms of location updating cost, and packet tunneling cost.

Micro-mobility Management Scheme Using Link-layer Information in the Wireless Internet (무선 인터넷 망에서 링크 계층 정보를 이용한 마이크로 이동성 관리 기법)

  • 정상환;김도현;조유제
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.6B
    • /
    • pp.563-572
    • /
    • 2003
  • When the Mobile IP is applied for mobility management protocol in the next-generation mobile communication networks, it can cause a serious performance degradation called micro-mobility problem. In this paper, we propose ANMM(Access Network Mobility Management) to efficiently support micro-mobility in the IP-based wireless access network. The ANMM scheme can reduce the handoff latency and signaling overhead resulting in performance enhancement by managing the mobility of mobile nodes within access network.

Scheduling Method of Real-Time Mobile Transaction Manager considering Value of Transactions and Validity of Real-Time Data (트랜잭션의 중요도와 데이터의 유효성을 고려한 실시간 이동 트랜잭션 관리자의 스케줄링 기법)

  • Jo, Suk-Gyeong;Kim, Gyeong-Bae;Lee, Sun-Jo;Bae, Hae-Yeong
    • The KIPS Transactions:PartD
    • /
    • v.8D no.5
    • /
    • pp.533-542
    • /
    • 2001
  • In this paper, we present a scheduling method for real-time mobile transaction manager in mobile computing environment. The proposed method checks whether a transaction is executable or not. It is able to by considering not only the deadline of real-time data in mobile hosts. And then, it schedules the real-time mobile transactions by making optimal execution window based on the priority queue, while considering transaction value and deadline. Disconnection with mobile hosts is monitored in selecting the transaction for execution. Using the proposed method reduces the number of restarting times after transaction aborts which is caused by the violation of the validity constraints of real-time data. And in has merits of maximizing the sum of values of real-time mobile transactions which meet the deadline. The performance evaluation demonstrates that the number of committed real-time transactions within the deadline is improved by 20%. This method can be used in real-time mobile transaction manager is such environments as cellular communications, emergency medicine information system and so on.

  • PDF

Secure Key Predistribution Scheme using Authentication in Cluster-based Routing Method (클러스터 기반에서의 인증을 통한 안전한 키 관리 기법)

  • Kim, Jin-Su;Choi, Seong-Yong;Jung, Kyung-Yong;Ryu, Joong-Kyung;Rim, Kee-Wook;Lee, Jung-Hyun
    • The Journal of the Korea Contents Association
    • /
    • v.9 no.9
    • /
    • pp.105-113
    • /
    • 2009
  • The previous key management methods are not appropriate for secure data communication in cluster-based routing scheme. Because cluster heads are elected in every round and communicate with the member nodes for authentication and share-key establishment phase in the cluster. In addition, there are not considered to mobility of nodes in previous key management mechanisms. In this paper, we propose the secure and effective key management mechanisim in the cluster-based routing scheme that if there are no share keys between cluster head and its nodes, we create the cluster key using authentication with base station or trust autentication and exchange the their information for a round.

Potential Applicability of Moist-soil Management Wetland as Migratory Waterbird Habitat in Republic of Korea (이동성 물새 서식지로서 습윤토양관리 습지의 국내 적용 가능성)

  • Steele, Marla L.;Yoon, Jihyun;Kim, Jae Geun;Kang, Sung-Ryong
    • Journal of Wetlands Research
    • /
    • v.20 no.4
    • /
    • pp.295-303
    • /
    • 2018
  • Inland wetlands in the Republic of Korea provide key breeding and wintering habitats, while coastal wetlands provide nutrient-rich habitats for stopover sites for East Asia/Australasia Flyway(EAAF) migrants. However, since the 1960's, Korea has reclaimed these coastal wetlands gradually for agriculture and urban expansion. The habitat loss has rippled across global populations of migrant shorebirds in EAAF. To protect a similar loss, the United States, specifically Missouri, developed the moist-soil management technique. Wetland impoundments are constructed from levees with water-flow control gates with specific soils, topography, available water sources, and target goals. The impoundments are subjected to a combination of carefully timed and regulated flooding and drawdown regimes with occasional soil disturbance. This serves a dual purpose of removing undesirable vegetation, while maximizing habitat and forage for wildlife. Flooding and drawdown schedules must be dynamic with constantly shifting climate conditions. Korea's latitude ($N33^{\circ}25^{\prime}{\sim}N38^{\circ}37^{\prime}$) is comparable to Missouri ($N36^{\circ}69^{\prime}{\sim}N40^{\circ}41^{\prime}$); as such, moist-soil management could prove to be an effective wetland restoration technique for Korea. In order to meet specific conservation goals (i.e. shorebird staging site restoration), it is necessary to test the proposed methodology on a site that can meet the required specifications for moist-soil management. Moist-soil management has the potential to not only create key habitat for endangered wildlife, but also provide valuable ecosystem services, including water filtration.

Design of Virtual Memory Compression System on the Embedded System (임베디드 시스템에서 가상 메모리 압축 시스템 설계)

  • Jeong, Jin-Woo;Jang, Seung-Ju
    • The KIPS Transactions:PartA
    • /
    • v.9A no.4
    • /
    • pp.405-412
    • /
    • 2002
  • The embedded system has less fast CPU and lower memory than PC(personal Computer) or Workstation system. Therefore embedded operating is system is designed to efficiently use the limited resource in the system. Virtual memory management or the embedded linux have a low efficiency when page fault is occurred to get a data from I/O device. Because a data is moving from the swap device to main memory. This paper suggests virtual memory compression algorithm for improving in virtual memory management and capacity of space. In this paper, we present a way to performance implement a virtual memory compression system that achieves significant improvement for the embedded system.

Lazy Bulk Insertion Method of Moving Objects Using Index Structure Estimation (색인 구조 예측을 통한 이동체의 지연 다량 삽입 기법)

  • Kim, Jeong-Hyun;Park, Sun-Young;Jang, Hyong-Il;Kim, Ho-Suk;Bae, Hae-Young
    • Journal of Korea Spatial Information System Society
    • /
    • v.7 no.3 s.15
    • /
    • pp.55-65
    • /
    • 2005
  • This paper presents a bulk insertion technique for efficiently inserting data items. Traditional moving object database focused on efficient query processing that happens mainly after index building. Traditional index structures rarely considered disk I/O overhead for index rebuilding by inserting data items. This paper, to solve this problem, describes a new bulk insertion technique which efficiently induces the current positions of moving objects and reduces update cost greatly. This technique uses buffering technique for bulk insertion in spatial index structures such as R-tree. To analyze split or merge node, we add a secondary index for information management on leaf node of primary index. And operations are classified to reduce unnecessary insertion and deletion. This technique decides processing order of moving objects, which minimize split and merge cost as a result of update operations. Experimental results show that this technique reduces insertion cost as compared with existing insertion techniques.

  • PDF

Mobile IP User Mobility Model for Effective Mobility Management Accommodating Heterogeneous Networks under Cognitive Networking Environments (이종 네트워크간의 효과적 이동성 수용을 위한 이동 IP 네트워크 사용자 이동성 모델)

  • Cheon, Eun-Ji;Kim, Jeong-Ho
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.49 no.6
    • /
    • pp.90-97
    • /
    • 2012
  • In this paper, the new user mobility model which can be utilized to register user's location for interworking with heterogeneous overlay convergent networks under the time-varying radio propagation environment has been proposed. Thus the user mobility model is considered in order to evaluate the behaviors of users in the overlay convergent networks. This Mobile IP user mobility model will be very useful to model the user mobility behaviors and can be used to estimate the signaling traffic and frequency spectrum demands for massive data transfer for the heterogeneous overlay convergent networks.