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: This work set up to propose Ant Colony Optimization (ACO) methodologies that take advantage of information available in vehicular networks such as the vehicles’ position and speed, in order to design an ant-based algorithm that performs well in the dynamics of such networks and adapts to the conditions appropriately.
Abstract: When Vehicles communicating among themselves, and communicating to devices located in the margins of roads and highways form Vehicular Ad hoc Networks (VANETs) that are a suitable type of Mobile Ad hoc Networks (MANETs). VANET can go upto a high speed of network nodes that can go up to 200 km/h, and which impacts directly on the capability the network has to deliver data, we can have a network formed for a small amount of time. Ant-based routing can be successfully incorporated to both wireless and wired networks as it has been checked it various tests. This work set ups to propose Ant Colony Optimization (ACO) methodologies that take advantage of information available in vehicular networks such as the vehicles’ position and speed, in order to design an ant-based algorithm that performs well in the dynamics of such networks and adapts to the conditions appropriately.
3 citations
16 Dec 2013
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.
3 citations
Cites background from "On developing smart applications fo..."
...[4] Gustavo Marfiay, Giovanni Pau, and Marco Roccettiy, “On Developing Smart Applications for VANETs:Where are we now? Some Insights on Technical Issues and Open Problems,” IEEE, 2009....
[...]
01 Jan 2014
TL;DR: This paper considers the scenario where players are directly connected with each other, without relying on the infrastructure, to leverage on a hybrid architecture that allows client-server games to be played in adhoc mode.
Abstract: Outdoor games are becoming an interesting opportunity thanks to the wide popularity of both games and mobile devices. In this paper, we consider the scenario where players are directly connected with each other, without relying on the infrastructure. To this end, we leverage on a hybrid architecture that allows client-server games to be played in adhoc mode. The energy consumption problem is addressed through the presence of background servers that alternate in acting as the game server. Realistic simulations on both ns-2 and ns-3 are exploited to evaluate this solution also providing a comparison of the two simulation frameworks.
3 citations
24 Jul 2012
TL;DR: An aggregate parameter based on weights for congestion detection is proposed, which can monitor the network performance from the four aspects: Messages Delivered Ratio (MDR), Average Delay (AD), Throughput and Overhead Ratio (OR), so as to achieve the purpose of the congestion detection.
Abstract: Vehicular ad hoc networks (VANETs), which are a class of Mobile ad hoc networks, have recently been developed as a standard means of communication among moving vehicles. Congestion is one of the key issues which can restrict the Network performance, and it is no exception for VANETs. Congestion control mechanisms include three phases: congestion detection, congestion notification and rate adjustment. Congestion detection is the first stage of congestion control mechanisms, and it is also the content what this paper focuses on. Because the available resources are limited, and the network topology and node density change over time, applying conventional congestion detection protocols to VANETs can be problematic. To address this challenge, this paper proposes an aggregate parameter based on weights for congestion detection, which can monitor the network performance from the four aspects: Messages Delivered Ratio (MDR), Average Delay (AD), Throughput and Overhead Ratio (OR), so as to achieve the purpose of the congestion detection. In addition, we introduce the method of normalizing the above four parameters, which make the aggregate parameter more accurate. Finally, simulation results show that the aggregate parameter is correct and effective.
2 citations
Cites background from "On developing smart applications fo..."
...The second approach is more pervasive and is based on the idea of gathering road traversal times from probe vehicles [11]....
[...]
Posted Content•
TL;DR: Simulation results clearly show the robustness of the technique by eliminating the misdetections and reducing to a great extent the false alarms, and a framework that can be used to define and compare such schemes in a variety of scenarios is introduced.
Abstract: VANETs are considered as networks of critical future importance, with the main concern being the safety of travelers and infrastructure. A lot of methods for coordination and channel allocation in the context of VANETs are being introduced. As such, the need of a framework to reliably compare the relative performances of different channel sensing, allocation and coordination schemes which takes into account the movement of vehicles is felt. In this paper, we introduce a framework that can be used to define and compare such schemes in a variety of scenarios. Simulation results clearly show the robustness of our technique by eliminating the misdetections and reducing to a great extent the false alarms.
1 citations
Cites background from "On developing smart applications fo..."
...3 INTRODUCTION Recent years have seen a rise in research in Vehicular Ad-hoc Networks (VANETs) for safety [1] and entertainment [2] applications....
[...]
References
More filters
25 Feb 1999
TL;DR: An ad-hoc network is the cooperative engagement of a collection of mobile nodes without the required intervention of any centralized access point or existing infrastructure and the proposed routing algorithm is quite suitable for a dynamic self starting network, as required by users wishing to utilize ad- hoc networks.
Abstract: An ad-hoc network is the cooperative engagement of a collection of mobile nodes without the required intervention of any centralized access point or existing infrastructure. We present Ad-hoc On Demand Distance Vector Routing (AODV), a novel algorithm for the operation of such ad-hoc networks. Each mobile host operates as a specialized router, and routes are obtained as needed (i.e., on-demand) with little or no reliance on periodic advertisements. Our new routing algorithm is quite suitable for a dynamic self starting network, as required by users wishing to utilize ad-hoc networks. AODV provides loop-free routes even while repairing broken links. Because the protocol does not require global periodic routing advertisements, the demand on the overall bandwidth available to the mobile nodes is substantially less than in those protocols that do necessitate such advertisements. Nevertheless we can still maintain most of the advantages of basic distance vector routing mechanisms. We show that our algorithm scales to large populations of mobile nodes wishing to form ad-hoc networks. We also include an evaluation methodology and simulation results to verify the operation of our algorithm.
11,360 citations
"On developing smart applications fo..." refers methods in this paper
...In Figure 1 we plot the delivery ratio, using the AODV [30] routing protocol, with and without the use of the AP infrastructure....
[...]
01 Jan 2002
TL;DR: A survey of mobility models that are used in the simulations of ad hoc networks and illustrates how the performance results of an ad hoc network protocol drastically change as a result of changing the mobility model simulated.
4,618 citations
01 Aug 2002
TL;DR: In this paper, a survey of mobility models used in the simulations of ad hoc networks is presented, which illustrate the importance of choosing a mobility model in the simulation of an ad hoc network protocol.
Abstract: In the performance evaluation of a protocol for an ad hoc network, the protocol should be tested under realistic conditions including, but not limited to, a sensible transmission range, limited buffer space for the storage of messages, representative data traffic models, and realistic movements of the mobile users (i.e., a mobility model). This paper is a survey of mobility models that are used in the simulations of ad hoc networks. We describe several mobility models that represent mobile nodes whose movements are independent of each other (i.e., entity mobility models) and several mobility models that represent mobile nodes whose movements are dependent on each other (i.e., group mobility models). The goal of this paper is to present a number of mobility models in order to offer researchers more informed choices when they are deciding upon a mobility model to use in their performance evaluations. Lastly, we present simulation results that illustrate the importance of choosing a mobility model in the simulation of an ad hoc network protocol. Specifically, we illustrate how the performance results of an ad hoc network protocol drastically change as a result of changing the mobility model simulated.
4,391 citations
01 Aug 1999
TL;DR: This paper proposes several schemes to reduce redundant rebroadcasts and differentiate timing of rebroadcast to alleviate the broadcast storm problem, which is identified by showing how serious it is through analyses and simulations.
Abstract: Broadcasting is a common operation in a network to resolve many issues. In a mobile ad hoc network (MANET) in particular, due to host mobility, such operations are expected to be executed more frequently (such as finding a route to a particular host, paging a particular host, and sending an alarm signal). Because radio signals are likely to overlap with others in a geographical area, a straightforward broadcasting by flooding is usually very costly and will result in serious redundancy, contention, and collision, to which we call the broadcast storm problem. In this paper, we identify this problem by showing how serious it is through analyses and simulations. We propose several schemes to reduce redundant rebroadcasts and differentiate timing of rebroadcasts to alleviate this problem. Simulation results are presented, which show different levels of improvement over the basic flooding approach.
3,819 citations
Additional excerpts
...broadcast storms [11]) overwhelms the communication network....
[...]
12 Nov 2000
TL;DR: Key requirements are identified, a small device is developed that is representative of the class, a tiny event-driven operating system is designed, and it is shown that it provides support for efficient modularity and concurrency-intensive operation.
Abstract: Technological progress in integrated, low-power, CMOS communication devices and sensors makes a rich design space of networked sensors viable. They can be deeply embedded in the physical world and spread throughout our environment like smart dust. The missing elements are an overall system architecture and a methodology for systematic advance. To this end, we identify key requirements, develop a small device that is representative of the class, design a tiny event-driven operating system, and show that it provides support for efficient modularity and concurrency-intensive operation. Our operating system fits in 178 bytes of memory, propagates events in the time it takes to copy 1.25 bytes of memory, context switches in the time it takes to copy 6 bytes of memory and supports two level scheduling. The analysis lays a groundwork for future architectural advances.
3,648 citations