• Title/Summary/Keyword: ad hoc Network

Search Result 1,661, Processing Time 0.026 seconds

Identity-Exchange based Privacy Preserving Mechanism in Vehicular Networks (차량 네트워크에서 신원교환을 통해 프라이버시를 보호하는 방법)

  • Hussain, Rasheed;Oh, Heekuck
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.24 no.6
    • /
    • pp.1147-1157
    • /
    • 2014
  • Intelligent transportation system (ITS) is realized through a highly ephemeral network, i.e. vehicular ad hoc network (VANET) which is on its way towards the deployment stage, thanks to the advancements in the automobile and communication technologies. However, it has not been successful, at least to date, to install the technology in the mass of vehicles due to security and privacy challenges. Besides, the users of such technology do not want to put their privacy at stake as a result of communication with peer vehicles or with the infrastructure. Therefore serious privacy measures should be taken before bringing this technology to the roads. To date, privacy issues in ephemeral networks in general and in VANET in particular, have been dealt with through various approaches. So far, multiple pseudonymous approach is the most prominent approach. However, recently it has been found out that even multiple pseudonyms cannot protect the privacy of the user and profilation is still possible even if different pseudonym is used with every message. Therefore, another privacy-aware mechanism is essential in vehicular networks. In this paper, we propose a novel identity exchange mechanism to preserve conditional privacy of the users in VANET. Users exchange their pseudonyms with neighbors and then use neighbors' pseudonyms in their own messages. To this end, our proposed scheme conditionally preserves the privacy where the senders of the message can be revoked by the authorities in case of any dispute.

Secure and Efficient V2V Message Authentication Scheme in Dense Vehicular Communication Networks (차량 밀집환경에서 안전하고 효율적인 V2V 메시지 인증기법)

  • Jung, Seock-Jae;Yoo, Young-Jun;Paik, Jung-Ha;Lee, Dong-Hoon
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.20 no.4
    • /
    • pp.41-52
    • /
    • 2010
  • Message authentication is an essential security element in vehicular ad-hoc network(VANET). For a secure message authentication, integrity, availability, privacy preserving skill, and also efficiency in various environment should be provided. RAISE scheme has been proposed to provide efficient message authentication in the environment crowded with lots of vehicles and generally considered to be hard to provide efficiency. However, as the number of vehicles communicating in the area increases, the overhead is also incurred in proportion to the number of vehicles so that it still needs to be reduced, and the scheme is vulnerable to some attacks. In this paper, to make up for the vulnerabilities in dense vehicular communication network, we propose a more secure and efficient scheme using a process that RSU(Road Side Unit) transmits the messages of neighbor vehicles at once with Bloom Filter, and timestamp to protect against replay attack. Moreover, by adding a handover function to the scheme, we simplify the authentication process as omitting the unnecessary key-exchange process when a vehicle moves to other area. And we confirm the safety and efficiency of the scheme by simulating the false positive probability and calculating the traffic.

Efficient Broadcasting Scheme of Emergency Message based on VANET and IP Gateway (VANET과 IP 게이트웨이에 기반한 긴급메시지의 효율적 방송 방법)

  • Kim, Dongwon;Park, Mi-Ryong
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.16 no.4
    • /
    • pp.31-40
    • /
    • 2016
  • In vehicular ad-hoc networks (VANETs), vehicles sense information on emergency incidents (e.g., accidents, unexpected road conditions, etc.) and propagate this information to following vehicles and a server to share the information. However, this process of emergency message propagation is based on multiple broadcast messages and can lead to broadcast storms. To address this issue, in this work, we use a novel approach to detect the vehicles that are farthest away but within communication range of the transmitting vehicle. Specifically, we discuss a signal-to-noise ratio (SNR)-based linear back-off (SLB) scheme where vehicles implicitly detect their relative locations to the transmitter with respect to the SNR of the received packets. Once the relative locations are detected, nodes that are farther away will set a relatively shorter back-off to prioritize its forwarding process so that other vehicles can suppress their transmissions based on packet overhearing. We evaluate SLB using a realistic simulation environment which consists of a NS-3 VANET simulation environment, a software-based WiFi-IP gateway, and an ITS server operating on a separate machine. Comparisons with other broadcasting-based schemes indicate that SLB successfully propagates emergency messages with latencies and hop counts that is close to the experimental optimal while reducing the number of transmissions by as much as 1/20.

