Dissemination of information in inter-vehicle ad hoc networks

Cenerario, Nicolas; Delot, Thierry; Ilarri, Sergio

doi:10.1109/ivs.2008.4621310

Cited by 22 publications

(19 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The authors in [15] have suggested a generalised information dissemination technique for vehicle-to-vehicle (V2V) communication by taking into account the type of event as well as the relevance of data to the drivers. In [16], Zhong et al have proposed an algorithm for disseminating real-time traffic information where vehicles make local decision about when and how to disseminate information.…”

Section: Related Workmentioning

confidence: 99%

“…IG gives the nodes which will not interfere in node v's transmission. Now, all the nodes in G which belong to IG and have not been scheduled already, can transmit simultaneously with node v, as shown in lines [11][12][13][14][15][16]. Once the transmission is done, farthest node from v is chosen which is to be scheduled in the next time slot (line 17).…”

Section: Scheduling Of Nodesmentioning

confidence: 99%

See 1 more Smart Citation

On minimizing the system information age in vehicular ad-hoc networks via efficient scheduling and piggybacking

2015

View full text Add to dashboard Cite

Recent advances in vehicular networks have enforced researchers to focus on various information dissemination techniques. Exchanging information among the vehicles is imperative due to the ever-changing network topology in vehicular networks. However, random transmitter selection in traditional CSMA based channel access mechanism limits the delay performance. Data, such as state information, is often time critical, and hence, efficient information dissemination techniques to improve delay performance are essential. In this work, we aim to minimize the average system age which is the mean number of time slots old a vehicle's information is at all other vehicles in the network. To achieve this, we explore the benefits of simultaneous transmission along with piggybacking of information for multi-hop communication. While allowing simultaneous transmission guarantees faster dissemination of information, piggybacking facilitates dissemination of more information per transmission, thereby keeping the network more updated. We have also analysed the relationship between piggybacked information and number of vehicles in the network. Simulation results show improvement in network performance. Our analytical results are in good agreement with the simulation results.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Scheduling Of Nodesmentioning

confidence: 99%

On minimizing the system information age in vehicular ad-hoc networks via efficient scheduling and piggybacking

2015

View full text Add to dashboard Cite

show abstract

“…Dissemination techniques required for one application may not be useful in another. To address this problem, an event-independent data dissemination scheme is presented in [29]. The proposed scheme calculates encounter probability (EP) to find out whether or not a vehicle is expected to encounter an event.…”

Section: E Adaptive and Context Aware Routing Protocolsmentioning

confidence: 99%

Routing mechanisms and cross-layer design for Vehicular Ad Hoc Networks: A survey

Trivedi

Veeraraghavan

Loke

et al. 2011

2011 IEEE Symposium on Computers &Amp; Informatics

View full text Add to dashboard Cite

Vehicular Ad-Hoc Network (VANET) will pave the way to advance automotive safety and occupant convenience. The potential VANET applications present diverse requirements. VANET shows unique characteristics and presents a set of challenges. The proposed VANET applications demand reliable and proficient message dissemination techniques. Routing techniques proposed for Mobile Ad-Hoc Network (MANET) do not cater for the characteristics of VANET. The need for novel routing techniques, exclusively designed for VANET has been recognised. This paper analyses different routing techniques proposed specifically for VANET. Unique characteristics of VANET pose challenges to traditional layered architecture where different layers make independent decisions. Mobility, absence of global view of network, random changes in topology, poor link quality and varied channel conditions have encouraged the paradigm shift to crosslayer approach. In order to optimise the performance of VANET, architectures based on cross-layer approach have been proposed by the researchers. The paper also surveys such cross-layer paradigm based solutions for VANET and concludes with an analytical summary.

show abstract

“…The implementation of the model has been realized by extending a VESPA [2], [5], [6] platform, an application which consists in sending and receiving two types of events: parking place and working area, only one event being received at the same time.…”

Section: F Data Fusion: Giving An Overview Of the Situation To The Dmentioning

confidence: 99%

Towards a robust exchange of imperfect information in inter-vehicle ad-hoc networks using belief functions

Farah

Mercier

Lefèvre

et al. 2011

2011 IEEE Intelligent Vehicles Symposium (IV)

View full text Add to dashboard Cite

This paper introduces a system for exchanging and managing imperfect information about events in vehicular networks (VANET). Using belief functions, this model is developed through an application using smartphones. I. INTRODUCTIONIn a world where vehicles are getting more and more predominant, safety issues are a major concern for public authorities and manufacturers. On the other hand, the integration of technology within the vehicles is skyrocketing. From break assistance to traffic information, the inter-vehicle communication becomes affordable.The ad-hoc networks are able to get organized without infrastructure. Instead of communicating via a central access point, the ad-hoc networks are formed of wireless nodes communicating to exchange information. In mobility context, the ad-hoc networks are called Mobile Ad-Hoc NetworksMANET) [4]. Introduced by Hong [13] and Royer [19], a comparison between different algorithms is presented by Boukerche [1]. Vehicular Ad-Hoc Networks (VANET) are branch of MANET applied to Inter-Vehicle Communication (IVC)where nodes are highly dynamic. Two modes of communication are known in IVC: Vehicle to Infrastructure (V2I) and Vehicle to Vehicle (V2V). The present work concerns V2V communication where information are decentralized and vehicles build their own information assembly.Many projects have been developed to make inter-vehicle communication theory possible in real life. In relation to network protocols, FleetNet (2000network protocols, FleetNet ( -2003 [11], [12] and CarTalk (2001-2004) [16], [18] projects use geographical positions for inter-vehicle communication, CarTalk project using no existing infrastructure. Focusing on data dissemination, TrafficView [17] is a road data dissemination system using V2V communication. It allows continuous exchange between vehicles of position and speed information, to inform drivers about road situation (traffic, weather, quickest way, . . .). Concerning data management, Mobi-Dik [27], [28] project has the objective to build a low-bandwidth MANET database which self-manages. It consists on sort resources, choose and store only the most relevant information, and reduce propagation of information to a limited spatial zone and limited time interval.In inter-vehicle networks, VESPA (Vehicular Event Sharing with a mobile P2P Architecture) [2], [5], [6] is a system

show abstract

Dissemination of information in inter-vehicle ad hoc networks

Cited by 22 publications

References 9 publications

On minimizing the system information age in vehicular ad-hoc networks via efficient scheduling and piggybacking

On minimizing the system information age in vehicular ad-hoc networks via efficient scheduling and piggybacking

Routing mechanisms and cross-layer design for Vehicular Ad Hoc Networks: A survey

Towards a robust exchange of imperfect information in inter-vehicle ad-hoc networks using belief functions

Contact Info

Product

Resources

About