• 한국정보과학회논문지:정보통신
• /
• 제37권2호
• /
• pp.157-161
• /
• 2010

Vehicular Ad-Hoc Network(VANET)에서는 차량의 높은 이동성으로 인하여 빈번한 네트워크 단절이 일어난다. 본 논문에서는 이런 문제를 해결하기 위해 차량 밀도에 기반을 둔 경로 선택 알고리즘과 최소 홉 수를 유지하면서 end-to-end 패킷 전송 비율을 높이는 라우팅 알고리즘을 제시한다. 또한 교차로 근처에서 패킷을 전송할 때 건물로 인한 Packet Error Rate을 줄이는 다음 홉 노드 선택 알고리즘을 소개한다. 시뮬레이션 통하여 제안 알고리즘이 GPSR(Greedy Perimeter Stateless Routing for Wireless Networks)에 버퍼를 두어 패킷을 carry하도록 수정한 알고리즘보다 성능이 향상 된 것을 확인하였다.

• Journal of Communications and Networks
• /
• 제15권2호
• /
• pp.122-131
• /
• 2013

We address the problem of effective vehicular routing in hostile scenarios where malicious nodes intend to jeopardize the delivery of messages. Compromised vehicles can severely affect the performance of the network by a number of attacks, such as selectively dropping messages, manipulating them on the fly, and the likes. One of the best performing solutions that has been used in static wireless sensor networks to deal with these attacks is based on the concept of watchdog nodes (also known as guard nodes) that collaborate to continue the forwarding of data packets in case a malicious behavior in a neighbor node is detected. In this work, we consider the beacon-less routing algorithm for vehicular environments routing protocol, which has been previously shown to perform very well in vehicular networks, and analyze whether a similar solution would be feasible for vehicular environments. Our simulation results in an urban scenario show that watchdog nodes are able to avoid up to a 50% of packet drops across different network densities and for different number of attackers, without introducing a significant increase in terms of control overhead. However, the overall performance of the routing protocol is still far from optimal. Thus, in the case of vehicular networks, watchdog nodes alone are not able to completely alleviate these security threats.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권5호
• /
• pp.1662-1681
• /
• 2015

The efficient send and receive of information in VANET improves the efficiency of the safety and traffic services advertisment and discovery. However, if the V2V is the only communication system used, the restrictions of the urban environment and network drop the performance of VANET. In order to improve the performance of the network, it is necessary to use V2I communication as well as V2V communication. Therefore, RSUs must be placed in the environment. However due to the high costs of placement, the full coverage of the environment would not be possible. Therefore, it is necessary to optimally install a limited number of RSUs in the environment.

• 한국통신학회논문지
• /
• 제38C권7호
• /
• pp.605-611
• /
• 2013

본 논문은 차량이 사고가 발생하였을 때, 사고 차량이 가까이에 있는 주위 차량에 긴급메시지를 전파하여, 다른 차량의 운전자들이 사고지점을 인지하고 회피할 수 있도록 효과적이고 빠른 브로드캐스트 기법에 관하여 기술하였다. 본 논문에서는 GPS(Global Position System)가 장착된 도심환경의 차량 네트워크에서 긴급 메시지를 빠르게 전파하는 방법을 제안한다. 전송 차량은 연속적이고 효과적인 메시지 전파를 위해 가장 멀리 있는 차량을 다음 릴레이 차량으로 미리 선정하고 전파를 하는 기법을 제안한다. 그리고 RSU(Road Side Unit)의 도움 없이 교차로를 인식할 수 있는 알고리즘을 제안하며, 끊어진 네트워크 상황에 대처하기 위해 헬로 메시지를 이용한 SCF(Store-Carry-Forward) 기법을 제안한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권10호
• /
• pp.4698-4716
• /
• 2017

Wireless signal transmission is influenced by environmental effects. These effects have also been challenging for Vehicular Ad hoc Network (VANET) in real-time communication. More specifically, in an urban environment, with high mobility among vehicles, a vehicle's status from the transmitter can instantly trigger from line of sight to non-line of sight, which may cause loss of real-time communication. In order to overcome this, a deterministic signal propagation model is required, which has less complexity and more feasibility of implementation. Hence, we propose a realistic path loss model which adopts ray tracing technique for VANET in a grid urban environment with less computational complexity. To evaluate the model, it is applied to a vehicular simulation scenario. The results obtained are compared with different path loss models in the same scenario based on path loss value and application layer performance analysis. The proposed path loss model provides higher loss value in dB compared to other models. Nevertheless, the performance of vehicle-vehicle communication, which is evaluated by the packet delivery ratio with different vehicle transmitter density verifies improvement in real-time vehicle-vehicle communication. In conclusion, we present a realistic path loss model that improves vehicle-vehicle wireless real-time communication in the grid urban environment.

• International Journal of Computer Science & Network Security
• /
• 제21권8호
• /
• pp.55-64
• /
• 2021

