• Title/Summary/Keyword: Vehicular Ad-hoc Networks

Search Result 140, Processing Time 0.027 seconds

A Study on Performance of Content Store Replacement Algorithms over Vehicular CCN (VCCN에서 Content Store 교체 알고리즘의 성능에 관한 연구)

  • Choi, Jong-In;Kang, Seung-Seok
    • The Journal of the Convergence on Culture Technology
    • /
    • v.6 no.1
    • /
    • pp.495-500
    • /
    • 2020
  • VANET (Vehicular Ad Hoc Network), an example of an ad hoc vehicular networks, becomes one of the popular research areas together with the self-driving cars and the connected cars. In terms of the VANET implementation, the traditional TCP/IP protocol stack could be applied to VANET. Recently, CCN (Content Centric Networking) shows better possibility to apply to VANET, called VCCN (VANET over CCN). CCN maintains several data tables including CS (Content Store) which keeps track of the currently requested content segments. When the CS becomes full and new content should be stored in CS, a replacement algorithm is needed. This paper compares and contrasts four replacement algorithms. In addition, it analyzes the transmission characteristics in diverse network conditions. According to the simulation results, LRU replacement algorithm shows better performances than the remaining three algorithms. In addition, even the size of CS is small, the network maintains a reasonable transmission performance. As the CS size becomes larger, the transmission rate increases proportionally. The transmission performance decreases when the network is crowded as well as the number of transmission hops becomes large.

Improving the Performance of OFDM-Based Vehicular Systems through Diversity Coding

  • Arrobo, Gabriel E.;Gitlin, Richard D.
    • Journal of Communications and Networks
    • /
    • v.15 no.2
    • /
    • pp.132-141
    • /
    • 2013
  • In this paper, we present diversity coded orthogonal frequency division multiplexing (DC-OFDM), an approach to maximize the probability of successful reception and increase the reliability of OFDM-based systems through diversity coding. We focus on the application of DC-OFDM to vehicular networks based on IEEE 802.11p technology and analyze the performance improvement using this new technology. It is shown that DC-OFDM significantly improves the performance of vehicular ad hoc networks in terms of throughput and the expected number of correctly received symbols.

Integration of Proximity-based Services with Vehicular Ad-hoc Networks (교통 기관 애드혹 네트워크 와 Proximity기반 서비스의 통합)

  • Diouf, Elhadji Makhtar
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2015.05a
    • /
    • pp.126-129
    • /
    • 2015
  • Device-to-device (D2D) communications, a subset of Proximity-based Services that enables direct communication between LTE network subscribers, is gaining popularity. It is well underway to be adopted in cellular communication systems for pedestrian and connected-vehicles alike. In this paper, we briefly present our model of an Evolved Packet Core Network-assisted device discovery simulator and show the applicability of Proximity-based Services for Vehicular Ad-hoc Networks. Through the performance evaluation based on the developed simulation environment, it is shown that in case when users gather in the same vicinity, as in public transportation, LTE network data can be efficiently offloaded and multicasted through Wi-Fi for e.g. delivering traffic-related information and for the benefit of infotainment service consumers.

  • PDF

Modeling Geographical Anycasting Routing in Vehicular Networks

  • Amirshahi, Alireza;Romoozi, Morteza;Raayatpanah, Mohammad Ali;Asghari, Seyyed Amir
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.4
    • /
    • pp.1624-1647
    • /
    • 2020
  • Vehicular network is one of the most important subjects for researchers in recent years. Anycast routing protocols have many applications in vehicular ad hoc networks. The aim of an anycast protocol is sending packets to at least one of the receivers among candidate receivers. Studies done on anycast protocols over vehicular networks, however, have capability of implementation on some applications; they are partial, and application specific. No need to say that the lack of a comprehensive study, having a strong analytical background, is felt. Mathematical modeling in vehicular networks is difficult because the topology of these networks is dynamic. In this paper, it has been demonstrated that vehicular networks can be modeled based on time-expanded networks. The focus of this article is on geographical anycast. Three different scenarios were proposed including sending geographic anycast packet to exactly-one-destination, to at-least-one-destination, and to K-anycast destination, which can cover important applications of geographical anycast routing protocols. As the proposed model is of MILP type, a decentralized heuristic algorithm was presented. The evaluation process of this study includes the production of numerical results by Branch and Bound algorithm in general algebraic modeling system (GAMS) software and simulation of the proposed protocol in OMNET++ simulator. The comprehension of the result of proposed protocol and model shows that the applicability of this proposed protocol and its reactive conformity with the presented models based on presented metrics.

Improved Paired Cluster-Based Routing Protocol in Vehicular Ad-Hoc Networks

  • Kim, Wu Woan
    • International journal of advanced smart convergence
    • /
    • v.7 no.2
    • /
    • pp.22-32
    • /
    • 2018
  • In VANET, frequent movement of nodes causes dynamic changes of the network topology. Therefore the routing protocol, which is stable to effectively respond the changes of the network topology, is required. Moreover, the existing cluster-based routing protocol, that is the hybrid approach, has routing delay due to the frequent re-electing of the cluster header. In addition, the routing table of CBRP has only one hop distant neighbor nodes. PCBRP (Paired CBRP), proposed in this paper, ties two clusters in one pair of clusters to make longer radius. Then the pair of the cluster headers manages and operates corresponding member nodes. In the current CBRP, when the cluster header leaves the cluster the delay, due to the re-electing a header, should be occurred. However, in PCBRP, another cluster header of the paired cluster takes the role instead of the left cluster header. This means that this method reduces the routing delay. Concurrently, PCBRP reduces the delay when routing nodes in the paired cluster internally. Therefore PCBRP shows improved total delay of the network and improved performance due to the reduced routing overhead.

