• Title/Summary/Keyword: 메시지 시스템

Search Result 2,106, Processing Time 0.03 seconds

Improvement of OLSR Through MIMC's Decreased Overhead in MANET (모바일 애드 혹 네트워크 환경 하에서 멀티인터페이스 멀티채널의 오버헤드 감소를 통한 OLSR의 성능 개선)

  • Jang, Jae-young;Kim, Jung-ho
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.5 no.3
    • /
    • pp.55-70
    • /
    • 2016
  • The most critical research issue in MANET environment is on supporting reliable communication between various devices. Various Multi-Hop Routing Protocol studies have proceeded. However, some problems you might have found when you use the existing link state routing technique are that it increases Control Message Overhead and it is unstable when node moves in CR circumstance which has transformation of using channel and MIMC circumstance which uses a number of interfaces. This essay offers a technique which is based on On-Demand Hello and the other technique which used Broadcast Interface of optimization as a solution to decrease Control Message Overhead. Also it proposes Quick Route Restoration technique which is utilized by GPS and MPR Selection technique which consider mobility as a solution of stable communication when node moves. Those offered Routing Protocol and OPNET based simulator result will be expected to be an excellent comparison in related research fields.

High Level Object Oriented Real-Time Simulation Programming and TMO Scheme (High Level 객체 지향에서 실시간 시뮬레이션 프로그램과 TMO 설계)

  • Song, Sun-Hee;Ra, Sang-Dong
    • The KIPS Transactions:PartA
    • /
    • v.10A no.3
    • /
    • pp.199-206
    • /
    • 2003
  • The object-oriented (OO) distributed real-time (RT) programming movement started in 1990´s and is growing rapidly at this turn of the century. Distributed real-time simulation is a field in its infancy but it is bounded to receive steadily growing recognition for its importance and wide applicability. The scheme is called the distributed time-triggered simulation scheme which is conceptually simple and easy to use but widely applicable. A new generation object oriented (OO) RT programming scheme is called the time-triggered message triggered object(TMO) programming scheme and it is used to make specific illustrations of the issues. The TMO structuring scheme is a general-style components structuring scheme and supports design of all types of component including hard real time objects and non real time objects within one general structure.

Design and Evaluation of an Early Intelligent Alert Broadcasting Algorithm for VANETs (차량 네트워크를 위한 조기 지능형 경보 방송 알고리즘의 설계 및 평가)

  • Lee, Young-Ha;Kim, Sung-Tae;Kim, Guk-Boh
    • Journal of Internet Computing and Services
    • /
    • v.13 no.4
    • /
    • pp.95-102
    • /
    • 2012
  • The development of applications for vehicular ad hoc networks (VANETs) has very specific and clear goals such as providing intellectual safe transport systems. An emergency warning technic for public safety is one of the applications which requires an intelligent broadcast mechanism to transmit warning messages quickly and efficiently against the time restriction. The broadcast storm problem causing several packet collisions and extra delay has to be considered to design a broadcast protocol for VANETs, when multiple nodes attempt transmission simultaneously at the access control layer. In this paper, we propose an early intelligent alert broadcasting (EI-CAST) algorithm to resolve effectively the broadcast storm problem and meet time-critical requirement. The proposed algorithm uses not only the early alert technic on the basis of time to collision (TTC) but also the intelligent broadcasting technic on the basis of fuzzy logic, and the performance of the proposed algorithm was compared and evaluated through simulation with the existing broadcasting algorithms. It was demonstrated that the proposed algorithm shows a vehicle can receive the alert message before a collision and have no packet collision when the distance of alert region is less than 4 km.

Cost Model for Parallel Spatial Joins using Fixed Grids (고정 그리드를 이용한 병렬 공간 조인을 위한 비용 모델)

  • Kim, Jin-Deog;Hong, Bong-Hee
    • Journal of KIISE:Databases
    • /
    • v.28 no.4
    • /
    • pp.665-676
    • /
    • 2001
  • The most expensive spatial operation in patial database in a spatial join which computes a combined table of which tuple consists of two tuples of the two tables satisgying a spatial predicate. Although the execution time of sequential processing of a spatial join has been so far considerably improved the response time is not tolerable because of not meeting the requiremetns of interactive users. It is usually appropriate to use parallel processing to improve the performance of spatial join processing. in spatial database the fixed grids which consist of the regularly partitioned cells can be employed the previous works on the spatial joins have not studied the parallel processing of spatial joins using fixed grids. This paper has presented an analytical cost model that estimates the comparative performance of a parallel spatial join algorithm based on the fixed grids in terms of the number of MBR comparisons. disk accesses, and message passing, Several experiments on the synthetic and real datasets show that the proposed analytical model is very accurate. This most model is also expected to used for implementing a very important DBMS component, Called the query processing optimizer.

  • PDF

