On developing smart applications for VANETs: Where are we now? some insights on technical issues and open problems
04 Dec 2009-pp 1-6
TL;DR: Partially reviewing the research in this space and finding out how well can applications such as peer-to-peer file sharing and gaming can be supported, and an understanding of how far ahead in time is the implementation of the cited scenarios on a distributed vehicular ad hoc network.
Abstract: The advances in research on ad hoc networks, the availability of cheap radio interfaces (e.g. WiFi) and the increasing amount of electronic devices installed in vehicles have set the path for vehicular ad hoc networks. In the past few years, vehicular ad hoc network (VANET) research has addressed all layers, trying to optimize from the physical layer to the application layer to support the design of new possible application scenarios. It is often difficult to find a comprehensive approach to VANETs, due to their complexity. It is also often difficult to realize how far, technically, is the implementation of VANET-based application scenarios. We here propose to take one step in such direction, partially reviewing the research in this space and finding out how well can applications such as peer-to-peer file sharing and gaming can be supported. Our final scope is to provide an understanding of how far ahead in time, from the technological point of view, is the implementation of the cited scenarios on a distributed vehicular ad hoc network.
Citations
More filters
TL;DR: A lightweight authentication protocol for RFID (Radio-Frequency Identification devices) has been proposed to overcome the drawbacks of existing solutions and to provide better performance in terms of low detection time, low CPU and memory consumption to strengthen the existing IoV environment.
188 citations
TL;DR: An algorithm is devised that, exploiting probe vehicles, for any given road, identifies if it is congested or not and provides the estimation that a current congested state will last for at least a given time interval and can be applied to any type of road.
Abstract: While vehicular congestion is very often defined in terms of aggregate parameters, such as traffic volume and lane occupancies, based on recent findings, the interpretation that receives most credit is that of a state of a road where traversing vehicles experience a delay exceeding the maximum value typically incurred under light or free-flow traffic conditions. We here propose a new definition according to which a road is in a congested state (be it high or low) only when the likelihood of finding it in the same congested state is high in the near future. Based on this new definition, we devised an algorithm that, exploiting probe vehicles, for any given road 1) identifies if it is congested or not and 2) provides the estimation that a current congested state will last for at least a given time interval. Unlike any other existing approach, an important advantage of ours is that it can generally be applied to any type of road, as it neither needs any a priori knowledge nor requires the estimation of any road parameter (e.g., number of lanes, traffic light cycle, etc.). Further, it allows performing short-term traffic congestion forecasting for any given road. We present several field trials gathered on different urban roads whose empirical results confirm the validity of our approach.
73 citations
09 Jan 2014
TL;DR: This work has addressed the utility of metaheuristic algorithms (PSO, GA) for inter VANET sensor data handovers in order to study the performance analysis to maximize the throughput & reliability improvement in real VANet.
Abstract: VEHICULAR ad hoc networks (VANETs) are the self-configuring networks where the nodes are vehicles (equipped with on-board computers), elements of roadside infrastructure, sensors, and pedestrian personal devices. In the current state of the art in this field there is a need of studies on real outdoor experiments to validate the new VANETs optimizing protocols and applications. Thus exchanging up-to-date information among vehicles is the most salient feature of a VANET. In order to do so, the packets have to travel through the network from one node to the others & thus give rise to concept of inter VANET data handovers & VDTP (Vehicular data transfer Protocol). In this work, we have addressed the utility of metaheuristic algorithms (PSO, GA) for inter VANET sensor data handovers in order to study the performance analysis to maximize the throughput & reliability improvement in real VANET.
8 citations
Cites methods from "On developing smart applications fo..."
...So as per previous observations the successful design and implementation of an application depends on a correct interpretation of the key elements like Broadcast Optimization, Fairness and Admission Control [4] underlying to which the behavior of the network can be specified which runs on it....
[...]
TL;DR: A survey on network optimization in IoT and IoV is presented in this article , where the authors highlight the potential of IoV for intelligent transportation systems (ITS) using IoV.
Abstract: The Internet of Things (IoT) has risen from ubiquitous computing to the Internet itself. Internet of vehicles (IoV) is the next emerging trend in IoT. We can build intelligent transportation systems (ITS) using IoV. However, overheads are imposed on IoV network due to a massive quantity of information being transferred from the devices connected in IoV. One such overhead is the network connection between the units of an IoV. To make an efficient ITS using IoV, optimization of network connectivity is required. A survey on network optimization in IoT and IoV is presented in this study. It also highlights the backdrop of IoT and IoV. This includes the applications, such as ITS with comparison to different advancements, optimization of the network, IoT discussions, along with categorization of algorithms. Some of the simulation tools are also explained which will help the research community to use those tools for pursuing research in IoV.
5 citations
19 Mar 2012
TL;DR: This article analyzes the different approaches and opportunities related to the use sensor-equipped smartphones to generate and distribute context related data both automatically and through appealing user applications (e.g., games).
Abstract: In this article, we explore the technical implications related to Web Squared paradigm. Representing an evolution of Web 2.0 that emphasizes the interaction between the cyber world and the real world, Web Squared contemplates the use of sensors to share huge amounts of data and foster the creation of new services. In this context, we analyze the different approaches and opportunities related to the use sensor-equipped smartphones to generate and distribute context related data both automatically and through appealing user applications (e.g., games). We discuss a general methodology to adopt when devising smartphone-based distributed sensing applications and explore both the issues and adopted solutions in this context. Finally, we identify unresolved technical challenges limiting the widespread deployment of Web Squared services, which deserve future research effort.
4 citations
Cites background from "On developing smart applications fo..."
...Nowadays, any object casts an information shadow which, if captured and processed intelligently, could be used to generate new pervasive services [4, 5, 6, 7, 8]....
[...]
References
More filters
09 Jul 2003
TL;DR: This study examines the random waypoint model widely used in the simulation studies of mobile ad hoc networks and shows that this model fails to provide a steady state in that the average nodal speed consistently decreases over time, and should not be directly used for simulation.
Abstract: This study examines the random waypoint model widely used in the simulation studies of mobile ad hoc networks. Our findings show that this model fails to provide a steady state in that the average nodal speed consistently decreases over time, and therefore should not be directly used for simulation. We show how unreliable results can be obtained by using this model. In particular, certain ad hoc routing metrics can drop by as much as 40% over the course of a 900-second simulation using the random waypoint model. We give both an intuitive and a formal explanation for this phenomenon. We also propose a simple fix of the problem and discuss a few alternatives. Our modified random waypoint model is able to reach a steady state and simulation results are presented.
1,268 citations
"On developing smart applications fo..." refers methods in this paper
...Mobility has been at first modelled using simplistic approaches such as random waypoint [8] or group mobility models [9]....
[...]
03 Nov 2004
TL;DR: It appears very hard to significantly improve upon the rate obtained by Deluge and it is argued that the rates obtained for dissemination are inherently lower than that for single path propagation.
Abstract: To support network programming, we present Deluge, a reliable data dissemination protocol for propagating large data objects from one or more source nodes to many other nodes over a multihop, wireless sensor network. Deluge builds from prior work in density-aware, epidemic maintenance protocols. Using both a real-world deployment and simulation, we show that Deluge can reliably disseminate data to all nodes and characterize its overall performance. On Mica2-dot nodes, Deluge can push nearly 90 bytes/second, one-ninth the maximum transmission rate of the radio supported under TinyOS. Control messages are limited to 18% of all transmissions. At scale, the protocol exposes interesting propagation dynamics only hinted at by previous dissemination work. A simple model is also derived which describes the limits of data propagation in wireless networks. Finally, we argue that the rates obtained for dissemination are inherently lower than that for single path propagation. It appears very hard to significantly improve upon the rate obtained by Deluge and we identify establishing a tight lower bound as an open problem.
1,152 citations
01 Oct 2004
TL;DR: The results show the approach proposed is feasible for vehicle safety messages in DSRC and is compatible with the Dedicated Short Range Communications (DSRC) multi-channel architecture.
Abstract: This paper studies the design of layer-2 protocols for a vehicle to send safety messages to other vehicles. The target is to send vehicle safety messages with high reliability and low delay. The communication is one-to-many, local, and geo-significant. The vehicular communication network is ad-hoc, highly mobile, and with large numbers of contending nodes. The messages are very short, have a brief useful lifetime, but must be received with high probability. For this environment, this paper explores the efficacy of rapid repetition of broadcast messages. This paper proposes several random access protocols for medium access control. The protocols are compatible with the Dedicated Short Range Communications (DSRC) multi-channel architecture. Analytical bounds on performance of the proposed protocols are derived. Simulations are conducted to assess the reception reliability and channel usage of the protocols. The sensitivity of the protocol performance is evaluated under various offered traffic and vehicular traffic flows. The results show our approach is feasible for vehicle safety messages in DSRC.
755 citations
01 Nov 2003
TL;DR: This framework aims to evaluate the impact of different mobility models on the performance of MANET routing protocols, and attempts to decompose the reactive routing protocols into mechanistic ‘‘building blocks’’ to gain a deeper insight into the performance variations across protocols in the face of mobility.
Abstract: A Mobile Ad hoc Network (MANET) is a collection of wireless mobile nodes forming a temporary network without using any existing infrastructure. Since not many MANETs are currently deployed, research in this area is mostly simulation based. Random Waypoint is the commonly used mobility model in these simulations. Random Waypoint is a simple model that may be applicable to some scenarios. However, we believe that it is not sufficient to capture some important mobility characteristics of scenarios in which MANETs may be deployed. Our framework aims to evaluate the impact of different mobility models on the performance of MANET routing protocols. We propose various protocol independent metrics to capture interesting mobility characteristics, including spatial and temporal dependence and geographic restrictions. In addition, a rich set of parameterized mobility models is introduced including Random Waypoint, Group Mobility, Freeway and Manhattan models. Based on these models several test-suite scenarios are chosen carefully to span the metric space. We demonstrate the utility of our test-suite by evaluating various MANET routing protocols, including DSR, AODV and DSDV. Our results show that the protocol performance may vary drastically across mobility models and performance rankings of protocols may vary with the mobility models used. This effect can be explained by the interaction of the mobility characteristics with the connectivity graph properties. Finally, we attempt to decompose the reactive routing protocols into mechanistic ‘‘building blocks’’ to gain a deeper insight into the performance variations across protocols in the face of mobility. � 2003 Elsevier B.V. All rights reserved.
560 citations
"On developing smart applications fo..." refers background in this paper
...Authors of [6] decompose reactive protocols into building blocks to expose the mechanisms which are more sensitive to mobility....
[...]
...It has soon been realized that the realism of simulation results for VANETs heavily depends on the used mobility models which should match as close as possible real mobility scenarios [6]....
[...]
01 Oct 2004
TL;DR: A feasibility study of delay-critical safety applications over vehicular ad hoc networks based on the emerging dedicated short range communications (DSRC) standard reveals that DSRC achieves promising latency performance, yet, the throughput performance needs further improvement.
Abstract: In this paper we conduct a feasibility study of delay-critical safety applications over vehicular ad hoc networks based on the emerging dedicated short range communications (DSRC) standard. In particular, we quantify the bit error rate, throughput and latency associated with vehicle collision avoidance applications running on top of mobile ad hoc networks employing the physical and MAC layers of DSRC. Towards this objective, the study goes through two phases. First, we conduct a detailed simulation study of the DSRC physical layer in order to judge the link bit error rate performance under a wide variety of vehicles speeds and multi-path delay spreads. We observe that the physical layer is highly immune to large delay spreads that might arise in the highway environment whereas performance degrades considerably at high speeds in a multi-path environment. Second, we develop a simulation testbed for a DSRC vehicular ad hoc network executing vehicle collision avoidance applications in an attempt to gauge the level of support the DSRC standard provides for this type of applications. Initial results reveal that DSRC achieves promising latency performance, yet, the throughput performance needs further improvement.
504 citations