Adaptive Topology Based Gossiping in VANETs Using Position Information

Bako, Boto; Rikanovic, Igor; Kargl, Frank; Schoch, Elmar

doi:10.1007/978-3-540-77024-4_8

Cited by 11 publications

(17 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…If a given node misses any broadcast packet, it will explicitly request one of its parents to retransmit the missing packet. This scheme presents several shortcomings that prevents its application to mobile networks [11]: (1) The reception percentage between two nodes is based on the quality of the link, however, in mobile networks mobility is the main reason for broken links. (2) The hierarchy is established in a static way and no renewal of neighborhood information is considered.…”

Section: Adaptive Non-counter-based Schemesmentioning

confidence: 99%

“…(2) The hierarchy is established in a static way and no renewal of neighborhood information is considered. Moreover, it is demonstrated in [11] that smart gossip fails when more than one source node is considered.…”

Section: Adaptive Non-counter-based Schemesmentioning

confidence: 99%

“…In PbG [11], the authors applied the aforementioned dependencies among nodes [60] to VANETs. They considered positioning data to calculate the relationships among nodes.…”

Section: Adaptive Non-counter-based Schemesmentioning

confidence: 99%

See 2 more Smart Citations

A survey on probabilistic broadcast schemes for wireless ad hoc networks

et al. 2015

View full text Add to dashboard Cite

a b s t r a c tBroadcast or flooding is a dissemination technique of paramount importance in wireless ad hoc networks. The broadcast scheme is widely used within routing protocols by a wide range of wireless ad hoc networks such as mobile ad hoc networks, vehicular ad hoc networks, and wireless sensor networks, and used to spread emergency messages in critical scenarios after a disaster scenario and/or an accidents. As the type broadcast scheme used plays an important role in the performance of the network, it has to be selected carefully. Though several types of broadcast schemes have been proposed, probabilistic broadcast schemes have been demonstrated to be suitable schemes for wireless ad hoc networks due to a range of benefits offered by them such as low overhead, balanced energy consumption, and robustness against failures and mobility of nodes. In the last decade, many probabilistic broadcast schemes have been proposed by researchers. In addition to reviewing the main features of the probabilistic schemes found in the literature, we also present a classification of the probabilistic schemes, an exhaustive review of the evaluation methodology including their performance metrics, types of network simulators, their comparisons, and present some examples of real implementations, in this paper.

show abstract

Section: Adaptive Non-counter-based Schemesmentioning

confidence: 99%

Section: Adaptive Non-counter-based Schemesmentioning

confidence: 99%

See 1 more Smart Citation

A survey on probabilistic broadcast schemes for wireless ad hoc networks

et al. 2015

View full text Add to dashboard Cite

show abstract

“…To ensure building up a stable directed graph, the authors make the assumption that there is only one message originator in the whole network. This assumption may be sufficient in a few scenarios, but especially in the case of VANETs this is not applicable, and therefore, as shown in (Bako et al, 2008a;Bako et al, 2007) the performance of the protocol degrades massively in such environments.…”

Section: Hybrid Broadcast Approachesmentioning

confidence: 99%

“…To overcome these problems, a novel hybrid probabilistic broadcast was introduced by (Bako et al, 2007). In this so called Position based Gossip (PbG) 1-hop neighborhood information are used together with position information of neighboring vehicles to build a local, directed dependency graph.…”

Section: Hybrid Broadcast Approachesmentioning

confidence: 99%

Efficient Information Dissemination in VANETs

Bako¹,

Weber²

2011

Advances in Vehicular Networking Technologies

Self Cite

View full text Add to dashboard Cite

IntroductionVehicular ad-hoc networks (VANETs) enable promising new possibilities to enhance traffic safety and efficiency. The vision of VANETs is that vehicles communicate spontaneously, in an ad-hoc manner over a wireless medium. Based on this inter-vehicle communication (IVC), vehicles exchange important information, e.g., about road conditions and hazardous situations. Moreover, such information can be propagated via multiple hops, thus making the dissemination of important information possible over longer distances. This is the key advantage of this kind of safety applications compared to conventional safety systems. Whereas conventional safety systems only rely on information sensed in the direct neighborhood by onboard sensors of a vehicle, active safety applications based on IVC can utilize information generated by nodes multiple hops away. Moreover, such information can be enriched on the way with information sensed by relaying cars. This greatly enhances the potential of VANET applications. The advantage is twofold:• Having information about distant hazardous situations like an accident ahead or icy road, the driver can be warned in-time, thus being able to completely avoid the dangerous situation.• Aggregating information from multiple cars enables retaining information on a higher semantic level. This way, applications like cooperative traffic jam warning and cooperative parking place detection can be realized.The enabling technology for such applications is the wireless ad-hoc communication between vehicles. Especially the dissemination of messages in a specific geographic region represents a fundamental service in VANETs to which we refer to as geographic broadcast (GeoCast). This communication paradigm is used by many applications to enhance traffic safety and efficiency but it can also serve as a basic mechanism for other routing protocols. Because of its relevance in the domain of vehicular networks, it is of key importance that the communication protocol enables efficient message dissemination. The realization of a robust and efficient broadcast mechanism is a challenging task due to the wide range of applications envisioned to build upon this communication technology, the rigorous requirements of safety applications, and the special network characteristics of vehicular networks. Therefore, the main focus of this chapter is the efficient broadcast of information for VANET applications. We want to give a broad and in-depth review of recent research in this topic and present simulation results of efficient dissemination protocols designed for such applications. This chapter is organized as follows: In Section 2 we discuss briefly different types of VANET applications, followed by an overview of different communication mechanisms Efficient Information Dissemination in VANETs 3www.intechopen.com

show abstract

Advanced Adaptive Gossiping Using 2-Hop Neighborhood Information

Bako

Kargl

Schoch

et al. 2008

IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference

Self Cite

View full text Add to dashboard Cite

Efficient information dissemination is one of the challenging tasks in most ad-hoc network application domains, be it in wireless sensor networks, mobile ad-hoc networks, or vehicular ad-hoc networks. It is obvious, that flooding has a high communication overhead, leading to channel congestion and packet collisions. Therefore, more efficient dissemination mechanisms were investigated and proposed by the research community.One class of such algorithms is gossiping, where each node forwards a message with a certain probability. The main challenge in gossiping is the proper determination of the forwarding probability, i.e., on the one hand this value has to be chosen high enough to assure a high delivery ratio, on the other hand it has to be as low as possible to reduce communication overhead. At the same time this probability has to be adapted to dynamic network conditions, like changing node density.In this work an advanced scheme for adaptive gossiping is proposed, capable to adjust the dissemination probability dynamically and in a distributed manner. The gossiping probability is determined at a node for every message that has to be forwarded based on two hop neighborhood information. That way, the proposed protocol is capable of working in arbitrary network topologies and densities, enabling more efficient data dissemination compared to existing approaches.

show abstract

Adaptive Topology Based Gossiping in VANETs Using Position Information

Cited by 11 publications

References 8 publications

A survey on probabilistic broadcast schemes for wireless ad hoc networks

A survey on probabilistic broadcast schemes for wireless ad hoc networks

Efficient Information Dissemination in VANETs

Advanced Adaptive Gossiping Using 2-Hop Neighborhood Information

Contact Info

Product

Resources

About