• Title/Summary/Keyword: vehicular communications

Search Result 147, Processing Time 0.024 seconds

Mutual Identification and Key Exchange Scheme in Secure Vehicular Communications based on Group Signature (그룹 서명 기반의 차량 네트워크에서 상호 신분 확인 및 세션키 교환 기법)

  • Kim, Dai-Hoon;Choi, Jae-Duck;Jung, Sou-Hwan
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.20 no.1
    • /
    • pp.41-50
    • /
    • 2010
  • This paper proposes a mutual identification and session key exchange scheme in secure vehicular communication based on the group signature. In VANETs, security requirements such as authentication, conditional privacy, non-repudiation, and confidentiality are required to satisfy various vehicular applications. However, existing VANET security methods based on the group signature do not support a mutual identification and session key exchange for data confidentiality. The proposed scheme allows only one credential to authenticate ephemeral Diffie-Hellman parameters generated every key exchange session. Our scheme provides a robust key exchange and reduces storage and communication overhead. The proposed scheme also satisfies security requirements for various application services in VANETs.

Routing Algorithm of VANET for an Efficient Path Management in Urban Intersections (도심 교차로에서 효율적 경로 관리를 위한 자동차 통신용 라우팅 알고리즘)

  • Cho, Sunghyun;Kim, Seokwoo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38A no.12
    • /
    • pp.1054-1060
    • /
    • 2013
  • This paper proposes a vehicle ad-hoc network (VANET) routing algorithm to reduce the probability of routing path discontinuity in urban intersections. In urban intersections, the vehicles may frequently change their moving directions. It can cause the disconnection of routing path and the increase of a packet transmission delay. In order to resolve this problem, the proposed routing algorithm exploits the information of moving directions in urban intersections. In this way, the proposed algorithm can reduce the probability of the local maximum which causes the increase of the number of routing hops and packet transmission delay. Simulation results show that the proposed algorithm can reduce the local maximum probability by 10% and increase the successful packet transmission ratio by 5% compared to the conventional VANET routing algorithms.

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

Quantized Channel State Information Feedback Scheme for Multi-carrier Systems (다중 반송파 시스템을 위한 양자화된 채널 상태 정보 피드백 기법)

  • Seo Hee-Jung;Kim Seayoung;Kim Nak-Myeong;Kim Kiho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.12A
    • /
    • pp.1146-1152
    • /
    • 2005
  • In this paper, we propose a compressed quantized channel state information (CQCSI) feedback scheme for multi-carrier mobile communication systems. The proposed CQCSI figures out the contiguous subsequences of equal QCSI's as separate types of runs across the subcarriers, and then encodes the types of runs using a truncated Huffman coding algorithm. Computer simulation shows that the proposed algorithm can reduce the QCSI feedback up to one tenth of the uncompressed, while providing a comparable performance with the conventional QCSI feedback schemes. To cope with special cases when the frequency selective fading is very high, we also propose a restricted CQCSI feedback scheme. The restricted CQCSI feedback has been proved under vehicular B channel model.

An Efficient Association Control Method for Vehicular Networks with Mobile Hotspots

  • Hwang, Jae-Ryong;Choi, Jae-Hyuk;Yoo, Joon;Lee, Hwa-Ryong;Kim, Chong-Kwon
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.5
    • /
    • pp.888-908
    • /
    • 2011
  • The increasing demand from passengers in vehicles to improve safety, traffic efficiency, and comfort has lead to the growing interest of Wi-Fi based vehicle-to-infrastructure (V2I) communications. Although the V2I system provides fast and cost-effective Internet connectivity to vehicles via roadside Wi-Fi access points (APs), it suffers from frequent handoffs due to the high mobility of vehicles and the limited coverage of Wi-Fi APs. Recently, the Mobile AP (MAP) platform has emerged as a promising solution that overcomes the problem in the V2I systems. The main advantage is that MAPs may yield longer service duration to the nearby vehicles that have similar mobility patterns, yet they provide smaller link capacities than the roadside APs. In this paper, we present a new association control technique that harnesses available connection duration as well as achievable link bandwidth in high-speed vehicular network environments. We also analyze the tradeoff between two association metrics, namely, available connection duration and achievable link bandwidth. Extensive simulation studies based on real traces demonstrate that our scheme significantly outperforms the previous methods.

Proactive Caching Strategy Based on Optimal Content Distribution in Content Centric Vehicular Networks (차량 네트워크에서 최적의 컨텐츠 분배 기반의 사전 캐싱 방안)

  • Park, Sungjin;Lee, Euisin
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.9 no.6
    • /
    • pp.131-136
    • /
    • 2020
  • In vehicular communications environment, content pre-caching can reduce the delay time from the user to the content server. However, the problem of where and how much pre-caching is still not solved. In this paper, based on the movement probability of the vehicle, we propose a method for pre-caching by distributing the optimized amount of content to each base station candidate that the vehicle will move as follows. First, the movement probability of each vehicle was learned using Markov Model. And the amount of content to be distributed and pre-cached was optimized based on the wireless environment. In experiments based on NS-3, the proposed strategy maintained the least delay compared to the existing protocol, leading to the most traffic-saving results.