Verification Test for Web service of River Geospatial Information (하천공간정보 웹 서비스에 관한 검증 테스트 방안)

  • Hong, Sung Soo;Shin, Hyung Jin;Hwang, Eui Ho;Chae, Hyo Suk
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2015.05a
    • /
    • pp.548-548
    • /
    • 2015
  • 과거 1990년대에 인터넷 이용이 전 세계로 확산되면서 World Wide Web를 이용하여 다양한 웹 서비스 기술의 구현 및 유통은 현재에도 개발되고 있다. 일반적으로 오늘날의 서비스는 XML 및 인터넷을 통하여 웹 서비스로 구현한 응용프로그램간의 연동을 가능하게 하는 기반기술이다. 이는 단순 객체 접근 프로토콜(SOAP), 웹 서비스 기술 언어(WSDL), 전역 비즈니스 레지스트리(UDDI) 등의 표준 기술을 사용하여 네트워크에 연결된 다른 컴퓨터 간의 분산 컴퓨팅을 지원하는 소프트웨어 및 기술이다. 이러한 웹 서비스의 발전으로 웹 서비스의 성능이 웹 서비스 제공자의 성패를 좌우하게 되고, 제공하고 있는 웹 서비스에 대한 검증이 필요하게 되었다. 웹 서비스에 대한 검증은 미국 Bloor NA(Bloor Research-North America)에서 웹 서비스 아키텍처의 단점을 발표하여 서비스의 품질과 신뢰성 및 개선점에 대하여 제시되어 활발한 연구가 진행 중에 있다. 그러나 사용자 관점에서 웹 서비스의 성능을 측정하고, 단순한 서비스 제공자의 서비스 검증 목적만이 아닌 서비스 제공자의 성능을 서비스 사용자에게 제공하는 검증 방법에 관한 연구가 많지 않은 실정이다. 하천공간정보에 대하여 웹 서비스 방식 중 통신 프로토콜인 HTTP 등을 이용한 인터넷상의 메시지 교환을 가능하게 하는 통신 프로토콜인 SOAP 및 WWW와 같은 분산 하이퍼미디어 시스템을 위한 소프트웨어 아키텍처의 한 형식인 REST(Representational State Transfer)를 실행하여 이에 따른 검증 프로세스를 수립하였다. 하천공간정보 웹 서비스에 대한 테스트 시나리오는 응답시간, 임계성능, 이용가능성, 신뢰성 및 접근성에 대하여 검증하며 하나 이상의 웹 서비스들 간의 호환성 표준의 준수 여부와 상호 운용 가능 여부를 테스트 하는 상호운용성 테스트, 신뢰성 메시징 및 분산 환경에서의 트랜잭션 처리 성능을 검증하는 웹 서비스 프로세스 품질 테스트를 실시하는 방안을 도출하고자 한다.

  • PDF

Design Errors and Cryptanalysis of Shin's Robust Authentication Scheme based Dynamic ID for TMIS

  • Park, Mi-Og
    • Journal of the Korea Society of Computer and Information
    • /
    • v.26 no.10
    • /
    • pp.101-108
    • /
    • 2021
  • In this paper, we analyze Shin's proposed dynamic ID-based user authentication scheme for TMIS(Telecare Medicine Information System), and Shin's authentication scheme is vulnerable to smart card loss attacks, allowing attackers to acquire user IDs, which enables user impersonation attack. In 2019, Shin's proposed authentication scheme attempted to generate a strong random number using ECC, claiming that it is safe to lose a smart card because it is impossible to calculate random number r'i due to the difficulty of the ECC algorithm without knowing random number ri. However, after analyzing Shin's authentication scheme in this paper, the use of transmission messages and smart cards makes it easy to calculate random numbers r'i, which also enables attackers to generate session keys. In addition, Shin's authentication scheme were analyzed to have significantly greater overhead than other authentication scheme, including vulnerabilities to safety analysis, the lack of a way to pass the server's ID to users, and the lack of biometric characteristics with slightly different templates.

