• Title/Summary/Keyword: Telematics Service

Search Result 229, Processing Time 0.022 seconds

Design of Group Management Network Service Module on MMS in Mini-MAP Environment (Mini MAP 환경에서 MMS 상의 군 관리 네트워크 서비스 모듈 설계)

  • 김정호;이상범
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.30B no.4
    • /
    • pp.21-26
    • /
    • 1993
  • Network systems are of fundamental importance in programmable device in industrial automation, as they essential in order to active group management of integration and coordination. In this papers,MMS implemented on the basis ISO specification for industrial environment. In the MMS-MAP, MMS is situated in the application layer and on the datalink layer. This implemented software was operated with network interface unit which was designed in group objects and service primitives for group management network model system. This function of designed module showed possibility of operation through group state diagram transition in the Mini-MAP environment.

  • PDF

Error Performance in DSL System for ISDN Basic Rate Access (ISDN 기본접속을 위한 DSL 시스템의 성능 평가)

  • 김득환;곽경섭;김진태;최병하
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.30A no.11
    • /
    • pp.29-39
    • /
    • 1993
  • For an economical or timely reason, the types of subscriber loops for ISDN basic rate access service will, at least initially, be that of the pre-existing telephone network, that is, 2-wire twisted-pair metallic cable. Therefore, it is important to assess the high-speed digital transmission capability of the 2-wire subscriber loops. In this paper, the impairments such as intersymbol interference, crosstalk, and impulse niose are modeled. And then, symbol error probabilities in terms of SNR in DSL system using ECH and 2B1Q line code are analytically derived and numerically calculated. Also, the relationship between the quality of service required in ISDN subscriber section and the loop parameters is investigated.

  • PDF

Trace Monitoring System of Mobile Devices based on GML (GML 기반 모바일 디바이스 추적 모니터링 시스템)

  • Jeon, Chang-Young;Park, Jun;Lee, Jin-Seok;Song, Eun-Ha;Jeong, Young-Sik
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.34 no.1
    • /
    • pp.19-27
    • /
    • 2007
  • Entering the 21st century, the demand on information service via mobile devices is skyrocketing along with the popularization of computers and mobile communication devices and the rapid development of wireless communication technology. In particular, as mobile device service such as LBS and Telematics becomes highlighted, the management of mobile devices is ever more drawing attention. However, since there is no fixed standard on geographical space data, many commercialized monitoring systems do not use common geographical space data but independent geographic information. Furthermore, as it is impossible to save location information of each mobile device by integrating such information after acquiring them, it is difficult to trace management. Therefore, in this paper, geographic data with DXF. DWG and SHP format, which are commonly used files, were created and visualized by GML format, OGC standard advice. And then, TMS(Trace Monitoring System of Mobile Device) that can trace and manage information after acquiring and saving space information that show the movement of users was implemented.

Closest Pairs and e-distance Join Query Processing Algorithms using a POI-based Materialization Technique in Spatial Network Databases (공간 네트워크 데이터베이스에서 POI 기반 실체화 기법을 이용한 Closest Pairs 및 e-distance 조인 질의처리 알고리즘)

  • Kim, Yong-Ki;Chang, Jae-Woo
    • Journal of Korea Spatial Information System Society
    • /
    • v.9 no.3
    • /
    • pp.67-80
    • /
    • 2007
  • Recently, many studies on query processing algorithms has been done for spatial networks, such as roads and railways, instead of Euclidean spaces, in order to efficiently support LBS(location-based service) and Telematics applications. However, both a closest pairs query and an e-distance join query require a very high cost in query processing because they can be answered by processing a set of POIs, instead of a single POI. Nevertheless, the query processing cost for closest pairs and e-distance join queries is rapidly increased as the number of k (or the length of radius) is increased. Therefore, we propose both a closest pairs query processing algorithm and an e-distance join query processing algorithm using a POI-based materialization technique so that we can process closest pairs and e-distance join queries in an efficient way. In addition, we show the retrieval efficiency of the proposed algorithms by making a performance comparison of the conventional algorithms.

  • PDF

A Study on the Fingerprint-based User Authentication Protocol Considering both the Mobility and Security in the Telematics Environment (텔레메틱스 환경에서 이동성과 보안성을 고려한 지문정보를 이용한 사용자 인증 프로토콜에 관한 연구)

  • Kim, Tae-Sub;Oh, Ryong;Lee, Sang-Joon;Lee, Sung-Ju;Kim, Hak-Jae;Chung, Yong-Wha;Cho, Choong-Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.11A
    • /
    • pp.1128-1137
    • /
    • 2007
  • Recently, according to being advanced internet, mobile communication technique, Telematics environment which users in vehicle can use internet service in LAN(Local Area Network) via mobile device has being realized. In this paper, we propose the remote user authentication protocol to solve these issues. Additionally, we use biometrics(fingerprint) for our user authentication protocol cause it can provide to avoid critical weakness that can be lost, stolen, or forgotten and to make authentication easily. In our user authentication protocol, to protect the biometric we use session key which is generated from master key distributed in our key distribution protocol. In particular, we propose secure protocol between APs considering weakness of security in mobile environment. Based on implementation of our proposed protocol, we conform that our proposed protocols are secure from various attack methods and provide real-time authentication.