Adaptive Transmission Scheme According to Vehicle Density in IEEE 802.11p MAC Protocol (IEEE 802.11p MAC 프로토콜에서 차량밀도에 따른 적응전송기법)

  • Woo, Ri-Na-Ra;Han, Dong-Seog
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.49 no.4
    • /
    • pp.53-58
    • /
    • 2012
  • The roadside unit (RSU) collects vehicle information from vehicles in the intelligent transportation system (ITS). The vehicle density on the road within the communication range of a RSU is a time varying parameter. The higher the vehicle density, the more vehicle information can be collected. Therefore, the probability of packet collision will be raised. In this paper, an adaptive transmission scheme is proposed to improve the probability of packet reception rate by changing the data rate and transmission period according to the vehicle density. The performance of IEEE 802.11p MAC protocol that is a standard for vehicular communications is evaulated in terms of the vehicle density with the ns-2,33 simulator.

Comparison of Topology Based-Routing Protocols in Wireless Network

  • Sharma, Vikas;Ganpati, Anita
    • Journal of Multimedia Information System
    • /
    • v.6 no.2
    • /
    • pp.61-66
    • /
    • 2019
  • VANET (Vehicular Ad-hoc Network) is a mobile Ad-hoc Network which deals with the moving vehicles. VANET supports Intelligent Transport Systems (ITS) which is related to different modes of transport and traffic management techniques. VANETs enabled users to be informed and make them safer. VANET uses IEEE 802.11p standard wireless access protocol for communication. An important and necessary issue of VANET is to design routing protocols. In a network, communication takes place by the use of the routing protocols. There are mainly two types of communications used such as Vehicle to Vehicle (V2V) and Vehicle to Infrastructure (V2I) in VANET. Vehicles can send and receive messages among them and also to and from infrastructure used. In this paper, AODV, DSR and DSDV are compared by analysing the results of simulation on various metrics such as average throughput, instant throughput, packet delivery ratio and residual energy. Findings indicates utilization of AODV and DSR is more applicable for these metrics as compared to DSDV. A network simulator (NS2) is used for simulation.

Traffic Congestion Management on Urban Roads using Vehicular Ad-hoc Network-based V2V and V2I Communications (차량 애드혹 네트워크 기반 V2V와 V2I 통신을 사용한 시내 도로에서의 교통 체증 관리)

  • Ryu, Minwoo;Cha, Si-Ho
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.18 no.2
    • /
    • pp.9-16
    • /
    • 2022
  • The nodes constituting the vehicle ad hoc network (VANET) are vehicles moving along the road and road side units (RSUs) installed around the road. The vehicle ad hoc network is used to collect the status, speed, and location information of vehicles driving on the road, and to communicate with vehicles, vehicles, and RSUs. Today, as the number of vehicles continues to increase, urban roads are suffering from traffic jams, which cause various problems such as time, fuel, and the environment. In this paper, we propose a method to solve traffic congestion problems on urban roads and demonstrate that the method can be applied to solve traffic congestion problems through performance evaluation using two typical protocols of vehicle ad hoc networks, AODV and GPSR. The performance evaluation used ns-2 simulator, and the average number of traffic jams and the waiting time due to the average traffic congestion were measured. Through this, we demonstrate that the vehicle ad hoc-based traffic congestion management technique proposed in this paper can be applied to urban roads in smart cities.

Network Throughput Analysis of Mechanical Relay Assisted Transmission in Wireless Line Networks (데이터 운송 중계기를 운용하는 무선 선형 네트워크에서의 전송률 성능 분석)

  • Jin, Hyun Bo;Min, Byung-Yoon;Seo, Jeongwook;Kim, Dong Ku
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39B no.4
    • /
    • pp.216-227
    • /
    • 2014
  • Mechanical Relay (McR) is a relaying architecture to enable data communications, where it can endure the transportation delay and intermittent disconnection. Every kind of vehicular infrastructures can be readily utilized for the mechanical relaying in the manner of moving natures, which brings the most significant consequences compared to conventional relaying schemes. In this paper, we analyze the ergodic network throughput of McR in wireless line networks (WLN) to compare the results between employing McRs and direct multi-hopping through the users without McRs. We demonstrate the McR scheme that are not only Ve-SISO but also Ve-SIMO/MISO. The numerical results of ergodic network throughputs contribute to the trade-off relation depending on the speed v of McRs, intensity factors ${\lambda}_u$ and ${\lambda}_r$, and the methods of how McRs are utilized.