| Popis: |
Road traffic information can be collected over a vehicular ad-hoc network (VANET) and utilized in many intelligent traffic system applications. A clustering mechanism is used to create a cluster of vehicles to facilitate the data collection from vehicles to road side units (RSUs) acting as sink nodes. Unlike previous works that focus on cluster lifetime or throughput, we propose a coalitional graph game (CGG) technique to form a multi-hop cluster with a largest possible coverage area for a given transmission delay time constraint to economize on the number of RSUs. Vehicles decide to join or leave the coalition based on their individual utility that is a weighted function of number of members in the coalition, relative velocities, distance to sink nodes, and transmission delay toward the sink nodes. The stability of cluster formation is proved by using a discrete-time Markov chain. Our results show that the proposed game model always yields a stable coalition structure that satisfies the objective, and the solutions vary with the weights given to individual components in the utility function. |