Vehicle-to-Vehicle Broadcast Protocols Based on Wireless Multi-hop Communication (무선 멀티 홉 통신 기반의 차량간 브로드캐스트 프로토콜)

  • Han, Yong-Hyun;Lee, Hyuk-Joon;Choi, Yong-Hoon;Chung, Young-Uk
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.8 no.4
    • /
    • pp.53-64
    • /
    • 2009
  • Inter-vehicular communication that propagates information without infrastructures has drawn a lot of interest. However, it is difficult to apply conventional ad-hoc routing protocols directly in inter-vehicular communication due to frequent changes in the network topology caused by high mobility of the vehicles. MMFP(Multi-hop MAC Forwarding) is a unicast forwarding protocol that transport packets based on the reachability information instead of path selection or position information. However, delivering public safety messages informing road conditions such as collision, obstacles and fog through inter-vehicular communication requires broadcast rather than unicast since these messages contain information valuable to most drivers within a close proximity. Flooding is one of the simplest methods for multi-hop broadcast, but it suffers from reduced packet delivery-ratio and high transmission delay due to an excessive number of duplicated packets. This paper presents two multi-hop broadcast protocols for inter-vehicular communication that extend the MMFP. UMHB(Unreliable Multi-Hop Broadcast) mitigates the duplicated packets of MMFP by limiting the number of nodes to rebroadcast packets. UMHB, however, still suffers from low delivery ratio. RMHB(Reliable Multi-Hop Broadcast) uses acknowledgement and retransmission in order to improve the reliability of UMHB at the cost of increase in transmission delay, which we show through simulation is within an acceptable range for collision avoidance application.

  • PDF

Model for the Connection-Time of Vehicle-to-Mobile RSU (V2MR) Communications Near a Bus Station (버스 정류소 주변에서 자동차-이동기지국 (V2MR) 통신의 연결시간에 대한 성능분석모형)

  • Jeong, Han-You;Purnaningtyas, Magdalena Trie;Nguyen, Hoa-Hung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.12
    • /
    • pp.1969-1977
    • /
    • 2016
  • We study the connection time of vehicle-to-mobile roadside unit (V2MR) communications which can reduce the significant cost of the fixed RSU by installing a gateway of mobile network into a transit bus called the mobile RSU. In the V2MR communications, the connectivity of a commute vehicle can be improved via ad-hoc connection to a nearby mobile RSU. In this paper, we present a new analysis model to estimate the connection time between a commute vehicle and a mobile RSU, when there is a bus station in the overlapping route. Since the connection time between two vehicles is highly dynamic and unpredictable, our analysis will provide a fundamental basis of connection-time estimation of V2MR communications. Numerical results obtained from VEINS simulation show that our analysis can estimate the connection time of V2MR communications with the average error below 1.0 percent. Moreover, we show that the average connection time of V2MR communications can be extended to approximately 3.85 times of that of V2R communications.

Improved Cluster Routing Algorithm Using Remaining Electric Energy Based on CBRP (CBRP 기반 잔여전력량을 이용한 개선된 클러스터 라우팅 기법)

  • Park, Hyeran;Kim, Wuwoan;Jang, Sangdong
    • Journal of the Korea Society of Computer and Information
    • /
    • v.18 no.1
    • /
    • pp.63-71
    • /
    • 2013
  • In the Cluster-Based Routing Protocol (CBRP) a cluster header in each cluster should be elected. The cluster headers consume energy much more than other member nodes do because they manage and operate all of mobile nodes in their cluster. The traditional CBRP elects a cluster header without considering the remaining electric energy of each node. So, there exist problems that the cluster header has short average lifetime, and a new cluster header should be elected again frequently. In this paper, we propose the improved protocol which prolongs the lifetime of the cluster header, decreases the problem of re-electing the cluster header and enhances the stability of the path. In order to achieve this, when a cluster header is elected in a cluster, the remaining electric energies of all the nodes are compared with one another, and the node with the highest energy is elected as the cluster header. Also, the node with the second highest energy is elected as the second header. If the elected cluster header is unable to perform the role of the cluster header any more because the remaining energy level goes low, it sends a beacon message to neighbor member nodes, then the second header will serve as the cluster header.

A Key Management Scheme for Ad hoc Sensor Networks (애드 혹 센서 네트워크를 위한 키 관리 방안)

  • Kim Seung-Hae;Chung Byung-Ho;Wang Gi-Cheol;Cho Gi-Hwan
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.43 no.7 s.349
    • /
    • pp.32-40
    • /
    • 2006
  • It is very important to establish a pairwise key securely in wireless sensor networks. Because sensor networks consist of devices with weak physical security, they are likely to be compromised by an attacker. However, some approaches using key pre-distribution and other approaches using one hop local keys are known to be very vulnerable to threats caused by compromised nodes, even a small number. This paper proposes a scheme where each node establishes three hop local keys and employs them for a later pairwise key establishment. When any two nodes agree a pairwise key, all nodes on the route between two nodes contribute to the agreement of the pairwise key. Here, the initial three hop local keys are employed for encrypting a secret key delivered from a node to other nodes. Therefore, the proposed scheme bothers attackers to compromise much more nodes than the scheme using one hop local keys only. The simulation results have proven that the proposed scheme provides better performance and higher security than the scheme using one hop local keys in terms of message exchange, the number of encryption and decryption, and pairwise key exposure rate.

