On calculating connected dominating set for efficient routing in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Message-optimal connected dominating sets in mobile ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Virtual backbones in wireless ad hoc networks
Virtual backbones in wireless ad hoc networks
Distributed construction of connected dominating set in wireless ad hoc networks
Mobile Networks and Applications - Discrete algorithms and methods for mobile computing and communications
Localized Protocols for Ad Hoc Clustering and Backbone Formation: A Performance Comparison
IEEE Transactions on Parallel and Distributed Systems
CEDAR: a core-extraction distributed ad hoc routing algorithm
IEEE Journal on Selected Areas in Communications
Mobile Networks and Applications
| Hi-index | 0.00 |
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 VANET’s 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.