• Title/Summary/Keyword: Update Protocol

Search Result 216, Processing Time 0.021 seconds

Cost Effective Location Management Scheme in MIPv6 (비용 효과적인 MIPv6의 위치 관리 방안)

  • Choi, Dae-Kyu;Lee, Hyung-Min;Choo, Hyun-Seung
    • The KIPS Transactions:PartC
    • /
    • v.11C no.2
    • /
    • pp.213-218
    • /
    • 2004
  • Recently MIP becomes more important for the macro mobility support in the emergence of the global system such as IMT-2000. However this Protocol suffers from many weaknesses on the location management. MIPv4 regional registration is presented for the local registration of MNs. MIPv6 can benefit from the reduced mobility signaling with external networks by employing a local MAP, that is called HMIPv6. The total signaling cost of HMIPv6 is rapidly increased by the number of CNs of an MN when the MN moves around between MAPs. In this paper, we propose a new location management scheme in MIPv6 that reduces the total signaling cost in the location update based on HMIPv6 Here the MN does not send the BU to CNs and HA when it moves around between MAPs. Instead it informs the current location by transferring the modified BU to the previous MAP. According to the results of the performance analysis, we determine the upper bound for the number of forwarding links allowed among adjacent MAPs without the BU information.

Compatibility for Proposed R.94 PDB Test (PDB 시험에 대한 충돌 상호 안전성)

  • Jang, Eun-Ji;Kim, Joseph;Beom, Hyen-Kyun;Kwon, Sung-Eun
    • Transactions of the Korean Society of Automotive Engineers
    • /
    • v.18 no.3
    • /
    • pp.149-155
    • /
    • 2010
  • Currently various safety tests are being performed in many countries with growing interest in vehicle safety. However the vehicles which have good safety performance in these tests could not secure the good performance in real car to car accident. So new test protocol using progressive deformable barrier (PDB) was proposed by EEVC in Europe, NHTSA in USA and some vehicle manufacturers, etc. The target of PDB test is to control partner protection in addition to self-protection on the same test. The proposal is to update current ECE R.94 frontal ODB test. So barrier, impact speed, overlap are changed to avoid bottoming-out in the test configuration. In this paper 3 different tests (R.94, EuroNCAP and PDB test) were carried out using current production vehicles with same structure. The results of these tests were compared to understand PDB test. As a result PDB test shows the highest vehicle deceleration and dummy injury because PDB offers a progressive increase in stiffness in depth and height. However vehicle intrusion was affected with rather test velocity than stiffness of deformable barrier. PDB deformation data is used for partner protection assessment using PDB software and it shows that the test vehicle is rather not aggressive.

A Study on Optimization of Networking Mechanism of Distributed List (분산리스트 네트워킹 메카니즘의 최적화에 관한 연구)

  • 임동주
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.5 no.3
    • /
    • pp.475-482
    • /
    • 2001
  • In this paper, I describe the implementation of the distributed lists based on socket and on RMI(Remote Method Invocation). First, I describe and implement an interface of distributed list based on socket using object stream in a distributed environment, when encapsulating the message in the distributed list. Second, the major purpose to implement a distributed list in RMI is to compare advantages and disadvantages with other networking mechanisms by implementing complicated applications. The major advantage in using RMI is to implement simply the programs without using application-level protocol. In terms of program efficiency, the applications using HMI can degrade the performance due to many TCP/IP connections generated every update. TCP/IP connection requires much less cost than RMI. Even though RMI has the mechanism processing many method calls using a sing]e network connection, RMI is less efficient than the direct use of socket. However, RMI makes it possible to communicate beyond firewall using HTTP proxying mechanism. Consequently, I present a modeling of networking mechanism in finding out optimization solution by comparing and analyzing the two systems.

  • PDF