Enhancement of the Detection Probability for Distributed Cooperative Spectrum Sensing using UWB as a Common Channel (UWB 신호채널을 사용한 분산협력 스펙트럼 센싱의 검출확률 향상)

  • Islam, A.B.M.Tariqul;Song, Ju-Bin
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.45 no.7
    • /
    • pp.22-31
    • /
    • 2008
  • Cognitive radio should imply a proper sensing technique for detecting the presence of licensed users to identify the unused spectrum holes. Besides this, this information should also be used to opportunistically provide communication among secondary users. At the same time the performance of the primary user should not be declined by the secondary users. The detection of licensed users may be significantly difficult for shadowing effect. To prevail over this problem cooperative spectrum sensing, In which the combined observation information gained by multiple secondary users is employed to achieve higher performance of detection, has been inspected. However, the primary challenge of cooperative sensing lays in its ability to detect the presence of licensed user quickly and accurately. In this paper, we have used UltraWideBand (UWB) to detect the presence of licensed users and transmit the sensing information among the nodes of the network. UWB has the capability of transmitting data at a very high rate. It is unique in co-existence capability with narrow band systems. Here, we have shown that the detection probability of licensed user is improved by means of transmitting the spectrum sensing information via UWB. We also have analyzed the throughput of the proposed technique and compared the result with existing sensing method.

Multi-Channel MAC Protocol Based on V2I/V2V Collaboration in VANET (VANET에서 V2I/V2V 협력 기반 멀티채널 MAC 프로토콜)

  • Heo, Sung-Man;Yoo, Sang-Jo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.1
    • /
    • pp.96-107
    • /
    • 2015
  • VANET technologies provide real-time traffic information for mitigating traffic jam and preventing traffic accidents, as well as in-vehicle infotainment service through Telematics/Intelligent Transportation System (ITS). Due to the rapid increasement of various requirements, the vehicle communication with a limited resource and the fixed frame architecture of the conventional techniques is limited to provide an efficient communication service. Therefore, a new flexible operation depending on the surrounding situation information is required that needs an adaptive design of the network architecture and protocol for efficiently predicting, distributing and sharing the context-aware information. In this paper, Vehicle-to-Infrastructure (V2I) based on communication between vehicle and a Road Side Units (RSU) and Vehicle-to-Vehicle (V2V) based on communication between vehicles are effectively combined in a new MAC architecture and V2I and V2V vehicles collaborate in management. As a result, many vehicles and RSU can use more efficiently the resource and send data rapidly. The simulation results show that the proposed method can achieve high resource utilization in accordance. Also we can find out the optimal transmission relay time and 2nd relay vehicle selection probability value to spread out V2V/V2I collaborative schedule message rapidly.

A Secure and Privacy-Aware Route Tracing and Revocation Mechanism in VANET-based Clouds (VANET 기반 클라우드 환경에서 안전과 프라이버시를 고려한 경로추적 및 철회 기법)

  • Hussain, Rasheed;Oh, Heekuck
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.24 no.5
    • /
    • pp.795-807
    • /
    • 2014
  • Vehicular Ad hoc Network (VANET) has gone through a rich amount of research and currently is making its way towards the deployment. However, surprisingly it evolved to rather more applications and services-rich breed referred to as VANET-based clouds due to the advancements in the automobile and communication technologies. Security and privacy have always been the challenges for the think tanks to deploy this technology on mass scale. It is even worse that some security issues are orthogonally related to each other such as privacy, revocation and route tracing. In this paper, we aim at a specific VANET-based clouds framework proposed by Hussain et al. namely VANET using Clouds (VuC) where VANET and cloud infrastructure cooperate with each other in order to provide VANET users (more precisely subscribers) with services. We specifically target the aforementioned conflicted privacy, route tracing, and revocation problem in VANET-based clouds environment. We propose a multiple pseudonymous approach for privacy reasons and leverage the beacons stored in the cloud infrastructure for both route tracing and revocation. In the proposed scheme, revocation authorities after colluding, can trace the path taken by the target node for a specified timespan and can also revoke the identity if needed. Our proposed scheme is secure, conditional privacy preserved, and is computationally less expensive than the previously proposed schemes.