Minimum connected dominating set based RSU allocation for smartCloud vehicles in VANET

Chinnasamy, A.; Sivakumar, B.; Selvakumari, P.; Suresh, A.

doi:10.1007/s10586-018-1760-8

Cited by 48 publications

(15 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…e impact mechanism of financial evolution on technological revolution: on the one hand, some scholars believe that financial evolution may encourage SMEs to achieve technological revolution by opening trade or reducing transaction costs, easing financing constraints of SMEs, and loosening R&D capital investment [14]. On the other hand, some scholars believe that the attribute of technological revolution projects, such as high investment and long cycle, make small-and medium-sized innovative enterprises have a strong dependence on external financing.…”

Section: Methodsmentioning

confidence: 99%

Research on the Impact Mechanism and Application of Financial Digitization and Optimization on Small- and Medium-Sized Enterprises

2021

Scientific Programming

View full text Add to dashboard Cite

Background. With the continuous advancement of digital technology and the accelerated development of digital finance, the rise of digital finance has had a vital impact on the true evolution of SMEs. The digital economy has a significant positive impact on the productivity of SMEs. Method. This article first analyzes the digital level of SMEs, studies the incentive effect of digital finance on the level of technological revolution of SMEs, and analyzes the mitigation effect of digital finance evolution on the financing constraints of SMEs. At the same time, it also studies how to develop the digital economy and achieve high-quality business evolution. Result. The digital economy can promote the growth of enterprise productivity through four indirect ways: scale economy effect, scope economy effect, technological revolution effect, and management benefit effect. Conclusion. The Financial Technology Optimization program helps financial leaders adopt new digital technologies to optimize financial processes while minimizing disruption.

show abstract

Section: Methodsmentioning

confidence: 99%

Research on the Impact Mechanism and Application of Financial Digitization and Optimization on Small- and Medium-Sized Enterprises

2021

Scientific Programming

View full text Add to dashboard Cite

show abstract

“…Moreover, the CDS algorithm is a typical information dissemination technique and is suitable for various VANET applications, such as emergency notifications and traffic safety. Moreover, a virtual core network can be constructed by 37 Medium Medium High Medium High DWCM 38 High Medium Medium Low High SCRP 39 Medium High High Medium Medium smartCloud 42 High Medium High Medium High CoD 40 Medium High High Low High QoS-VANET 41 Medium Medium Medium Low High HCAR 24 Low Medium Medium Medium Medium searching for a CDS in the network graph. Therefore, clustering using a CDS-based virtual core network can significantly improve VANET performance.…”

Section: Heuristic Clustering Algorithmsmentioning

confidence: 99%

“…In Chinnasamy et al, 42 the authors proposed a new Minimum connected dominating set-based RSU allocation for smartCloud vehicles in VANET. Each smartCloud vehicle sends periodic beacon packet (Coordinates) to nearest RSU.…”

Section: Heuristic Clustering Algorithmsmentioning

confidence: 99%

Survey on vehicular ad hoc networks clustering algorithms: Overview, taxonomy, challenges, and open research issues

Senouci

Harous

Aliouat

2020

Int J Communication

View full text Add to dashboard Cite

Summary Vehicular ad hoc networks (VANETs) have recently attracted considerable attention owing to their wide range of applications. However, there are several challenges, such as mobility, routing, scalability, quality of services, and security. Clustering is an important control mechanism in high‐mobility networks and has been verified to be a promising approach in VANETs as well, as it ensures a basic level of network performance. Accordingly, several clustering algorithms have been proposed for these networks, and different protocols typically focus on various performance metrics. In this study, we provide a thorough review of clustering algorithms in VANETs. First, we present background material regarding the clustering process. Secondly, we propose a new taxonomy that categorizes clustering algorithms in VANETs based on different design aspects and provides a description of the algorithms in each category. Thirdly, an analysis of the algorithms in each category is provided according to various comparison metrics. Fourthly, we highlight the main challenges for each category and discuss some open research issues. Finally, we provide a general comparison of different clustering algorithms according to selected key parameters. Thus, this study provides a more thorough understanding of VANET clustering algorithms and the research trends in this area.

show abstract

“…An important generalization of MDS is the MCDS problem, whose goal is to find a MDS that forms a connected subgraph in the given graph. An important application of MCDS problem is to generate a virtual backbone in wireless networks (Yu et al, 2013) such as mobile ad hoc networks (Al-Karaki & Kamal, 2008), wireless sensors networks (Misra & Mandal, 2009) and vehicular ad hoc networks (Chinnasamy et al, 2019). Specifically, MCDS problem plays a significant role in broadcast routing (Cheng et al, 2006;Ni et al, 1999;Wu & Dai, 2003), power managing (Chen et al, 2002;Deb et al, 2003) and fiber optical networks (Chen et al, 2010;Sen et al, 2008).…”

Section: Introductionmentioning

confidence: 99%

Efficient Local Search based on Dynamic Connectivity Maintenance for Minimum Connected Dominating Set

Zhang¹,

Li²,

Wang³

2021

jair

View full text Add to dashboard Cite

The minimum connected dominating set (MCDS) problem is an important extension of the minimum dominating set problem, with wide applications, especially in wireless networks. Most previous works focused on solving MCDS problem in graphs with relatively small size, mainly due to the complexity of maintaining connectivity. This paper explores techniques for solving MCDS problem in massive real-world graphs with wide practical importance. Firstly, we propose a local greedy construction method with reasoning rule called 1hopReason. Secondly and most importantly, a hybrid dynamic connectivity maintenance method (HDC+) is designed to switch alternately between a novel fast connectivity maintenance method based on spanning tree and its previous counterpart. Thirdly, we adopt a two-level vertex selection heuristic with a newly proposed scoring function called chronosafety to make the algorithm more considerate when selecting vertices. We design a new local search algorithm called FastCDS based on the three ideas. Experiments show that FastCDS significantly outperforms five state-of-the-art MCDS algorithms on both massive graphs and classic benchmarks.

show abstract

Minimum connected dominating set based RSU allocation for smartCloud vehicles in VANET

Cited by 48 publications

References 23 publications

Research on the Impact Mechanism and Application of Financial Digitization and Optimization on Small- and Medium-Sized Enterprises

Research on the Impact Mechanism and Application of Financial Digitization and Optimization on Small- and Medium-Sized Enterprises

Survey on vehicular ad hoc networks clustering algorithms: Overview, taxonomy, challenges, and open research issues

Efficient Local Search based on Dynamic Connectivity Maintenance for Minimum Connected Dominating Set

Contact Info

Product

Resources

About