An LV-CAST algorithm for emergency message dissemination in vehicular networks (차량 망에서 긴급 메시지 전파를 위한 LV-CAST 알고리즘)

  • Bae, Ihn-Han
    • Journal of the Korean Data and Information Science Society
    • /
    • v.24 no.6
    • /
    • pp.1297-1307
    • /
    • 2013
  • Several multi-hop applications developed for vehicular ad hoc networks use broadcast as a means to either discover nearby neighbors or disseminate useful traffic information to othet vehicles located within a certain geographical area. However, the conventional broadcast mechanism may lead to the so-called broadcast storm problem, a scenario in which there is a high level of contention and collision at the link layer due to an excessive number of broadcast packets. To solve broadcast storm problem, we propose an RPB-MACn-based LV-CAST that is a vehicular broadcast algorithm for disseminating safety-related emergency message. The proposed LV-CAST identifies the last node within transmission range by computing the distance extending on 1 hop from the sending node of an emergency message to the next node of receiving node of the emergency message, and the last node only re-broadcasts the emergency message. The performance of LV-CAST is evaluated through simulation and compared with other message dissemination algorithms.

Artificial neural network for safety information dissemination in vehicle-to-internet networks

  • Ramesh B. Koti;Mahabaleshwar S. Kakkasageri;Rajani S. Pujar
    • ETRI Journal
    • /
    • v.45 no.6
    • /
    • pp.1065-1078
    • /
    • 2023
  • In vehicular networks, diverse safety information can be shared among vehicles through internet connections. In vehicle-to-internet communications, vehicles on the road are wirelessly connected to different cloud networks, thereby accelerating safety information exchange. Onboard sensors acquire traffic-related information, and reliable intermediate nodes and network services, such as navigational facilities, allow to transmit safety information to distant target vehicles and stations. Using vehicle-to-network communications, we minimize delays and achieve high accuracy through consistent connectivity links. Our proposed approach uses intermediate nodes with two-hop separation to forward information. Target vehicle detection and routing of safety information are performed using machine learning algorithms. Compared with existing vehicle-to-internet solutions, our approach provides substantial improvements by reducing latency, packet drop, and overhead.

Optimized Handoff Scheme with Fuzzy logic in Heterogeneous Vehicular Mobile Networks (이종의 차량 모바일 네트워크에서 퍼지 로직을 이용한 최적의 핸드오프 기법)

  • Roh, Youngsam;Jeong, Jongpil
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.1 no.1
    • /
    • pp.35-46
    • /
    • 2012
  • The development of wireless communication systems has resulted in the availability of several access technologies at any geographic area, such as 3G networks, wireless local area networks (WLANs) and wireless broadband networks. The development of these technologies is provided for users who have experienced mobile network environments which are slow or fast-movement environment and change distance between the AP(Access Point). This paper describes network performance issues in various environmental changes. Also, Fuzzy logic is applied to evaluate the performance in vehicle networks around users' environmental factors to focusing on the minimizing of transfer time and costs. First, WLAN and 3G networks fixed distance between AP, Second, WLAN and 3G networks random distance between APs, finally above two environmental with vehicle Ad hoc networks is analyzed. These V2I and V2V environmental condition are assumed. Results which based on Fuzzy logic suggest an optimal performance in vehicle network environments according to vehicle speed and distance between APs. Proposed algorithm shows 21% and 13% improvement of networks performance in V2I and V2V environment.

Design and Evaluation of a Weighted Intrusion Detection Method for VANETs (VANETs을 위한 가중치 기반 침입탐지 방법의 설계 및 평가)

  • Oh, Sun-Jin
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.11 no.3
    • /
    • pp.181-188
    • /
    • 2011
  • With the rapid proliferation of wireless networks and mobile computing applications, the landscape of the network security has greatly changed recently. Especially, Vehicular Ad Hoc Networks maintaining network topology with vehicle nodes of high mobility are self-organizing Peer-to-Peer networks that typically have short-lasting and unstable communication links. VANETs are formed with neither fixed infrastructure, centralized administration, nor dedicated routing equipment, and vehicle nodes are moving, joining and leaving the network with very high speed over time. So, VANET-security is very vulnerable for the intrusion of malicious and misbehaving nodes in the network, since VANETs are mostly open networks, allowing everyone connection without centralized control. In this paper, we propose a weighted intrusion detection method using rough set that can identify malicious behavior of vehicle node's activity and detect intrusions efficiently in VANETs. The performance of the proposed scheme is evaluated by a simulation study in terms of intrusion detection rate and false alarm rate for the threshold of deviation number ${\epsilon}$.

A Secure Protocol for Location-Aware Services in VANETs (VANET에서 안전한 위치인지 서비스를 위한 보안 프로토콜)

  • Sur, Chul;Park, Youngho;Rhee, Kyung Hyune
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.2 no.11
    • /
    • pp.495-502
    • /
    • 2013
  • In this paper, we present an anonymous authentication and location assurance protocol for secure location-aware services over vehicular ad hoc networks (VANETs). In other to achieve our goal, we propose the notion of a location-aware signing key so as to strongly bind geographic location information to cryptographic function while providing conditional privacy preservation which is a desirable property for secure vehicular communications. Furthermore, the proposed protocol provides an efficient procedure based on hash chain technique for revocation checking to effectively alleviate communication and computational costs on vehicles in VANETs. Finally, we demonstrate comprehensive analysis to confirm the fulfillment of the security objectives, and the efficiency and effectiveness of the proposed protocol.