Dynamic multiagent method to avoid duplicated information at intersections in VANETs

Vehicular ad hoc networks (VANETs) allow vehicles to contact one another to provide safety and comfort applications. However, mobility is a great challenge in VANETs. High vehicle speed causes topological changes that result in unstable networks. Therefore, most previous studies focused on using clustering techniques in roads to reduce the effect of vehicle mobility and enhance network stability. Vehicles stop moving at intersections, and their mobility does not impact clustering. However, none of previous studies discussed the impact of vehicle stopping at intersections on base stations (BSs). Vehicles that have stopped moving at intersections continue to send the same information to BSs, which causes duplicated information. Hence, this study proposes a new method named dynamic multiagent (DMA) to filter cluster information and prevent duplicated information from being sent to BSs at intersections. The performance of the proposed method was evaluated through simulations during the use of DMA and without-DMA (W-DMA) methods based on real data collected from 10 intersections in Batu Pahat City, Johor, Malaysia. Overall, the proposed DMA method results in a considerable reduction in duplicated information at intersections, with an average percentage of 81% from the W-DMA method

Clustering Based Affinity Propagation In Vanets : Taxonomy And Opportunity Of Research

Vehicular communication networks received good consideration and focusing on diverse researchers in the latest years. Vehicular Adhoc Networks (VANETs) represents a developed type of an effective communication technology to facilitate the process of information dissemination among vehicles. VANETs established the cornerstone to develop the Intelligent Transport Systems (ITS). The great challenging task in routing the messages in VANETs is related to the different velocities of the moving vehicles on the streets in addition to their sparse distribution. Clustering approach is broadly used to report this challenge. It represents the mechanism of the alliance the vehicles based on certain metrics such as velocity, location, density, direction and lane position. This paper is to investigate and analyze several challenges and their present solutions which based on different developed clustering approaches based on the affinity propagation algorithm. This paper isaim to present a complete taxonomy on vehicles clustering and analyzing the existing submitted proposals in literature based on affinity propagation. Presenting and analyzing the submitted proposals will provide these domain researchers with a good flexibility to select or apply the suitable approach to their future application or research activities. To prepare this paper in a systematic manner, a total of 1444 articles concerning the Affinity Propagation in clustering published in the era of 2008 to 2019 were collected from the reliable publishing sources namely (ScienceDirect, IEEE Xplore, and SCOPUS). Due to their relevance, applicability, generality level and comprehensiveness, only nineteen articles among the collected articles were assigned and eventually analyzed in a systematic review method.A considerable success has been achieved in revealing the essential challenges and necessities for clustering based affinity Propagation in VANETs to guide the researchers in their upcoming investigations. This paper also contributes in dealing with open problems issues, challenges and guidelines for the upcoming investigations

VANET–LTE based heterogeneous vehicular clustering for driving assistance and route planning applications

The Internet of vehicles incorporates multiple access networks and technologies to connect vehicles on roads. These vehicles usually require the use of individual long-term evolution (LTE) connections to send/receive data to/from a remote server to make smart decisions regarding route planning and driving. An increasing number of vehicles on the roads may not only overwhelm LTE network usage but also incur added cost. Clustering helps minimize LTE usage, but the high speed of vehicles renders connections unstable and unreliable not only among vehicles but also between vehicles and the LTE network. Moreover, non-cooperative behavior among vehicles within a cluster is a bottleneck in sharing costly data acquired from the Internet. To address these issues, we propose a novel destination- and interest-aware clustering (DIAC) mechanism. DIAC primarily incorporates a strategic game-theoretic algorithm and a self-location calculation algorithm. The former allows vehicles to participate/cooperate and enforces a fair-use policy among the cluster members (CMs), whereas the latter enables CMs to calculate their location coordinates in the absence of a global positioning system under an urban topography. DIAC strives to reduce the frequency of link failures not only among vehicles but also between each vehicle and the 3G/LTE network. The mechanism also considers vehicle mobility and LTE link quality and exploits common interests among vehicles in the cluster formation phase. The performance of the DIAC mechanism is validated through extensive simulations, whose results demonstrate that the performance of the proposed mechanism is superior to that of similar and existing approaches

VANET–LTE based heterogeneous vehicular clustering for driving assistance and route planning applications

