DMAP: Density Map Service in City Environments

Abstract

Vehicle density information is crucial for efficient functioning of many vehicular applications, including emergency notification, driver assistance, and infotainment applications. This information is used for evacuation planning in accident scenarios, finding alternate routes in the case of road congestion, and providing stable routing paths for uninterrupted internet connections. In a city scenario, it is a tedious task to continuously collect and share large volumes of data containing density information. In this paper, we propose a mechanism to create a density map for city environments. A hierarchy (i.e., tree) is established, where a node represents a road segment and the density is used to determine the height of the node; the root node represents the road segment having highest density. The purpose of this tree is to collect and aggregate density information starting from the leaves until the root node is reached. Then, the aggregated density information (i.e., density map) is forwarded down the hierarchy. For efficient aggregation of density information, we adopt an effective curve-fitting method where data are represented in an equation. Simulation results show that the proposed mechanism allows highly accurate computing of density map while generating low network overhead.