Enhanced CBL clustering performance versus GRP, OLSR and AODV in vehicular Ad Hoc networks

Wahl, Martine; Sondi, Patrick; Rivoirard, Lucas

doi:10.1007/s11235-020-00734-1

Cited by 4 publications

(5 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Conversely, a median value higher than the mean value means that the lower values in the distribution influence it. As previously shown [14], CBL-OLSR produces less routing traffic than TFD-OLSR, even when restricted to a single traffic direction (Figure 5). Such traffic is mainly induced by HELLO and TC messages.…”

Section: Evolution Of Simulation Results With the Number Of Hopssupporting

confidence: 71%

“…In these, no node can be part of two clusters at the same time. Precisely, chain-branch-leaf [14] is a clustering scheme designed for VANETs, which specifies the roles the CBL nodes can endorse in order to create a virtual communication infrastructure. Each cluster member (leaf node) elects its cluster head (branch node), and the latter serves as the gateway nodes to connect the clusters.…”

Section: Related Workmentioning

confidence: 99%

“…The resulting structure of CBL connects each cluster in a linear way, forming what is called a "chain". Simulations have shown that managing vehicle-to-vehicle communications with CBL results in stable clusters and chains in medium-and high-density highway scenarios [14]. Its functioning only depends on the periodic sharing of node state through HELLO messages, which encouraged the authors to implement it into the OLSR protocol (CBL-OLSR).…”

Section: Related Workmentioning

confidence: 99%

“…Its functioning only depends on the periodic sharing of node state through HELLO messages, which encouraged the authors to implement it into the OLSR protocol (CBL-OLSR). Previous simulations comparing its performance to that of other popular protocols in the literature, namely, OLSR, ad hoc on-demand distance vector (AODV) [19] and the geographic routing protocol (GRP) [20], showed its superiority in terms of end-to-end packet delay and routing traffic overhead [14]. However, the evaluations did not consider the case where a mesh-like clustering scheme such as MPR would operate only using road traffic direction.…”

Section: Related Workmentioning

confidence: 99%

“…Recent evaluations [14] showed that CBL-a backbone-like clustering scheme-outperforms most ad hoc routing protocols from the different approaches, namely, a reactive one such as the ad hoc on-demand distance vector (AODV) protocol, a proactive one such as the optimized link state routing (OLSR) [15] protocol, and a geographic one such as the geographic routing protocol (GRP). In addition to considerably reducing routing traffic overhead, the results showed that CBL achieves the lowest latency.…”

mentioning

confidence: 99%

See 4 more Smart Citations

A Comparison of Backbone and Mesh Clustering Strategies for Collaborative Management of 6G Vehicle-to-Vehicle Exchanges

Devred,

Wahl,

Sondi

2024

Electronics

Self Cite

View full text Add to dashboard Cite

Sixth-generation (6G) announcements promise the best performance not only for latency but also for the number of connected objects. These characteristics particularly suit intelligent transport system (ITS) applications involving a large number of moving vehicles with stringent latency constraints. Moreover, in the 6G era, these applications will often operate while relying on direct cooperation and exchanges between vehicles, in addition to centralized services through a telecommunication infrastructure. Therefore, addressing collaborative intelligence for ad hoc routing protocols that ensure efficient management of multihop vehicle-to-vehicle communications is mandatory. Among the numerous organization models proposed in the literature, the chain–branch–leaf (CBL), a virtual backbone-like model, has demonstrated best performance regarding latency against the state-of-the-art approaches. However, its structure, which lacks redundancy, may lead to higher data loss in the case of the failure of one of the relaying branch nodes. This study investigated how the multipoint relay (MPR) technique—which is intrinsically redundant—used in the optimized link state routing (OLSR) protocol can be efficiently adapted to the road traffic context, especially by restricting MPR selection to a single traffic flow direction (TFD-OLSR). The simulation results confirmed that CBL-OLSR obtains the least end-to-end delay for various types of application traffic due to its efficient reduction in the number of relays and the amount of routing traffic. However, despite higher routing traffic, TFD-OLSR improves the delivery rate, especially for more than two-hop communications, thus demonstrating the benefits of its redundancy property.

show abstract

Section: Evolution Of Simulation Results With the Number Of Hopssupporting

confidence: 71%

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

mentioning

confidence: 99%

See 3 more Smart Citations

A Comparison of Backbone and Mesh Clustering Strategies for Collaborative Management of 6G Vehicle-to-Vehicle Exchanges

Devred,

Wahl,

Sondi

2024

Electronics

Self Cite

View full text Add to dashboard Cite

show abstract

A V2V charging allocation protocol for electric vehicles in VANET

Abualola

Otrok

Mizouni

et al. 2022

Vehicular Communications

View full text Add to dashboard Cite

Effect of NTT on Performance of AODV in a Linear AD HOC Network

Sharma

Singh²,

Srivastava³

2022

ijngc

View full text Add to dashboard Cite

Wireless Ad Hoc Networks (WANETs) are predicted to be prevalent networks in coming future because of their infrastructure-less characteristics that result in self-organization, self-healing, and self-configuration of such networks. Routing means the process of selecting a path along which data can be transferred from source to destination that plays a significant role in the performance of ad hoc networks. There are many routing protocols developed for wireless ad hoc networks. One of such protocols, developed by C. E. Perkins, is Ad Hoc On-demand Distance Vector (AODV) routing protocol, which is a reactive routing protocol, AODV is used to establish route(s) between source node(s) and destination node(s) as and when routes are required. Performance of AODV routing protocol depends heavily on choice of values of a set of predefined attributes. One of such attributes of AODV is Node Traversal Time (NTT) which is supposed to play significant role in establishing route(s) between source node(s) and destination node(s). In this paper, we have investigated the performance of AODV in a linear wireless ad hoc network using different values of NTT using as well as without using Hello messages. The performance of the network has been measured using several metrics like Route Error Overhead, Routing Overhead, Normalized Routing Load, Average Hop Count, Total Number of Received Data Packets, Packet Delivery Ratio, Average End-to-End Delay and Throughput. It is observed that choice of value of NTT has a significant effect on establishment of route(s) between source node(s) and destination node(s) that eventually affects the performance of the linear wireless ad hoc network under consideration. The insights gained through this work could be useful in analysis of more realistic and complex networks.

show abstract

Enhanced CBL clustering performance versus GRP, OLSR and AODV in vehicular Ad Hoc networks

Cited by 4 publications

References 24 publications

A Comparison of Backbone and Mesh Clustering Strategies for Collaborative Management of 6G Vehicle-to-Vehicle Exchanges

A Comparison of Backbone and Mesh Clustering Strategies for Collaborative Management of 6G Vehicle-to-Vehicle Exchanges

A V2V charging allocation protocol for electric vehicles in VANET

Effect of NTT on Performance of AODV in a Linear AD HOC Network

Contact Info

Product

Resources

About