• Title/Summary/Keyword: Mobility management protocol

Search Result 183, Processing Time 0.019 seconds

PDA Transmission of Medical Images by CDMA (CDMA에 의한 의료영상의 PDA전송)

  • Lee, Myong-Ho;Lim, Jae-Dong;Ahn, Bung-Ju;Lee, Hwun-Jae;Lee, Sang-Bock
    • Journal of the Korean Society of Radiology
    • /
    • v.1 no.2
    • /
    • pp.13-22
    • /
    • 2007
  • The purpose of this study was to survey a development of the wireless transmission system of medical images for ubiquitous medicine. There have been many changes in medical equipments and medical record medical treatment and medical record within hospital and PACS(Picture Archiving Communication System) which is picture management system for patients can be typical cases. It is difficult to use these automated medical systems unless they are within hospital and in case of rapid image reading in the emergency cases or in absence of doctor, it is difficult to perform it immediately. The present study implemented an image transmission system using CDMA connection so that images in the server can be viewed at any time and in any place. Remote wireless diagnosis based on medical images using PDA is applicable to medical areas that require mobility, and the use of PDA can be an ideal alternative for point of care. The use of PDA enables prompt and accurate access to digital medical images, which in turn reduces medical accidents and improves the quality of medical services through high productivity and efficiency of medical practitioners' works. It also enables quick response to patients' demands and high-quality medical services and, consequently, patients' high satisfaction.

  • PDF

Implementation of a QoS routing path control based on KREONET OpenFlow Network Test-bed (KREONET OpenFlow 네트워크 테스트베드 기반의 QoS 라우팅 경로 제어 구현)

  • Kim, Seung-Ju;Min, Seok-Hong;Kim, Byung-Chul;Lee, Jae-Yong;Hong, Won-Taek
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.48 no.9
    • /
    • pp.35-46
    • /
    • 2011
  • Future Internet should support more efficient mobility management, flexible traffic engineering and various emerging new services. So, lots of traffic engineering techniques have been suggested and developed, but it's impossible to apply them on the current running commercial Internet. To overcome this problem, OpenFlow protocol was proposed as a technique to control network equipments using network controller with various networking applications. It is a software defined network, so researchers can verify their own traffic engineering techniques by applying them on the controller. In addition, for high-speed packet processing in the OpenFlow network, programmable NetFPGA card with four 1G-interfaces and commercial Procurve OpenFlow switches can be used. In this paper, we implement an OpenFlow test-bed using hardware-accelerated NetFPGA cards and Procurve switches on the KREONET, and implement CSPF (Constraint-based Shortest Path First) algorithm, which is one of popular QoS routing algorithms, and apply it on the large-scale testbed to verify performance and efficiency of multimedia traffic engineering scheme in Future Internet.

A Node Mobility-based Adaptive Route Optimization Scheme for Hierarchical Mobile IPv6 Networks (노드 이동성을 고려한 계층적 이동 IPv6 네트워크에서의 적응적 경로 최적화 방안)

  • 황승희;이보경;황종선;한연희
    • Journal of KIISE:Information Networking
    • /
    • v.30 no.4
    • /
    • pp.474-483
    • /
    • 2003
  • The secret sharing is the basic concept of the threshold cryptosystem and has an important position in the modern cryptography. At 1995, Jarecki proposed the proactive secret sharing to be a solution of existing the mobile adversary and also proposed the share renewal scheme for (k, n) threshold scheme. For n participants in the protocol, his method needs O($n^2$) modular exponentiation per one participant. It is very high computational cost and is not fit for the scalable cryptosystem. In this paper, we propose the efficient share renewal scheme that need only O(n) modular exponentiation per participant. And we prove our scheme is secure if less that ${\frac}\frac{1}{2}n-1$ adversaries exist and they static adversary.