A New Mobility Management Scheme in Proxy Mobile IPv6 Networks with Dynamic Paging Support (Proxy Mobile IPv6 환경에서 동적 페이징 지원을 위한 이동성 관리기법)

  • Yi, Myung-Kyu;Kim, Cheol-Joong;Park, Seok-Cheon;Yang, Young-Kyu
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.9
    • /
    • pp.1999-2007
    • /
    • 2010
  • Proxy Mobile IPv6(PMIPv6) is a network-based mobility management protocol and it does not require mobile node's involving in mobility management. In PMIPv6, the Mobile Access Gateway (MAG) incurs a high signaling cost to update the location of a mobile node to the remote Local Mobility Anchor (LMA) if it moves frequently. It may cause excessive signaling traffic and increase a high traffic load on LMA. Therefore, we propose a new mobility management scheme in proxy mobile IPv6 networks with dynamic paging support. To minimize signaling overhead, in our proposal, the size of the paging area is determined dynamically according the changes of mobility and traffic patterns of the mobile node. An analytic model is applied to determine the optimal size of the paging area. The cost analysis using fluid flow model presented in this paper shows that our proposal can achieve performance superior that of PMIPv6 scheme.

Proposal of USN Configuratation and Routing Scheme Inside a Ship (선박 내 센서 노드 구성 및 라우팅 제안)

  • Lee, Seong Ro;Jeong, Min-A;Kim, Yeongeun;Min, Sang-Won
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39C no.8
    • /
    • pp.660-666
    • /
    • 2014
  • In this paper, we consider a classification criteria of sensor nodes based on equipment function, and propose a routing search algorithm between node when an IP-USN is applied inside a ship. whereas a tree-type routing algorithm is applied to the limited mobile enviroment, such as engine room or machine room, a mesh-type routing alogrithm is to free mobile enviroment, such as passager corridor liviing quarters or restanrats areas. For mesh-type routing, it is necessary to maintain a seamless route path between a sink node and sensor nodes for which we consider a novel message exchange periodically. We proposed a new message, RDES message, which is issued periodically to update the topology of sensor node and check a connectivity between nodes.

Secure and Energy Efficient Protocol based on Cluster for Wireless Sensor Networks (무선 센서 네트워크에서 안전하고 에너지 효율적인 클러스터 기반 프로토콜)

  • Kim, Jin-Su;Lee, Jung-Hyun
    • The Journal of the Korea Contents Association
    • /
    • v.10 no.2
    • /
    • pp.14-24
    • /
    • 2010
  • Because WSNs operate with limited resources of sensor nodes, its life is extended by cluster-based routing methods. In this study, we use data on direction, distance, density and residual energy in order to maximize the energy efficiency of cluster-based routing methods. Through this study, we expect to minimize the frequency of isolated nodes when selecting a new cluster head autonomously using information on the direction of the upper cluster head, and to reduce energy consumption by switching sensor nodes, which are included in both of the new cluster and the previous cluster and thus do not need to update information, into the sleep mode and updating information only for newly included sensor nodes at the setup phase using distance data. Furthermore, we enhance overall network efficiency by implementing secure and energy-efficient communication through key management robust against internal and external attacks in cluster-based routing techniques. This study suggests the modified cluster head selection scheme which uses the conserved energy in the steady-state phase by reducing unnecessary communications of unchanged nodes between selected cluster head and previous cluster head in the setup phase, and thus prolongs the network lifetime and provides secure and equal opportunity for being cluster head.

Development of Communication Module for a Mobile Integrated SNS Gateway (모바일 통합 SNS 게이트웨이 통신 모듈 개발)

  • Lee, Shinho;Kwon, Dongwoo;Kim, Hyeonwoo;Ju, Hongtaek
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39B no.2
    • /
    • pp.75-85
    • /
    • 2014
  • Recently, mobile SNS traffic has increased tremendously due to the deployment of smart devices such as smart phones and smart tablets. In this paper, mobile integrated SNS gateway is proposed to cope with massive SNS traffic. Most of mobile SNS applications update the information with individual connection to the corresponding servers. The proposed gateway integrates these applications. It is for reducing SNS traffic caused by continuous data request and improving the mobile communication performance. The key elements of the mobile integrated SNS gateway are the synchronization, cache and integrated certification. The proposed protocol and gateway system have implemented on the testbed which deployed on the real network to evaluate the performance of the proposed gateway. Finally, we present the caching performance of gateway system implementation.

