• 제목/요약/키워드: Vehicular Ad-hoc Networks

검색결과 140건 처리시간 0.029초

Software-Defined Vehicular Networks (SDVN)

  • Al-Mekhlafi, Zeyad Ghaleb
    • International Journal of Computer Science & Network Security
    • /
    • 제22권9호
    • /
    • pp.231-243
    • /
    • 2022
  • The expansion of new applications and business models is being significantly fueled by the development of Fifth Generation (5G) networks, which are becoming more widely accessible. The creation of the newest intelligent vehicular net- works and applications is made possible by the use of Vehicular Ad hoc Networks (VANETs) and Software Defined Networking (SDN). Researchers have been concentrating on the integration of SDN and VANET in recent years, and they have examined a variety of issues connected to the architecture, the advantages of software defined VANET services, and the new features that can be added to them. However, the overall architecture's security and robustness are still in doubt and have received little attention. Furthermore, new security threats and vulnerabilities are brought about by the deployment and integration of novel entities and several architectural components. In this study, we comprehensively examine the good and negative effects of the most recent SDN-enabled vehicular network topologies, focusing on security and privacy. We examine various security flaws and attacks based on the existing SDVN architecture. Finally, a thorough discussion of the unresolved concerns and potential future study directions is provided.

차량 네트워크 기반 중앙관리형 무인비행체 경로 유도 시스템 (Centralized routing method of unmanned aerial vehicle using vehicular Ad Hoc networks)

  • 김률;주양익
    • Journal of Advanced Marine Engineering and Technology
    • /
    • 제40권9호
    • /
    • pp.830-835
    • /
    • 2016
  • 미국을 중심으로 상업용 무인비행체에 대한 규제가 명시된 조건하에 완화되어 관련 산업의 발전이 예상된다. 이에 따라 2017년에 미국에서 약 60만대에 이르는 무인비행체가 운용될 것으로 예상되지만 안전사고의 문제로 무인비행체의 자율 비행에 제약이 따른다. 이러한 문제를 해결하기 위해서 무인비행체의 충돌을 방지하고 경로를 탐색하는 연구가 진행되었으나, 경로 탐색 과정에서 상황에 따른 동적인 대처가 불가능하고 효율적인 경로 유도가 되지 못하는 단점을 가지고 있다. 따라서 본 논문에서는 해당 문제를 해결하기 위하여 차량 네트워크를 이용한 중앙관리방식의 무인비행체 경로 유도 시스템을 제안하고자 한다. 제안된 방식은 차량 통신용 네트워크가 경로 탐색의 주체가 되어 무인비행체를 데이터 패킷과 같이 라우팅의 대상으로 처리하여, 무인비행체가 직접 처리할 경로 탐색 과정을 줄이기 때문에 무인비행체의 에너지 효율성을 증가시킬 수 있고, 동일한 네트워크 내 무인비행체들의 전체적인 비행 흐름을 미리 파악하여 갑작스런 혼잡현상을 미연에 대비할 수 있으므로 무인비행체 라우팅 효율을 개선할 수 있다.

On Hybrid Re-Broadcasting Techniques in Vehicular Ad Hoc Networks

  • Hussain, Rasheed;Abbas, Fizza;Son, Junggab;Oh, Heekuck
    • 한국정보처리학회:학술대회논문집
    • /
    • 한국정보처리학회 2013년도 춘계학술발표대회
    • /
    • pp.610-613
    • /
    • 2013
  • Vehicular Ad Hoc NETwork (VANET), a subclass of Mobile Ah Hoc NETwork (MANET) has been a tech-buzz for the last couple of decades. VANET, yet not deployed, promises the ease, comfort, and safety to both drivers and passengers once deployed. The by far most important factor in successful VANET application is the data dissemination scheme. Such data includes scheduled beacons that contain whereabouts information of vehicles. In this paper, we aim at regularly broadcasted beacons and devise an algorithm to disseminate the beacon information up to a maximum distance and alleviate the broadcast storm problem at the same time. According to the proposed scheme, a vehicle before re-broadcasting a beacon, takes into account the current vehicular density in its neighborhood. The re-broadcasters are chosen away from the source of the beacon and among the candidate re-broadcasters, if the density in the neighborhood is high, then the candidate rebroadcaster re-broadcasts the beacon with high probability and with low probability, otherwise. We also performed thorough simulations of our algorithms and the results are sound according to the expectations.

An Efficient Broadcast Technique for Vehicular Networks

  • Ho, Ai Hua;Ho, Yao H.;Hua, Kien A.;Villafane, Roy;Chao, Han-Chieh
    • Journal of Information Processing Systems
    • /
    • 제7권2호
    • /
    • pp.221-240
    • /
    • 2011
  • Vehicular networks are a promising application of mobile ad hoc networks. In this paper, we introduce an efficient broadcast technique, called CB-S (Cell Broadcast for Streets), for vehicular networks with occlusions such as skyscrapers. In this environment, the road network is fragmented into cells such that nodes in a cell can communicate with any node within a two cell distance. Each mobile node is equipped with a GPS (Global Positioning System) unit and a map of the cells. The cell map has information about the cells including their identifier and the coordinates of the upper-right and lower-left corner of each cell. CB-S has the following desirable property. Broadcast of a message is performed by rebroadcasting the message from every other cell in the terrain. This characteristic allows CB-S to achieve an efficient performance. Our simulation results indicate that messages always reach all nodes in the wireless network. This perfect coverage is achieved with minimal overhead. That is, CB-S uses a low number of nodes to disseminate the data packets as quickly as probabilistically possible. This efficiency gives it the advantage of low delay. To show these benefits, we give simulations results to compare CB-S with four other broadcast techniques. In practice, CB-S can be used for information dissemination, or to reduce the high cost of destination discovery in routing protocols. By also specify the radius of affected zone, CB-S is also more efficient when broadcast to a subset of the nodes is desirable.

