In the last decade, daily lifestyles have been invaded by mobile networks which added a huge exchange of information. This exchange among vehicular nodes as a novel paradigm in smart… Click to show full abstract
In the last decade, daily lifestyles have been invaded by mobile networks which added a huge exchange of information. This exchange among vehicular nodes as a novel paradigm in smart cities, rapidly became one of the most important topics for industrial investigations and academic research in the same time. This technology covers several domains which impacts the daily human life making emerging mobile social network services to be projected on vehicular networks. Moreover, and especially in big cities, vehicular ad hoc networks (VANET) as a form of intelligent transportation systems have to have a cooperative driver assistance. Such applications generally call out broadcasting techniques for data dissemination. Many approaches were introduced in literature in the aim of improving broadcast performance, one of these approaches is mobility prediction. Since mobility has various aspects such as node position, direction, velocity and also density many broadcast algorithms were founded on one or more different mobility parameter. Multi point relay (MPR) a traditional heuristic for broadcasting protocols, were extended based on kinetic aspect of the network to Kinetic multi point relay (KMPR) heuristic. In this paper we introduce a modification of KMPR main formula by setting a new more accurate coverage density parameter. Then we endorse the original algorithm by other constraints to manage more performance metrics. We finally illustrate that our contribution improves the forwarding process quality compared to MPR and KMPR by reducing the relay set size and duplicate information.
               
Click one of the above tabs to view related content.