{'fraction_non_alphanumeric': 0.02419882275997384, 'fraction_numerical': 0.0006540222367560497, 'mean_word_length': 5.401673640167364, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Simulation-Based Performance Comparison of VANETs Backbone Formation Algorithms

Mobile ad hoc networks (MANETs) are gaining increased interest as the technology that potentially will make the nowadays illusion of mobile computing a tangible reality. vehicular ad-hoc networks (VANETs) are the special kind of MANETs that aims at providing communications among vehicles on the roads. The connected dominating set (CDS), a.k.a. virtual backbone or spine, has been proposed to facilitate routing, broadcasting, and establishing a dynamic infrastructure for distributed location databases in VANETs. Minimizing the CDS cardinality simplifies the VANETpsilas abstracted topology and allows for using shorter routes. Since, it is NP-complete to find the minimum size CDS (MCDS), approximation algorithms and heuristics are used to tackle this problem. It has been reported that localized CDS creation algorithms run fast and generate light signaling overhead. Some theoretical performance analysis of these algorithms is presented in the literature; however, this analysis has not been validated across any physical or at least simulation-based measures. Moreover, the cost of maintaining the CDS in the presence of topology changes is an important cost that is overlooked most of the time. In this paper, a simulation-based comparison between the performance of these algorithms is conducted using the ns2 network simulator. Moreover, the effect of mobility rate and network size on the performance of each algorithm is investigated.