The Internet of vehicles incorporates multiple access networks and technologies to connect vehicles on roads. These vehicles usually require the use of individual long-term evolution (LTE) connections to send/receive data to/from a remote server to make smart decisions regarding route planning and driving. An increasing number of vehicles on the roads may not only overwhelm LTE network usage but also incur added cost. Clustering helps minimize LTE usage, but the high speed of vehicles renders connections unstable and unreliable not only among vehicles but also between vehicles and the LTE network. Moreover, non-cooperative behavior among vehicles within a cluster is a bottleneck in sharing costly data acquired from the Internet. To address these issues, we propose a novel destination- and interest-aware clustering (DIAC) mechanism. DIAC primarily incorporates a strategic game-theoretic algorithm and a self-location calculation algorithm. The former allows vehicles to participate/cooperate and enforces a fair-use policy among the cluster members (CMs), whereas the latter enables CMs to calculate their location coordinates in the absence of a global positioning system under an urban topography. DIAC strives to reduce the frequency of link failures not only among vehicles but also between each vehicle and the 3G/LTE network. The mechanism also considers vehicle mobility and LTE link quality and exploits common interests among vehicles in the cluster formation phase. The performance of the DIAC mechanism is validated through extensive simulations, whose results demonstrate that the performance of the proposed mechanism is superior to that of similar and existing approaches. © 2018 Elsevier B.V

Clustering and 5G-enabled smart cities: a survey of clustering schemes in VANETs

This chapter highlights the importance of Vehicular Ad-hoc Networks (VANETs) in the context of the 5Genabled smarter cities and roads, a topic that attracts significant interest. In order for VANETs and its associated applications to become a reality, a very promising avenue is to bring together multiple wireless technologies in the architectural design. 5G is envisioned to have a heterogeneous network architecture. Clustering is employed in designing optimal VANET architectures that successfully use different technologies, therefore clustering has the potential to play an important role in the 5G-VANET enabled solutions. This chapter presents a survey of clustering approaches in the VANET research area. The survey provides a general classification of the clustering algorithms, presents some of the most advanced and latest algorithms in VANETs, and it is among the fewest works in the literature that reviews the performance assessment of clustering algorithms

Stable dynamic feedback-based predictive clustering protocol for vehicular ad hoc networks

Scalability presents a significant challenge in vehicular communication, particularly when there is no hierarchical structure in place to manage the increasing number of vehicles. As the number of vehicles increases, they may encounter the broadcast storm problem, which can cause network congestion and reduce communication efficiency. Clustering can solve these issues, but due to high vehicle mobility, clustering in vehicular ad hoc networks (VANET) suffers from stability issues. Existing clustering algorithms are optimized for either cluster head or member, and for highways or intersections. The lack of intelligent use of mobility parameters like velocity, acceleration, direction, position, distance, degree of vehicles, and movement at intersections, also contributes to cluster stability problems. A dynamic clustering algorithm that efficiently utilizes all mobility parameters can resolve these issues in VANETs. To provide higher stability in VANET clustering, a novel robust and dynamic mobility-based clustering algorithm called junction-based clustering protocol for VANET (JCV) is proposed in this dissertation. Unlike previous studies, JCV takes into account position, distance, movement at the junction, degree of a vehicle, and time spent on the road to select the cluster head (CH). JCV considers transmission range, the moving direction of the vehicle at the next junction, and vehicle density in the creation of a cluster. JCV's performance is compared with two existing VANET clustering protocols in terms of the average cluster head duration, the average cluster member (CM) duration, the average number of cluster head changes, and the percentage of vehicles participating in the clustering process, etc. To evaluate the performance of JCV, we developed a new cloud-based VANET simulator (CVANETSIM). The simulation results show that JCV outperforms the existing algorithms and achieves better stability in terms of the average CH duration (4%), the average CM duration (8%), the number of CM (6%), the ratio of CM (22%), the average CH change rate (14%), the number of CH (10%), the number of non-cluster vehicles (7%), and clustering overhead (35%). The dissertation also introduced a stable dynamic feedback-based predictive clustering (SDPC) protocol for VANET, which ensures cluster stability in both highway and intersection scenarios, irrespective of the road topology. SDPC considers vehicle relative velocity, acceleration, position, distance, transmission range, moving direction at the intersection, and vehicle density to create a cluster. The cluster head is selected based on the future construction of the road, considering relative distance, movement at the intersection, degree of vehicles, majority-vehicle, and probable cluster head duration. The performance of SDPC is compared with four existing VANET clustering algorithms in various road topologies, in terms of the average cluster head change rate, duration of the cluster head, duration of the cluster member, and the clustering overhead. The simulation results show that SDPC outperforms existing algorithms, achieving better clustering stability in terms of the average CH change rate (50%), the average CH duration (15%), the average CM duration (6%), and the clustering overhead (35%)