• KIPS Transactions on Computer and Communication Systems
• /
• v.9 no.3
• /
• pp.67-76
• /
• 2020

With the fast development in wireless communications and vehicular technologies, vehicular ad hoc networks (VANETs) have enabled to deliver data between vehicles. Recently, VANETs introduce a Vehicular Cloud (VC) model for collaborating to share and use resources of vehicles to create value-added services. To construct a VC, a vehicle should search vehicles that intend to provide their own resource. The single-hop search cannot search enough provider vehicles due to a small coverage and non-line-of-sights of communications. On the other hand, the multi-hop search causes very high traffics for large coverage searching and frequent connection breakages. Recently, many Roadside Units (RSUs) have been deployed on roads to collect the information of vehicles in their own coverages and to connect them to Internet. Thus, we propose a RSU-aided vehicular resource search and cloud construction mechanism in VANETS. In the proposed mechanism, a RSU collects the information of location and mobility of vehicles and selects provider vehicles enabled to provide resources needed for constructing a VC of a requester vehicle based on the collected information. In the proposed mechanism, the criteria for determining provider vehicles to provide resources are the connection duration between each candidate vehicle and the requester vehicle, the resource size of each candidate vehicle, and its connection starting time to the requester vehicle. Simulation results verify that the proposed mechanism achieves better performance than the existing mechanism.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.12
• /
• pp.2272-2293
• /
• 2011

Communication technology of future networks is predicted to provide a large variety of services including WiFi service in vehicular network. In this paper, we assume that vehicles are embedded with WiMAX antenna and in-vehicle terminals receive WiMAX traffic through WiFi interface. This assumption will impose severe performance degradation due to interference among mobile BSSs when WiFi access points (APs) are densely located. Existing interference avoidance techniques cannot properly resolve the above problems and do not cope with dynamically moving vehicular scenario since they focus only on the fixed network topology. In this paper, we propose a mobility-aware interference avoidance scheme for WiFi services. The proposed scheme computes the interference duration by exploiting mobility vector and location information of neighboring APs. If the interference duration is not negligible, our scheme searches for another channel in order to avoid interference. However, if the interference duration is negligible, our scheme continues to use the channel to reduce switching overhead. To measure the effectiveness of the proposed scheme against other existing techniques, we evaluated performance by using OPNET simulator. Through the simulation, we obtained about 60% reduction in the maximum interference frequency and about 67% improvement in throughput. Furthermore, our scheme provides fair channel usage.

• Journal of Information Processing Systems
• /
• v.10 no.1
• /
• pp.103-118
• /
• 2014

Over the last couple of years, traditional VANET (Vehicular Ad Hoc NETwork) evolved into VANET-based clouds. From the VANET standpoint, applications became richer by virtue of the boom in automotive telematics and infotainment technologies. Nevertheless, the research community and industries are concerned about the under-utilization of rich computation, communication, and storage resources in middle and high-end vehicles. This phenomenon became the driving force for the birth of VANET-based clouds. In this paper, we envision a novel application layer of VANET-based clouds based on the cooperation of the moving cars on the road, called CaaS (Cooperation as a Service). CaaS is divided into TIaaS (Traffic Information as a Service), WaaS (Warning as a Service), and IfaaS (Infotainment as a Service). Note, however, that this work focuses only on TIaaS and WaaS. TIaaS provides vehicular nodes, more precisely subscribers, with the fine-grained traffic information constructed by CDM (Cloud Decision Module) as a result of the cooperation of the vehicles on the roads in the form of mobility vectors. On the other hand, WaaS provides subscribers with potential warning messages in case of hazard situations on the road. Communication between the cloud infrastructure and the vehicles is done through GTs (Gateway Terminals), whereas GTs are physically realized through RSUs (Road-Side Units) and vehicles with 4G Internet access. These GTs forward the coarse-grained cooperation from vehicles to cloud and fine-grained traffic information and warnings from cloud to vehicles (subscribers) in a secure, privacy-aware fashion. In our proposed scheme, privacy is conditionally preserved wherein the location and the identity of the cooperators are preserved by leveraging the modified location-based encryption and, in case of any dispute, the node is subject to revocation. To the best of our knowledge, our proposed scheme is the first effort to offshore the extended traffic view construction function and warning messages dissemination function to the cloud.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.11
• /
• pp.924-933
• /
• 2013

In this paper, we propose a modeling of the broadcasting in the IEEE 802.11p MAC protocol for the VANET(Vehicular Ad hoc Networks). Due to the fact that the beacon message which is needed for the safety services is shared via broadcasting, the analytical modeling of the broadcasting is crucial for the optimum design of the services. Two characteristics specific to the IEEE 802.11p are reflected in the modeling; the time limited CCH interval caused by the channel switching between the CCH and SCH, and no retransmission of the broadcasted messages. In the proposal, we assumed no restriction on the moment of generation of the beacon messages. We allow the messages to be generated and broadcasted within the whole CCH interval. Simulation results prove the accuracy of the proposed modeling. Noticeable improvements are also observed in terms of the performance indices such as the successful delivery ratio, transmission delay, and the variation of the delay.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.1
• /
• pp.142-152
• /
• 2016