Evaluation of the Use of Guard Nodes for Securing the Routing in VANETs

  • Martinez, Juan A.;Vigueras, Daniel;Ros, Francisco J.;Ruiz, Pedro M.
    • 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.

OBPF: Opportunistic Beaconless Packet Forwarding Strategy for Vehicular Ad Hoc Networks

  • Qureshi, Kashif Naseer;Abdullah, Abdul Hanan;Lloret, Jaime;Altameem, Ayman
    • 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.

Routing Protocols for VANETs: An Approach based on Genetic Algorithms

  • Wille, Emilio C. G.;Del Monego, Hermes I.;Coutinho, Bruno V.;Basilio, Giovanna G.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권2호
    • /
    • pp.542-558
    • /
    • 2016
  • Vehicular Ad Hoc Networks (VANETs) are self-configuring networks where the nodes are vehicles equipped with wireless communication technologies. In such networks, limitation of signal coverage and fast topology changes impose difficulties to the proper functioning of the routing protocols. Traditional Mobile Ad Hoc Networks (MANET) routing protocols lose their performance, when communicating between vehicles, compromising information exchange. Obviously, most applications critically rely on routing protocols. Thus, in this work, we propose a methodology for investigating the performance of well-established protocols for MANETs in the VANET arena and, at the same time, we introduce a routing protocol, called Genetic Network Protocol (G-NET). It is based in part on Dynamic Source Routing Protocol (DSR) and on the use of Genetic Algorithms (GAs) for maintenance and route optimization. As G-NET update routes periodically, this work investigates its performance compared to DSR and Ad Hoc on demand Distance Vector (AODV). For more realistic simulation of vehicle movement in urban environments, an analysis was performed by using the VanetMobiSim mobility generator and the Network Simulator (NS-3). Experiments were conducted with different number of vehicles and the results show that, despite the increased routing overhead with respect to DSR, G-NET is better than AODV and provides comparable data delivery rate to the other protocols in the analyzed scenarios.

SECURITY FRAMEWORK FOR VANET: SURVEY AND EVALUATION

  • Felemban, Emad;Albogamind, Salem M.;Naseer, Atif;Sinky, Hassan H.
    • 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.

Fuzzy Based Multi-Hop Broadcasting in High-Mobility VANETs

  • Basha, S. Karimulla;Shankar, T.N.
    • International Journal of Computer Science & Network Security
    • /
    • 제21권3호
    • /
    • pp.165-171
    • /
    • 2021
  • Vehicular Ad hoc Network (VANET) is an extension paradigm of moving vehicles to communicate with wireless transmission devices within a certain geographical limit without any fixed infrastructure. The vehicles have most important participation in this model is usually positioned quite dimly within the certain radio range. Fuzzy based multi-hop broadcast protocol is better than conventional message dissemination techniques in high-mobility VANETs, is proposed in this research work. Generally, in a transmission range the existing number of nodes is obstacle for rebroadcasting that can be improved by reducing number of intermediate forwarding points. The proposed protocol stresses on transmission of emergency message projection by utilization subset of surrounding nodes with consideration of three metrics: inter-vehicle distance, node density and signal strength. The proposed protocol is fuzzy MHB. The method assessment is accomplished in OMNeT++, SUMO and MATLAB environment to prove the efficiency of it.

소프트웨어 정의 모바일 에지 차량 네트워크(SDMEVN)의 센싱 데이터 수집 전략 (A Sensing Data Collection Strategy in Software-Defined Mobile-Edge Vehicular Networks (SDMEVN))

  • 라이오넬;장종욱
    • 한국정보통신학회:학술대회논문집
    • /
    • 한국정보통신학회 2018년도 추계학술대회
    • /
    • pp.62-65
    • /
    • 2018
  • This paper comes out with the study on sensing data collection strategy in a Software-Defined Mobile Edge vehicular networking. The two cooperative data dissemination are Direct Vehicular cloud mode and edge cell trajectory prediction decision mode. In direct vehicular cloud, the vehicle observe its neighboring vehicles and sets up vehicular cloud for cooperative sensing data collection, the data collection output can be transmitted from vehicles participating in the cooperative sensing data collection computation to the vehicle on which the sensing data collection request originate through V2V communication. The vehicle on which computation originate will reassemble the computation out-put and send to the closest RSU. The SDMEVN (Software Defined Mobile Edge Vehicular Network) Controller determines how much effort the sensing data collection request requires and calculates the number of RSUs required to support coverage of one RSU to the other. We set up a simulation scenario based on realistic traffic and communication features and demonstrate the scalability of the proposed solution.

  • PDF