Author
Peng Fan
Bio: Peng Fan is an academic researcher from University of Illinois at Chicago. The author has contributed to research in topics: Vehicular ad hoc network & Cluster analysis. The author has an hindex of 5, co-authored 7 publications receiving 184 citations.
Papers
More filters
••
06 Oct 2005TL;DR: In this paper, the effect of weighting two well-known clustering methods with the vehicle-specific position and velocity clustering logic to improve cluster stability over the simulation time is analyzed.
Abstract: The application of Mobile Ad Hoc Network (MANET) technologies in the service of Intelligent Transportation Systems (ITS) has brought new challenges in maintaining communication clusters of network members for long time durations. Stable clustering methods reduce the overhead of communication relay in MANETs and provide for a more efficient hierarchical network topology. During creation of VANET clusters, each vehicle chooses a head vehicle to follow. The average number of cluster head changes per vehicle measures cluster stability in these simulations during the simulation. In this paper we analyze the effect of weighting two well-known clustering methods with the vehicle-specific position and velocity clustering logic to improve cluster stability over the simulation time.
86 citations
••
13 Feb 2006TL;DR: A realistic micro- simulation model is proposed with the hope of contributing to clustering research in VANETs, and how clustering algorithms work on it is demonstrated.
Abstract: Inter-vehicle communication by means of wireless Ad Hoc networking has the potential to improve traffic safety and comfort tremendously. Therefore, the application of Vehicular Ad Hoc Networks (VANETs) in the service of Intelligent Transportation Systems (ITS) has been highly focused in recent years. Derived from the successful outcome of a cluster-based framework in Mobile Ad Hoc Networks (MANETs), we apply this network topology to VANETs. Unfortunately, previous studies lack realistic modeling of vehicle mobility and evaluation of clustering performance so they may not correlate well with performance in a real deployment. Hence, in this paper, we propose a realistic micro- simulation model with the hope of contributing to clustering research in VANETs, and demonstrate how clustering algorithms work on it.
37 citations
••
15 Sep 2008TL;DR: A distributed DIrectional Stability-based Clustering Algorithm (DISCA) designed for VANETs is analyzed, which takes direction, mobility features, and leadership duration into consideration and shows that the overhead incurred by DISCA is bound by a constant per node per time step, avoiding expensive reclustering chain reactions.
Abstract: Clustering has the potential to reduce redundant messaging in MANETs and provide an efficient hierarchical network structure. However, it takes time to form and maintain a cluster structure which also requires additional control overhead. In this paper, we aim to analyze a distributed DIrectional Stability-based Clustering Algorithm (DISCA) designed for VANETs, which takes direction, mobility features, and leadership duration into consideration. We provide insights on the theoretical analysis of DISCA and show that the overhead incurred by DISCA is bound by a constant per node per time step, avoiding expensive reclustering chain reactions.
34 citations
01 Jan 2007
TL;DR: A new distributed algorithm which takes into consideration the moving direction of vehicles and leadership duration of cluster heads is proposed, which significantly improves cluster stability under such circumstances.
Abstract: The application of Mobile Ad Hoc Network (MANET) technologies to Vehicular Ad Hoc Networks (VANETs) in the service of Intelligent Transportation Systems (ITS) has brought new challenges in maintaining communication clusters of network members for long time durations. Stable clustering methods reduce the overhead of communication relay in MANETs and provide a more efficient hierarchical network topology. During the creation of clusters, one vehicle node per cluster is selected as the cluster head to act as the routing node. In this paper, we propose a new distributed algorithm which takes into consideration the moving direction of vehicles and leadership duration of cluster heads. A simulation study has been conducted in an innovative and realistic vehicular network model to determine which algorithm provides optimum stability over the simulation timeline. The results show that the proposed clustering logic significantly improves cluster stability under such circumstances.
15 citations
••
04 Aug 2006TL;DR: A Compound Utility Function (CUF) clustering algorithm which takes into consideration the degree, position, velocity and acceleration of a vehicle altogether is proposed, and the invocation of this algorithm is not periodic as in earlier research, but reactive on the dynamism of the nodes.
Abstract: The application of Mobile Ad Hoc Network (MANET) technologies in the service of Intelligent Transportation Systems (ITS) has brought new challenges in maintaining communication clusters of network members for long time durations. Stable clustering methods reduce the overhead of communication relay in MANETs and provide for a more efficient hierarchical network topology. During the creation of Vehicle Ad Hoc Network (VANET) clusters, one vehicle node per cluster is selected as the cluster head to act as the routing node. In this paper, we propose a Compound Utility Function (CUF) clustering algorithm which takes into consideration the degree, position, velocity and acceleration of a vehicle altogether, and the invocation of this algorithm is not periodic as in earlier research, but reactive on the dynamism of the nodes. In this paper experimentally compares CUF with Highest-Degree and Lowest-ID algorithm. The results show that CUF gives the best cluster stability.
12 citations
Cited by
More filters
••
TL;DR: This paper presents an extensive overview of VANET security characteristics and challenges as well as requirements, and gives the details of the recent security architectures and the well-known security standards protocols.
471 citations
••
TL;DR: This paper explores the design choices made in the development of clustering algorithms targeted at VANETs and presents a taxonomy of the techniques applied to solve the problems of cluster head election, cluster affiliation, and cluster management, and identifies new directions and recent trends in the design of these algorithms.
Abstract: A vehicular ad hoc network (VANET) is a mobile ad hoc network in which network nodes are vehicles—most commonly road vehicles. VANETs present a unique range of challenges and opportunities for routing protocols due to the semi-organized nature of vehicular movements subject to the constraints of road geometry and rules, and the obstacles which limit physical connectivity in urban environments. In particular, the problems of routing protocol reliability and scalability across large urban VANETs are currently the subject of intense research. Clustering can be used to improve routing scalability and reliability in VANETs, as it results in the distributed formation of hierarchical network structures by grouping vehicles together based on correlated spatial distribution and relative velocity. In addition to the benefits to routing, these groups can serve as the foundation for accident or congestion detection, information dissemination and entertainment applications. This paper explores the design choices made in the development of clustering algorithms targeted at VANETs. It presents a taxonomy of the techniques applied to solve the problems of cluster head election, cluster affiliation, and cluster management, and identifies new directions and recent trends in the design of these algorithms. Additionally, methodologies for validating clustering performance are reviewed, and a key shortcoming—the lack of realistic vehicular channel modeling—is identified. The importance of a rigorous and standardized performance evaluation regime utilizing realistic vehicular channel models is demonstrated.
379 citations
••
TL;DR: A new clustering technique suitable for the VANET environment on highways is introduced with the aim of enhancing the stability of the network topology and a new multi-metric algorithm for cluster-head elections is developed.
Abstract: Clustering in vehicular ad hoc networks (VANET) is one of the control schemes used to make VANET global topology less dynamic. Many of the VANET clustering algorithms are derived from mobile ad hoc networks (MANET). However, VANET nodes are characterized by their high mobility, and the existence of VANET nodes in the same geographic proximity does not mean that they exhibit the same mobility patterns. Therefore, VANET clustering schemes should take into consideration the degree of the speed difference among neighboring nodes to produce relatively stable clustering structure. In this paper, we introduce a new clustering technique suitable for the VANET environment on highways with the aim of enhancing the stability of the network topology. This technique takes the speed difference as a parameter to create relatively stable cluster structure. We also developed a new multi-metric algorithm for cluster-head elections. A simulation was conducted to evaluate our method and compare it with the most commonly used clustering methods. The simulation results show that our technique provides more stable cluster structure on the locale scale which results in a more stable network structure on the global scale. The proposed technique reduces the average number of clusters changed per vehicle by 34-46%, and increases the average cluster lifetime by 20-48% compared to the existing techniques.
216 citations
••
TL;DR: This work proposes a novel approach that introduces moving object modeling and indexing techniques from the theory of large moving object databases into the design of VANET routing protocols and demonstrates the superiority of this approach compared with both clustering and non-clustering based routing protocols.
Abstract: Vehicular Ad-hoc Networks (VANETs) are an emerging field, whereby vehicle-to-vehicle communications can enable many new applications such as safety and entertainment services. Most VANET applications are enabled by different routing protocols. The design of such routing protocols, however, is quite challenging due to the dynamic nature of nodes (vehicles) in VANETs. To exploit the unique characteristics of VANET nodes, we design a moving-zone based architecture in which vehicles collaborate with one another to form dynamic moving zones so as to facilitate information dissemination. We propose a novel approach that introduces moving object modeling and indexing techniques from the theory of large moving object databases into the design of VANET routing protocols. The results of extensive simulation studies carried out on real road maps demonstrate the superiority of our approach compared with both clustering and non-clustering based routing protocols.
193 citations
••
TL;DR: A complete taxonomy on clustering in VANETs has been provided based upon various parameters and a comprehensive analysis of all the existing proposals in literature with respect to number of parameters is provided.
171 citations