In the last few years, the massive development in wireless networks, high internet speeds and improvement in car manufacturing has shifted research focus to Vehicular Ad-HOC Networks (VANETs). Consequently, many related frameworks are explored, and it is found that security is the primary issue for VANETs. Despite that, a small number of research studies have taken into consideration the identification of performance standards and parameters. In this paper, VANET security frameworks are explored, studied and analysed which resulted in the identification of a list of performance evaluation parameters. These parameters are defined and categorized based on the nature of parameter (security or general context). These parameters are identified to be used by future researchers to evaluate their proposed VANET security frameworks. The implementation paradigms of security frameworks are also identified, which revealed that almost all research studies used simulation for implementation and testing. The simulators used in the simulation processes are also analysed. The results of this study showed that most of the surveyed studies used NS-2 simulator with a percentage of 54.4%. The type of scenario (urban, highway, rural) is also evaluated and it is found that 50% studies used highway urban scenario in simulation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권3호
• /
• pp.1533-1556
• /
• 2017

The concept of trust in vehicular ad hoc networks (VANETs) is usually utilized to assess the trustworthiness of the received data as well as that of the sending entities. The quality of safety applications in VANETs largely depends on the trustworthiness of exchanged data. In this paper, we propose a self-organized distributed trust computing framework (DTCF) for VANETs to compute the trustworthiness of each vehicle, in order to filter out malicious nodes and recognize fully trusted nodes. The proposed framework is solely based on the investigation of the direct experience among vehicles without using any recommendation system. A tier-based dissemination technique for data messages is used to filter out non authentic messages and corresponding events before even going farther away from the source of the event. Extensive simulations are conducted using Omnet++/Sumo in order to investigate the efficiency of our framework and the consistency of the computed trust metrics in both urban and highway environments. Despite the high dynamics in such networks, our proposed DTCF is capable of detecting more than 85% of fully trusted vehicles, and filtering out virtually all malicious entities. The resulting average delay to detect malicious vehicles and fraudulent data is showed to be less than 1 second, and the computed trust metrics are shown to be highly consistent throughout the network.

• 한국전자통신학회논문지
• /
• 제9권3호
• /
• pp.387-392
• /
• 2014

최근에 전기자동차의 상용화가 머지않은 상황에서 운전자를 위한 다양한 전자적 기능들이 개발되어지고 있다. 특히, 뇌파(EEG)를 통하여 운전자의 상태를 모니터링하면서 졸음방지나 건강상태를 실시간으로 점검하는 기능들이 있다. 자동차 운전자의 뇌파를 의료기관 서버에 전송하여 관련 기능들을 제공할 수 있는데 이때 자동차간 또는 자동차와 노변장치간의 원활한 통신기능이 필수적이다. 따라서 본 논문에서는 도심의 교차로환경에서 원활한 EEG 통신기능을 제공하는 라우팅 프로토콜을 제시하기 위해 AODV, DSR, GRP, OLSR, TORA와 같은 5가지의 라우팅 프로토콜로 운영되는 무선통신망을 각각 설계하고 이를 OPnet 네트워크 시뮬레이션을 통하여 성능을 평가하고 결과를 제시하고자 한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권5호
• /
• pp.2144-2165
• /
• 2016

In a vehicular ad hoc network, the communication links are unsteady due to the rapidly changing topology, high mobility and traffic density in the urban environment. Most of the existing geographical routing protocols rely on the continuous transmission of beacon messages to update the neighbors' presence, leading to network congestion. Source-based approaches have been proven to be inefficient in the inherently unstable network. To this end, we propose an opportunistic beaconless packet forwarding approach based on a modified handshake mechanism for the urban vehicular environment. The protocol acts differently between intersections and at the intersection to find the next forwarder node toward the destination. The modified handshake mechanism contains link quality, forward progress and directional greedy metrics to determine the best relay node in the network. After designing the protocol, we compared its performance with existing routing protocols. The simulation results show the superior performance of the proposed protocol in terms of packet delay and data delivery ratio in realistic wireless channel conditions.

• 대한임베디드공학회논문지
• /
• 제5권4호
• /
• pp.243-253
• /
• 2010

Multihop data delivery in vehicular ad hoc networks (VANETs) suffers from the fact that vehicles are highly mobile and inter-vehicle links are frequently disconnected. In such networks, for efficient multihop routing of road safety information (e.g. road accident and emergency message) to the area of interest, reliable communication and fast delivery with minimum delay are mandatory. In this paper, we propose a multihop vehicle-to-infrastructure routing protocol named Vertex-Based Predictive Greedy Routing (VPGR), which predicts a sequence of valid vertices (or junctions) from a source vehicle to fixed infrastructure (or a roadside unit) in the area of interest and, then, forwards data to the fixed infrastructure through the sequence of vertices in urban environments. The well known predictive directional greedy routing mechanism is used for data forwarding phase in VPGR. The proposed VPGR leverages the geographic position, velocity, direction and acceleration of vehicles for both the calculation of a sequence of valid vertices and the predictive directional greedy routing. Simulation results show significant performance improvement compared to conventional routing protocols in terms of packet delivery ratio, end-to-end delay and routing overhead.