• Title/Summary/Keyword: Vehicles In Service

Search Result 536, Processing Time 0.028 seconds

Efficient Vehicle-Roadside Data Dissemination Algorithm for the Roadside Safety (도로안전을 위한 효율적인 차량-노변 데이터 배포 알고리즘)

  • Nam, Jaehyun
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2015.10a
    • /
    • pp.1015-1016
    • /
    • 2015
  • VANET is a technology for building a robust ad-hoc network between mobile vehicles as well as, between vehicles and RSU. Vehicles are moving and they only stay in the RSU area for a short time. When the number of requests is increased, an important challenge is to implement a suitable scheduling algorithm which serves as more requests as possible. $D^*S$ algorithm uses a priority weight, DS_Value, for selection of a request to get service. Priority weight is influenced only by deadline and data size parameters. We propose a packet scheduling using multilevel queue and show that using this idea leads to higher service ratio compare to previous algorithms.

  • PDF

Routing in Vehicular Ad Hoc Networks: Issues and Protocols

  • Shrestha, Raj K.;Moh, Sang-Man;Chung, Il-Yong
    • Korea Multimedia Society
    • /
    • v.12 no.4
    • /
    • pp.28-40
    • /
    • 2008
  • Vehicular ad hoc networks (VANETs) are a practical application class of wireless ad hoc networks, which consist of moving vehicles equipped with radio communication capabilities that collaborate to form a temporary network. This paper addresses issues and protocols of multihop routing in such emerging networks in the context of safety and infotainment applications. Due to the highly dynamic mobility of vehicles, frequent link breakage and short connection time are inevitable and, thus, the routing is a challenging task and interest for many researchers and industrial community. The frequent and dynamic change of topology makes the topology-based routing unreliable but the position-based routing more effective. The position-based routing consists of the location service which maps a node id to a geo-graphical position and the forwarding scheme which selects the next hop based on geo-graphical information of the node, its neighbors and the destination. The routing techniques are further categorized into geographical forwarding, trajectory forwarding and opportunistic forwarding based on the forwarding scheme. In this paper, we first present the distinguished properties of VANETs and the challenges and intractable issues posed in designing the routing protocols, followed by the comprehensive survey of existing routing protocols. Then, the different routing protocols designed for VANETs are compared in terms of characteristics, performance and application domains.

  • PDF

Performance Comparison of Task Partitioning Methods in MEC System (MEC 시스템에서 태스크 파티셔닝 기법의 성능 비교)

  • Moon, Sungwon;Lim, Yujin
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.11 no.5
    • /
    • pp.139-146
    • /
    • 2022
  • With the recent development of the Internet of Things (IoT) and the convergence of vehicles and IT technologies, high-performance applications such as autonomous driving are emerging, and multi-access edge computing (MEC) has attracted lots of attentions as next-generation technologies. In order to provide service to these computation-intensive tasks in low latency, many methods have been proposed to partition tasks so that they can be performed through cooperation of multiple MEC servers(MECSs). Conventional methods related to task partitioning have proposed methods for partitioning tasks on vehicles as mobile devices and offloading them to multiple MECSs, and methods for offloading them from vehicles to MECSs and then partitioning and migrating them to other MECSs. In this paper, the performance of task partitioning methods using offloading and migration is compared and analyzed in terms of service delay, blocking rate and energy consumption according to the method of selecting partitioning targets and the number of partitioning. As the number of partitioning increases, the performance of the service delay improves, but the performance of the blocking rate and energy consumption decreases.

