Distributed event notification in VANET with multiple service providers

Many future applications in vehicular networks will be event-driven and will require events generated at different parts of a city to be delivered to moving vehicles in time. We propose a distributed framework for efficient event dissemination with multiple service providers (SPs) in a city where each SP uses a publish-subscribe communication framework using roadside units (RSUs). SPs know only about their own subscriptions and events, but have no knowledge about the subscriptions and events of other SPs. In this paper, we propose a problem called the Bounded Minimum Cost Event Placement Problem where SPs collaboratively schedule the dissemination of the events through RSUs so that maximum number of subscriptions are satisfied while incurring minimum cost to the SPs. We propose a distributed algorithm to solve the problem and present initial simulation results for some realistic traffic scenarios.