Fair Private Matching with Semi-Trusted Third Party (STTP를 활용한 공평한 비밀 매칭)

  • Kim, E-Yong;Hong, Jeong-Dae;Cheon, Jung-Hee;Park, Kun-Soo
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.14 no.4
    • /
    • pp.446-450
    • /
    • 2008
  • Private Matching is the problem of computing the intersection of private datasets of two parties without revealing their own datasets. Freedman et al.[1] introduced a solution for the problem, where only one party gets private matching. When both parties want to get private matching simultaneously, we can consider the use of Kissner and Song[2]'s method which is a privacy-preserving set intersection with group decryption in multi-party case. In this paper we propose new protocols for fair private matching. Instead of group decryption we introduce a Semi-Trusted Third Party for fairness. We also propose an update procedure without restarting the PM protocol.

Design of Spontaneous Acoustic Field Reproducing System (II) (능동형 음장조성시스템의 설계(II))

  • Kook, Chan;Jang, Gil-Soo;Chon, Ji-Hyun;Shin, Yong-Gyu;Min, Byoung-Chul
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2006.05a
    • /
    • pp.964-969
    • /
    • 2006
  • The soundscape is a novel attempt to offer comfortable sound environments at the urban public spaces by adding pleasant sounds and removing unagreeable ones. Most important factors to be considered therein are to determine what kind of sounds to offer and how to adjust them to the changing circumstances. But nowadays, the audio system provided in the almost every urban public spaces is just only a PA system with CD player or radio broadcasting music, the provided sound is only intended by the operator. Furthermore, providing the soundscape which fits to the situation and the atmospheric conditions needs enormous effort and time, it is almost impossible with the existing PA systems which installed in the public spaces nowadays. Thus, the new sounds cape reproduction system was developed on the basis of the prior VAFSS(Virtual Acoustic Field Simulation System) systems, which has the artificial intelligence to read out the mood of the field and select the appropriate soundscape to reproduce. In this new system, various environmental sensors with standard voltage, current or resistance output are available simultaneously, and the monitoring with video and sound became available via the TCP/IP communication protocol. The update and control of this system can be very convenient, so the money, time and the effort of maintaining and providing soundscape on the public spaces can be enormously saved. This new soundscape reproducing system was named as Virtual Acoustic Field Simulation System II (V AFSS II).

  • PDF

Route-optimized Handoff in Mobile CORBA Environment (Mobile CORBA 환경에서 게이트웨이간의 경로최적화 핸드오프)

  • Shin, Hye-Ryung;Lee, Hyung-Woo;Kim, Ju-Ho
    • Journal of KIISE:Information Networking
    • /
    • v.29 no.3
    • /
    • pp.224-232
    • /
    • 2002
  • The routing protocols designed for wired networks can hardly be used for mobile ad-hoc networks due to limited bandwidth of wireless transmission and unpredictable topological change. Recently, several routing protocols for mobile ad-hoc networks have been proposed. However, when these protocols are applied to support real time services like multimedia transmission, they still have problems in ad-hoe networks, where the topology changes drastically. In this paper, we propose a new route selection algorithm which selects the most reliable rouse that is impervious to route failures by topological changes by mobile hosts. For reliable route selection, the concept of virtual zone (stable lone and caution zone) is proposed. The lone is located in a mobile node's transmission range and determined by mobile node's mobility information received by Global Positioning System (GPS). The proposed algorithm is applied to the route discovery procedure of the existing on-demand routing protocol, AODV, and evaluated by simulation in various traffic conditions and mobility patterns.