Measures to Improve the Efficacy of Road User-Centered VMS Traffic Information Offering (도로이용자 중심의 VMS 교통정보 제공 효용성 향상 방안)

  • Yoon, Young-Min
    • The Journal of the Korea Contents Association
    • /
    • v.21 no.12
    • /
    • pp.190-201
    • /
    • 2021
  • The variable message sign (VMS) is equipment to improve the efficiency of traffic flow and safety of travel by providing real-time information to road users on traffic, road, weather situation, and traffic control due to construction. The information messages of the letter-based VMS taking up most of the VMS on the general national highways consist of section, travel time in sections, and road control situation. This study devised an improvement plan centered on road users, not road managers-centered existing message-based VMS through an analysis of road users' preference targeting the letter-based VMS operated in the general national highways in the Seoul Metropolitan Area. By presenting the measure for system improvement through which information on unexpected situations that road users prefer the most can be quickly and efficiently provided, this study aims to improve the efficiency of road user-centered VMS traffic information.

Efficient Re-Establishment Mechanism of Diameter Security Association lost in MIP Application (MIP 환경에서의 Diameter Security Association 정보 분실시의 재설정 기법)

  • 유희종;김말희;김현곤
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.13 no.5
    • /
    • pp.39-48
    • /
    • 2003
  • AAA(Authentication, Authorization, Accounting) protocol is a framework that propose functions of AAA on multiple networks and platforms. AAA protocol is extending from previous RADIUS protocol to Diameter protocol. There are some Diameter applications for variety purpose. Diameter CMS Application makes Diameter messages more secure by using PKI. Diameter CMS Application establish DSA(Diameter Security Association) for end to end security. However the Application has some problems to establish DSA(Diameter Security Association), which can make Diameter system unstable. If one system lose DSA information for some system error - for example, reboot -, the secure communication between two nodes may not be possible. At the application such as MIP, even user registration can't be done. In this paper, we propose a mechannism for DSA re-establishment, and also show the result of the implementation.

Dual Signature Scheme to provide efficient message decryption (효율적인 메시지 복호화를 제공하는 이중 전자서명 방식)

  • 김근옥;남정현;김승주;원동호
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.13 no.5
    • /
    • pp.129-136
    • /
    • 2003
  • A representative payment broker system is SET and one of its signature shcemes is a dual digital signature scheme. A dual digital signature scheme expose neither user's payment information(credit card number etc.) to merchandiser, nor user's order information to bank So it keeps user's Privacy safe. The digital signature scheme like this is being necessary as E-commerce is revitalized. But a dual digital signature of SET is not appropriate for wireless environments because it needs so many computations and communications. In this paper, we propose a signcryption scheme that generates a polynomial using a payment information for merchandiser and an order information for bank in order to reduce communications. We analyze the problem of existing signcryption schemes and dual digital signature schemes. Also we analyze the security properties of the proposed scheme.

An Efficiency Improved ID-based Tripartite Key Agreement Protocol (효율성을 개선한 신원기반의 3자간 복수 키 합의 프로토콜)

  • Park Young-Ho;Rhee Kyung-Hyune
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.15 no.3
    • /
    • pp.77-89
    • /
    • 2005
  • As the ID-based public key cryptosystems become a very active research area, a number of ID-based key agreement protocols have been proposed, but unfortunately many of them were analyzed that there were some security flaws in the protocols. In addition to key agreement protocols, in recent, Liu et al. and Kim et al. proposed the key agreement protocols that multiple session keys are established at once among participated entities. In this paper, we propose an ID-based tripartite key agreement protocol that establishes 8 keys by improving the efficiency of the Liu et al's. Moreover, the proposed protocol can be used in the situation where multiple different private key generators(PKG) are involved. Therefore, because the private key issued by different PKGs belonging to each entity's domain can be used, our proposed scheme is more efficiently applicable to the practical applications.