The Solution of Vehicle Scheduling Problems with Multiple Objectives in a Probabilistic Environment

  • Park, Yang-Byung
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.14 no.1
    • /
    • pp.119-131
    • /
    • 1988
  • Vehicle Scheduling Problem (VSP) is a generic name given to a whole class of problems involving the visiting of "stations" by "vehicles," where a time is associated with each activity. The studies performed to date have the common feature of a single objective while satisfying a set of restrictions and known customer supplies or demands. However, VSPs may involve relevant multiple objectives and probabilistic supplies or demands at stations, creating multicriteria stochastic VSPs. This paper proposes a heuristic algorithm based on goal programming approach to schedule the most satisfactory vehicle routes of a bicriteria VSP with probabilistic supplies at stations. The two relevant objectives are the minimization of the expected travel distance of vehicles and the minimization of the due time violation for collection service at stations by vehicles. The algorithm developed consists of three major stages. In the first stage, an artificial capacity of vehicle is determined, on the basis of decision maker's subjective estimates. The second one clusters a set of stations into subsets by applying an efficient cluster method developed. In the third one, the stations in each subset are scheduled by applying an iterative goal programming heuristic procedure to each cluster.

  • PDF

Study on Reliability of New Digital Tachograph for Traffic Accident Investigation and Reconstruction (교통사고 조사 및 재현에서 신형 전자식운행기록계의 신뢰성에 관한 연구)

  • Park, Jongjin;Joh, Geonwoo;Park, Jongchan
    • Transactions of the Korean Society of Automotive Engineers
    • /
    • v.23 no.6
    • /
    • pp.615-622
    • /
    • 2015
  • Recently Digital-TachoGraph(DTG) was mounted mandatorily in commercial vehicles(Taxi, Bus, etc.). DTG records accurate and detailed information of the running state of vehicles related to traffic accident, such as Time, Distance, Velocity, RPM, Brake ON/OFF, GPS, Azimuth, Acceleration. Thus those standardized data can play an important role in traffic accident investigation and reconstruction. To develope the accurate and objective method using the DTG data for the reconstruction of traffic accident, we had conducted several tests such as driving test, high speed circuit test, braking test, slalom test at Korea Automobile Testing & Research Institute(KATRI), and collision test at Korea Automobile insurance repair Research and Training center(KART) with the vehicle equipped with several DTG. Development of the program which enables the reading and analysis of the DTG data was followed. In the experiments, we have found velocity error, RPM error, brake signal error and azimuth error in several products, and also non-continuous event data. The cause of these errors was deduced to be related to the correction factor, the durability of electronic parts and the algorithm.

Data Preprocessing Technique and Service Operation Architecture for Demand Forecasting of Electric Vehicle Charging Station (전기자동차 충전소 수요 예측 데이터 전처리 기법 및 서비스 운영 아키텍처)

  • Joongi Hong;Suntae Kim;Jeongah Kim
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.23 no.2
    • /
    • pp.131-138
    • /
    • 2023
  • Globally, the eco-friendly industry is developing due to the climate crisis. Electric vehicles are an eco-friendly industry that is attracting attention as it is expected to reduce carbon emissions by 30~70% or more compared to internal combustion engine vehicles. As electric vehicles become more popular, charging stations have become an important factor for purchasing electric vehicles. Recent research is using artificial intelligence to identify local demand for charging stations and select locations that can maximize economic impact. In this study, in order to contribute to the improvement of the performance of the electric vehicle charging station demand prediction model, nationwide data that can be used in the artificial intelligence model was defined and a pre-processing technique was proposed. In addition, a preprocessor, artificial intelligence model, and service web were implemented for real charging station demand prediction, and the value of data as a location selection factor was verified.

Basic System Architecture Design for Airport GIS Service Models (Airport GIS 구축을 위한 서비스모델 설계에 관한 연구)

  • Sim, Jae-Yong;Lee, Tong-Hoon;Park, Joo-Young
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.7 no.3
    • /
    • pp.82-94
    • /
    • 2008
  • Airport GIS is a comprehensive information system to improve security and efficiency of airport. At the initial stage to make it real, the current status of domestic and international regulations along with relevant standardization bas been reviewed. Gimpo Airport becomes a test-bed to get some ideas about how to bring the airport GIS into workflow by building service model and basic design based on current status and demand analysis of the airport. The 6 service models primarily brought into the project are as follows: (1) Local vehicles safety management in airside, (2) Intelligent traffic control between flights and vehicles at main cross points, (3) Dynamic safety management against FOD in airside and breakage on pavement, (4) Special support vehicle management such as deicing remotely controlled, (5) Response and support for fire vehicles and ambulances of signatory institutions in emergency. The upcoming research topic aims at drawing a specific design and building integrated system in the future.

  • PDF

