Date Added: Jan 2011
The paper deals with efficient distribution of timely information to mobile groups. The authors consider the case where a set of Information Dissemination Devices (IDDs) broadcast a limited amount of information to passing mobile nodes that are moving along well-defined paths. This is the case, for example, in intelligent transportation systems. They develop a novel model that captures the main aspects of the problem, and define a new optimization problem they call MBMAP (Maximum Benefit Message Assignment Problem). They study several variants of this problem in the case where the IDDs are cooperative and in the case where they are not.