GPS is not able to be used for indoor positioning and currently most of techniques emerging to overcome the limit of GPS utilize private wireless networks. However, these methods require high costs for installation and maintenance, and they are inappropriate to be used in the place where precise positioning is needed as in indoor parking lots. This paper proposes a vehicular indoor positioning method based on QR-code recognition. The method gets an absolute coordinate through QR-code scanning, and obtain the location (an relative coordinate) of a black-box camera using the tilt and roll angle correction through affine transformation, scale transformation, and trigonometric function. Using these information of an absolute coordinate and an relative one, the precise position of a car is estimated. As a result, average error of 13.79cm is achieved and it corresponds to just 27.6% error rate in contrast to 50cm error of the recent technique based on wireless networks.

• Journal of Korea Society of Industrial Information Systems
• /
• v.19 no.2
• /
• pp.1-13
• /
• 2014

In IEEE 802.11p/1609-based vehicular networks, vehicles are allowed to exchange safety and control messages only within time periods, called control channel (CCH) interval, which are scheduled periodically. Currently, the length of the CCH interval is set to the fixed value (i.e. 50ms). However, the fixed-length intervals cannot be effective for dynamically changing traffic load. Hence, some protocols have been recently proposed to support variable-length CCH intervals in order to improve channel utilization. In existing protocols, the CCH interval is subdivided into safety and non-safety intervals, and the length of each interval is dynamically adjusted to accommodate the estimated traffic load. However, they do not consider the presence of hidden nodes. Consequently, messages transmitted in each interval are likely to overlap with simultaneous transmissions (i.e. interference) from hidden nodes. Particularly, life-critical safety messages which are exchanged within the safety interval can be unreliably delivered due to such interference, which deteriorates QoS of safety applications such as cooperative collision warning. In this paper, we therefore propose a new interference-aware Dynamic Safety Interval (DSI) protocol. DSI calculates the number of vehicles sharing the channel with the consideration of hidden nodes. The safety interval is derived based on the measured number of vehicles. From simulation study using the ns-2, we verified that DSI outperforms the existing protocols in terms of various metrics such as broadcast delivery ration, collision probability and safety message delay.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.6C
• /
• pp.483-491
• /
• 2012

In vehicle-to-vehicle (V2V) communications, each vehicle should periodically disseminate a beacon message including the kinematics information, such as position, speed, steering, etc., so that a neighbor vehicle can better perceive and predict the movement of the vehicle. However, a simple broadcasting of such messages may lead to a low reception probability as well as an excessive delay. In this paper, we attempt to analyze the impact of the following key parameters of the beacon dissemination on the performance of vehicular networks: beacon period, carrier-sensing range, and contention window (CW) size. We first derive a beacon period which is inversely proportional to the vehicle speed. Next, we mathematically formulate the maximum beacon load to demonstrate the necessity of the transmit power control. We finally present an approximate closed-form solution of the optimal CW size that leads to the maximum throughput of beacon messages in vehicular networks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.7
• /
• pp.543-552
• /
• 2013

For the safety messages in IEEE 802.11p/WAVE vehicles network environment, strict periodic beacon broadcasting requires status advertisement to assist the driver for safety. In crowded networks where beacon message are broadcasted at a high number of frequencies by many vehicles, which used for beacon sending, will be congested by the wireless medium due to the contention-window based IEEE 802.11p MAC. To resolve the congestion, we consider a MAC scheme based on slotted p-persistent CSMA as a simple non-cooperative Bayesian game which involves payoffs reflecting the attempt probability. Then, we derive Bayesian Nash Equilibrium (BNE) in a closed form. Using the BNE, we propose new congestion control algorithm to improve the performance of the beacon rate under saturation condition in IEEE 802.11p/WAVE vehicular networks. This algorithm explicitly computes packet delivery probability as a function of contention window (CW) size and number of vehicles. The proposed algorithm is validated against numerical simulation results to demonstrate its stability.

• The Journal of Korean Institute of Next Generation Computing
• /
• v.13 no.5
• /
• pp.51-70
• /
• 2017

The reliability of broadcasting over vehicular ad hoc networks (VANETs) is one of the most critical factors for driving safety applications. There exists limitations to improve the reliability of broadcast transmissions in saturated VANETs where previous proposals in literature tackle the problem by heuristically adapting the size of the contention window (CW). This paper considers improving the reliability by proposing a new probability model based on the counting methods of permutations and combinations, which counts all the possible cases of broadcast failures in a single-hop broadcast transmission for a given CW. From the model, we calculate the best CW size given the number of contention nodes, which significantly improves the reliability and satisfying the timely dissemination of emergency broadcasting messages. Through extensive VANET simulations with varying densities, we show that our model maintains near 100 percent success rate for single-hop broadcast as well as multi-hop broadcast (e.g. 40 hops) and achieves minimal broadcast delay.