An Analysis of the Radio Interference in Wireless Vehicular Networks based on IEEE802.11b(WLAN) (IEEE802.11b(WLAN)기반의 차량 무선통신환경에서 전파간섭분석)

  • Lee, Myungsub;Park, Changhyeon
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.12 no.6
    • /
    • pp.117-125
    • /
    • 2012
  • Recently, there has been a fast paradigm shift in the automotive market from the traditional machine-oriented technology into the technology for vehicle informatics and electronics. In particular, telematics market is accelerating the development of technologies for vehicle informatics through the close cooperation between the vehicle makers and mobile communication companies. However, there may be the degradation of the quality of service by the interference since the telematics uses the wireless communication infrastructure for the base station-to-vehicle communication and the vehicle-to-vehicle communication. This paper presents an analysis device to easily analyze the interference by the wireless communication in the vehicle wireless network environment. Using the analysis results by the presented device, this paper shows that the link quality can be improved through the simulation and the experiment in real environment both.

Analysis of the taxi telematics history data based on a state diagram (상태도에 기반한 택시 텔레매틱스 히스토리 데이터 분석)

  • Lee, Jung-Hoon;Kwon, Sang-Cheol
    • Journal of Korea Spatial Information System Society
    • /
    • v.10 no.1
    • /
    • pp.41-49
    • /
    • 2008
  • This paper presents a data analysis method for the taxi telematics system which generates a greate deal of location history data. By the record consist of the basic GPS receiver-generated fields, device-added fields such as taxi operation status, and framework-attached fields such as matched link Identifier and position ratio in a link, each taxi can be represented by a state diagram. The transition and the state definition enable us to efficiently extract such information as pick-up time, pick-up distance, dispatch time, and dispatch distance. The analysis result can help to verify the efficiency of a specific taxi dispatch algorithm, while the analysis framework can invite a new challenging service including future traffic estimation, trajectory clustering, and so on.

  • PDF

Mechanism of RFID Authentication for u-Vehicle (u-Vehicle 환경에 적합한 RFID 인증 메커니즘)

  • Rhee, Yoon-Jung;Kim, Do-Hyeon
    • The Journal of the Korea Contents Association
    • /
    • v.8 no.6
    • /
    • pp.66-73
    • /
    • 2008
  • The concept of u-Vehicle is a technological model that people try to build the ubiquitous world in the car which moves, by using the RFID technology as well as the telematics service based on the location. RFID is weak on the point of information security because RFID has possibility for being abused such as chasing, counterfeiting, and invading personal privacy. RFID's tags use a weak cryptographic algorithm. This paper presents the vulnerabilities of information security under u-Vehicle environments. To solve that, we propose a mechanism enhancing RFID tag's security but with low cost by reducing the number of mutual authentication stages and using the hash function.

Range and k-Nearest Neighbor Query Processing Algorithms using Materialization Techniques in Spatial Network Databases (공간 네트워크 데이터베이스에서 실체화 기법을 이용한 범위 및 k-최근접 질의처리 알고리즘)

  • Kim, Yong-Ki;Chowdhury, Nihad Karim;Lee, Hyun-Jo;Chang, Jae-Woo
    • Journal of Korea Spatial Information System Society
    • /
    • v.9 no.2
    • /
    • pp.67-79
    • /
    • 2007
  • Recently, to support LBS(location-based services) and telematics applications efficiently, there have been many researches which consider the spatial network instead of Euclidean space. However, existing range query and k-nearest neighbor query algorithms show a linear decrease in performance as the value of radius and k is increased. In this paper, to increase the performance of query processing algorithm, we propose materialization-based range and k-nearest neighbor algorithms. In addition, we make the performance comparison to show the proposed algorithm achieves better retrieval performance than the existing algorithm.

  • PDF

A Valid Time for Nearest Neighbor Query of Moving Object using Information of Orientation (방향성을 이용한 이동객체의 최근접 질의를 위한 유효시간)

  • Kang Ku-An;Kim Jin-Deog
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.9 no.4
    • /
    • pp.865-870
    • /
    • 2005
  • The latest Global Positioning System, wireless communications technology and Location-Based Service bring about the rapid developments of telematics application areas. In the moving object database for telematics, it is very important to deal with database queries related to the real time current positions of a moving objects and the valid tine of the query results as well. In this paper, we propose how to get not only the current result of query but also the valid time and the result after the valid time when a query point and objects are moving simultaneously. We would like to predict the valid time by formula because the current results will be incorrect due to the characteristic of the continuous movements of the moving objects and the future results can not be calculated by iterative computations.