QoS-aware Cross Layer Handover Scheme for High-Speed vehicles

  • Nashaat, Heba
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.1
    • /
    • pp.135-158
    • /
    • 2018
  • High-Speed vehicles can be considered as multiple mobile nodes that move together in a large-scale mobile network. High-speed makes the time allowed for a mobile node to complete a handover procedure shorter and more frequently. Hence, several protocols are used to manage the mobility of mobile nodes such as Network Mobility (NEMO). However, there are still some problems such as high handover latency and packet loss. So efficient handover management is needed to meet Quality of Service (QoS) requirements for real-time applications. This paper utilizes the cross-layer seamless handover technique for network mobility presented in cellular networks. It extends this technique to propose QoS-aware NEMO protocol which considers QoS requirements for real-time applications. A novel analytical framework is developed to compare the performance of the proposed protocol with basic NEMO using cost functions for realistic city mobility model. The numerical results show that QoS-aware NEMO protocol improves the performance in terms of handover latency, packet delivery cost, location update cost, and total cost.

A study of Voltage Dmp in Electrical Wiring System for Railway Vehicles (철도 차량 배선의 전압강하에 대한 고찰)

  • Son, Min-Kyu;Jung, Ho-Young;Park, Du-Man
    • Proceedings of the KSR Conference
    • /
    • 2009.05a
    • /
    • pp.959-965
    • /
    • 2009
  • To meet the demand increasing passengers in railway vehicles, railway transportation service companies are increasing the numbers of cars per train-set. Two solutions, Variable train-set formations and Multiple train-set operation, are common way to increase the transportation capability. These kind of long distance train-set can effect train-set command and control system, and sometimes the digital signals using train line from master cabin can not reach to the systems located the other extremity slave car. This is so called Voltage Drop. This phenomenon is originated from the electrical power consumption and electrical cable resistance, and cause to the equipments or cars located end of the electrical cable way, malfunction or abnormal operations. This voltage drop happens not only in train lines but also Battery Power Lines. The purpose of this investigation is to design high reliability railway vehicles by clarifying the possibility of happening these events case by case, by analyzing the reasons, and finally by finding the best solutions.

  • PDF

An Online Personal Rapid Transit Dispatching Algorithm Based on Nearest Neighbor Dispatching Rule (최근린 배차 규칙 기반 온라인 Personal Rapid Transit 배차 알고리즘)

  • Han, Chung-Kyun;Kwon, Bo Bea;Kim, Baek-Hyun;Jeong, Rag-Gyo;Lee, Hoon;Ha, Byung-Hyun
    • Journal of the Korea Society for Simulation
    • /
    • v.23 no.4
    • /
    • pp.97-109
    • /
    • 2014
  • Personal rapid transit (PRT) is a new transportation system, which is energy efficient and brings high quality of customer service. Customers arrive dynamically at stations and request transportation service. In this paper, we propose a new online PRT dispatching algorithm for pickup and delivery of customers. We adopt the nearest neighbor dispatching rule, which is known as performing well in general. We extend the rule with bipartite matching in order to deal with multiple vehicles and customers at the same time. We suggest a systematic way for selecting vehicles that will be considered to be dispatched, since the scope with which vehicles are selected may affect the system performance. We regard the empty travel distance of vehicles and the customer waiting time as the performance measures. By using simulation experiments, it has been examined that the scope of dispatching affects the system performance. The proposed algorithm has been validated by comparing with other dispatching rules for transportation services. We have shown that our algorithm is more suitable for PRT operating environment than other dispatching rules.