Next Article in Journal
Angle-Polarization Estimation for Coherent Sources with Linear Tripole Sensor Arrays
Next Article in Special Issue
Joint Transmit Antenna Selection and Power Allocation for ISDF Relaying Mobile-to-Mobile Sensor Networks
Previous Article in Journal
One-Pot Hydrothermal Synthesis of Magnetite Prussian Blue Nano-Composites and Their Application to Fabricate Glucose Biosensor
Previous Article in Special Issue
Classification between Failed Nodes and Left Nodes in Mobile Asset Tracking Systems †
Article Menu

Export Article

Open AccessArticle

A Game Theory Algorithm for Intra-Cluster Data Aggregation in a Vehicular Ad Hoc Network

College of Mathematics and Computer Science, Fuzhou University, Fuzhou 350116, China
Fujian Provincial Key Laboratory of Networking Computing and Intelligent Information Processing, Fuzhou University, Fuzhou 350116, China
School of Information Technology, Jiangxi University of Finance and Economics, Nanchang, China
Authors to whom correspondence should be addressed.
Academic Editor: Leonhard M. Reindl
Sensors 2016, 16(2), 245;
Received: 30 December 2015 / Revised: 4 February 2016 / Accepted: 12 February 2016 / Published: 19 February 2016
(This article belongs to the Special Issue Mobile Sensor Computing: Theory and Applications)
PDF [2064 KB, uploaded 19 February 2016]


Vehicular ad hoc networks (VANETs) have an important role in urban management and planning. The effective integration of vehicle information in VANETs is critical to traffic analysis, large-scale vehicle route planning and intelligent transportation scheduling. However, given the limitations in the precision of the output information of a single sensor and the difficulty of information sharing among various sensors in a highly dynamic VANET, effectively performing data aggregation in VANETs remains a challenge. Moreover, current studies have mainly focused on data aggregation in large-scale environments but have rarely discussed the issue of intra-cluster data aggregation in VANETs. In this study, we propose a multi-player game theory algorithm for intra-cluster data aggregation in VANETs by analyzing the competitive and cooperative relationships among sensor nodes. Several sensor-centric metrics are proposed to measure the data redundancy and stability of a cluster. We then study the utility function to achieve efficient intra-cluster data aggregation by considering both data redundancy and cluster stability. In particular, we prove the existence of a unique Nash equilibrium in the game model, and conduct extensive experiments to validate the proposed algorithm. Results demonstrate that the proposed algorithm has advantages over typical data aggregation algorithms in both accuracy and efficiency. View Full-Text
Keywords: data aggregation; game theory; vehicular ad hoc network; nash equilibrium data aggregation; game theory; vehicular ad hoc network; nash equilibrium

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).

Share & Cite This Article

MDPI and ACS Style

Chen, Y.; Weng, S.; Guo, W.; Xiong, N. A Game Theory Algorithm for Intra-Cluster Data Aggregation in a Vehicular Ad Hoc Network. Sensors 2016, 16, 245.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics



[Return to top]
Sensors EISSN 1424-8220 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top