Using clustering for target tracking in vehicular ad hoc networks☆
Introduction
Vehicular Ad hoc Networks (VANETs) play an important role in Intelligent Transportation Systems (ITS) by providing critical information about roads and traffic condition, sending safety messages, and providing entertainment for passengers. In VANETs, vehicles can connect to each other for many purposes such as exchanging safety and infotainment messages. A special characteristic of VANET nodes, compared to nodes of other ad hoc networks such as MANETs, is the abundant on-board processing, storage and energy resources of the vehicles, which makes them a suitable platform for processing complex algorithms for a number of applications. Over the last few years, a number of research works have been conducted on VANETs, mainly focusing on routing techniques and data dissemination under various road and traffic conditions [3], [4], [5], localization of nodes [6], [7], location privacy protection [8], communication security [9], social networking and advertisement [10], [11].
While VANET is still in its infancy, a number of non-safety applications have been proposed in the literature. One of the envisioned applications is target tracking, where a target vehicle is located and tracked using on-board vehicle sensors such as cameras. Such applications may be used by police agencies to locate a specific vehicle with particular visual features such as license plate information, color, model, etc. Even though police agencies may use pre-installed security camera infrastructure across the city, the cost of installing cameras to cover all roads can be very high. In addition, there is the probability of losing the target in non-monitored areas, i.e., “blind spots”. However, most new models of vehicles are being equipped with front and rear cameras, proximity sensors, and on-board communication capabilities that can be used as enabling components for a distributed mobile tracking system. Another application of such system is passive monitoring to collect pictures or video footage of incidents that happened in areas where security camera systems are unavailable, using only the cameras of nearby vehicles.
One of the challenges in continuous monitoring systems in VANETs is bandwidth availability, which can be a limiting factor especially when there are multiple data sources in close proximity, and are streaming video data simultaneously [12], [13]. A traditional solution to control bandwidth usage in ad hoc networks is to segment the network into clusters and select one representative, i.e., a cluster head, for each cluster to act as a connection point to the cluster [14]. However in a highly dynamic environment such as VANETs, the selection of appropriate metrics for cluster head election and cluster membership can be a challenging problem as vehicles constantly enter and leave the clusters.
In previous work, we have proposed two cluster-based protocols for vehicle tracking in VANETs [1], [2]. Target tracking can be a simple task when the target vehicle has a Global Positioning System (GPS), with the location data communicated to external entities. However, we assume that GPS devices are not available or have been turned off on target vehicles. In order to solve this issue, we can rely on cluster formation around a target and visual identification of targets using the on-board cameras of neighboring vehicles and reporting the location and visual information of the target to a control center. The control center could be a police station or cruiser looking for a special vehicle based on its visual description. Therefore, in the absence of a proper data dissemination mechanism, every vehicle that detects the target will broadcast location information of the target towards the control center. In VANETs, nodes communicate with each other in a multi-hop fashion. Assuming the control center is located within a multi-hop distance from the target, there is a high probability of packet collision and packet loss due to concurrent transmission of location information by all the neighboring vehicles [15], [16] resulting in a significant drop in data delivery ratio. Also, the control center might receive duplicate messages which are unnecessary and redundant. This problem is due to the unavailability of a central aggregation node to collect, process and aggregate information from neighboring vehicles. Another concern in such a system is the data overload in the control center due to direct transmission of position information to the central entity by all vehicles that detected the same target. In order to address these problems, we proposed to use a clustering approach to coordinate data transmission from vehicles around the target. Therefore, neighboring vehicles that can detect the target join a cluster and select a cluster head (CH). The neighbor vehicles send their location information to the CH. The CH is responsible for aggregating the information and sending it to the control center. Therefore, instead of every node sending its information to the control center separately, only one node is responsible for delivering the information to the control center.
The challenges toward designing a high-performance and efficient clustering algorithm mostly include clustering stability and overhead. Due to high speed of vehicles in VANETs, the cluster topology changes frequently, which induces a high control overhead. Also, the CH role may change too quickly among eligible vehicles, which causes a high number of CH changes. Any change in the cluster topology requires the dissemination of control messages within the cluster to inform other cluster member vehicles about the change. The studies conducted in [17], [18] show the clustering overhead induced by constant broadcasting of control messages. Thus, it is critical to use appropriate cluster membership and CH selection rules in order to extend the lifetime of cluster members and cluster heads as much as possible. Control packets can congest the cluster if not managed properly. Therefore, reducing cluster control overhead is a necessary step toward an efficient clustering protocol. In this paper we demonstrate performance evaluation results of our proposed cluster-based target tracking algorithms in various scenarios. Also, a comparative study of our proposed protocols to an existing VANET clustering algorithms is provided to show the improved performance of both our proposed algorithms.
The rest of this paper is organized into six sections. Section 2 provides a literature review of VANET's features and applications, cluster-based techniques for VANET environment, and target tracking in these networks. In Section 3 we provide a brief review of our proposed cluster-based target tracking algorithms for VANETs, the definition of the functions and techniques used in the proposed algorithms, and the information routing techniques. Section 4 provides the simulation results and evaluation of the proposed protocols. Finally, conclusion and future works are represented in Section 5.
Section snippets
Literature review
Vehicular ad hoc network (VANET) is a special kind of MANET that consists of vehicles using dedicated short-range communication (DSRC) and WAVE (wireless access in vehicular environment) protocol [19]. VANETs are self-organized and self-managed networks capable of working without any pre-installed infrastructure [20]. These networks are composed of mobile nodes that are vehicles equipped with wireless interfaces and communicate with each other through unstructured vehicle to vehicle (V2V) or
The proposed target tracking scheme for vehicular ad hoc networks
In previous work, we proposed two cluster-based target tracking algorithms for vehicle tracking based on vehicle's visual features in vehicular ad hoc networks [1], [2]. In this paper, we expand our previous work by conducting extensive performance evaluations and comparative studies of our algorithms under various scenarios. In addition, we provide experimental results of a structureless target tracking algorithm to highlight the necessity of a cluster-base approach for target tracking in
Evaluation of proposed protocols
A highway simulation environment scenario has been designed and built in order to test the performance of our clustering algorithms. We have considered various density scenarios, e.g., sparse, medium and dense, in order to evaluate the proposed algorithms under different situations. In a medium density scenario, the distances between nodes are bigger compared to dense scenario. However, there are numerous vehicles that can detect the target and can join the cluster. The last scenario we
Conclusions
In this paper, we have assessed the performance of two proposed clustering algorithms designed for vehicle tracking in VANETs: the DCTT and the PCTT algorithms. The DCTT algorithm is the basic cluster-based target tracking framework that is designed to work in a distributed manner. PCTT algorithm is a centralized and prediction-based algorithm which improves clustering performance considerably. Simulation results showed that the PCTT algorithm outperforms DCTT and the structure-less carry and
References (63)
- et al.
A receiver-based video dissemination solution for vehicular networks with content transmissions decoupled from relay node selection
Ad Hoc Netw.
(2014) - et al.
Location error estimation in wireless ad hoc networks
Ad Hoc Netw., Part B
(2014) - et al.
Vehicular ad hoc networks: a new challenge for localization-based systems
Comput. Commun.
(2008) - et al.
Multihop transmission and retransmission measurement of real-time video streaming over dsrc devices
- et al.
Platoon management with cooperative adaptive cruise control enabled by {VANET}
Veh. Commun.
(2015) - et al.
Upper and lower bounds for dynamic cluster assignment for multi-target tracking in heterogeneous {WSNs}
J. Parallel Distrib. Comput.
(2013) - et al.
A distributed clustering algorithm for target tracking in vehicular ad-hoc networks
- et al.
A prediction based clustering algorithm for target tracking in vehicular ad-hoc networks
- et al.
Data dissemination in urban vehicular ad hoc networks with diverse traffic conditions
- et al.
Tibcrph: traffic infrastructure based cluster routing protocol with handoff in vanet
Location privacy in vehicular networks
Efficient group-based authentication protocol for location-based service discovery in intelligent transportation systems
Secur. Commun. Netw.
A semantics-based multi-agent framework for vehicular social network development
Social and location-based collaboration mechanism to manage wireless connectivity context data
Multilevel cluster-based information fusion in vehicle ad hoc networks
Bandwidth aggregation over vanet using the geographic member-centric routing protocol (gmr)
A new fuzzy based clustering algorithm for wireless mobile ad-hoc sensor networks
Multi-source video streaming in a wireless vehicular ad hoc network
IET Commun.
On-demand routing in large ad hoc wireless networks with passive clustering
Performance evaluation of passive clustering based techniques for inter-vehicle communications
Next Generation Vehicular Traffic Management Enabled by Vehicular Ad Hoc Networks and Cellular Mobile Devices
Secure communication scheme of vanet with privacy preserving
Design of secure and application-oriented vanets
A survey of handoff schemes for vehicular ad-hoc networks
A mobility based metric for clustering in mobile ad hoc networks
Distributed clustering in vehicular networks
A new stability based clustering algorithm (sbca) for vanets
A novel multi-hop clustering scheme for vehicular ad-hoc networks
Clustering-based multichannel mac protocols for qos provisionings over vehicular ad hoc networks
IEEE Trans. Veh. Technol.
A mobility metrics based dynamic clustering algorithm for vanets
Autonomic traffic engineering for network robustness
IEEE J. Sel. Areas Commun.
Cited by (49)
Cooperative monitoring and dissemination of urban events supported by dynamic clustering of vehicles
2020, Pervasive and Mobile ComputingCitation Excerpt :Thus, the purpose of this cooperative communication is to allow a more efficient dissemination of event information to the competent entities. MINUET was evaluated through simulations, by employing the clustering techniques proposed in [27] and [17] to measure the efficacy and efficiency of the solution under different traffic scenarios. The results showed that MINUET can detect, monitor and disseminate event stream data by the means of clustering, thus supporting the treatment of these events by an external entity.
Mutated k-means algorithm for dynamic clustering to perform effective and intelligent broadcasting in medical surveillance using selective reliable broadcast protocol in VANET
2020, Computer CommunicationsCitation Excerpt :This progressively results in better cluster heads being selected, while resisting short-lived changes in cluster head selection metrics. In [23], authors presented an approach which helps in tracking based on clustering mechanism which provides stable and reliable platform for tracking of vehicles. A threshold based mechanism in [24] which is specially designed for highway roads in which the slowest vehicle amongst the neighbors initiates the cluster formation process.
A novel selective cross layer based routing scheme using ACO method for vehicular networks
2019, Journal of Network and Computer ApplicationsA<sup>2</sup> RID - Anonymous Direct Authentication and Remote Identification of Commercial Drones
2023, IEEE Internet of Things JournalEARP: An Enhanced ACO-Based Routing Protocol for Wireless Sensor Networks with Multiple Mobile Sinks
2022, International Journal of Wireless Information NetworksApplication of Information Processing System Based on DSP in Electronic Information Engineering
2022, Journal of Physics: Conference Series
- ☆
This research work is partially sponsored by the Natural Sciences and Engineering Research Council of Canada (NSERC), Discovery Grant Program, and the NSERC DIVA Network Program.