Efficient Location-Based Decision-Supporting Content Distribution to Mobile Groups

This paper deals with efficient location-based decision-supporting content distribution to mobile groups. We consider the case where a set of information dissemination devices (IDDs) broadcast a limited amount of location-based information to passing mobile nodes that are moving along well-defined paths. We develop a novel model that captures the main aspects of the problem and define a new optimization problem we call Maximum Benefit Message Assignment Problem (MBMAP). We study several variants of this problem in the case where the IDDs are cooperative and in the case where they are not. We develop new approximation algorithms for these variants and then focus on the practical effects of using them in realistic networking scenarios.

[1]  Kaixin Xu,et al.  Group and swarm mobility models for ad hoc network scenarios using virtual tracks , 2004, IEEE MILCOM 2004. Military Communications Conference, 2004..

[2]  Sanjoy K. Baruah,et al.  A fully polynomial-time approximation scheme for feasibility analysis in static-priority systems with arbitrary relative deadlines , 2005, 17th Euromicro Conference on Real-Time Systems (ECRTS'05).

[3]  R. Bishop,et al.  A survey of intelligent vehicle applications worldwide , 2000, Proceedings of the IEEE Intelligent Vehicles Symposium 2000 (Cat. No.00TH8511).

[4]  Ulrich Pferschy,et al.  Dynamic Programming Revisited: Improving Knapsack Algorithms , 1999, Computing.

[5]  Reuven Cohen,et al.  Locally vs. Globally Optimized Flow-Based Content Distribution to Mobile Nodes , 2009, IEEE INFOCOM 2009.

[6]  Reuven Cohen,et al.  The Generalized Maximum Coverage Problem , 2008, Inf. Process. Lett..

[7]  Xiaoyan Hong,et al.  A group mobility model for ad hoc wireless networks , 1999, MSWiM '99.

[8]  Oscar H. Ibarra,et al.  Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems , 1975, JACM.

[9]  Hao Wu,et al.  MDDV: a mobility-centric data dissemination algorithm for vehicular networks , 2004, VANET '04.

[10]  Hannes Hartenstein,et al.  Broadcast reception rates and effects of priority access in 802.11-based vehicular ad-hoc networks , 2004, VANET '04.

[11]  T. Maehata,et al.  DSRC using OFDM for roadside-vehicle communication system , 2000, VTC2000-Spring. 2000 IEEE 51st Vehicular Technology Conference Proceedings (Cat. No.00CH37026).

[12]  Reuven Cohen,et al.  An efficient approximation for the Generalized Assignment Problem , 2006, Inf. Process. Lett..

[13]  Anthony H. Dekker.  Centralisation and decentralisation in network centric warfare , 2003 .

[14]  Falko Dressler,et al.  Network-centric Actuation Control in Sensor/Actuator Networks based on Bio-inspired Technologies , 2006, 2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems.

[15]  Reuven Cohen,et al.  Scheduling algorithms for a cache pre-filling content distribution network , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[16]  Savyasachi Samal,et al.  Mobility Pattern Aware Routing in Mobile Ad Hoc Networks , 2003 .

[17]  Eylem Ekici,et al.  Urban multi-hop broadcast protocol for inter-vehicle communication systems , 2004, VANET '04.

[18]  Rafael Alonso,et al.  Broadcast disks: data management for asymmetric communication environments , 1995, SIGMOD '95.

[19]  Sanjeev Khanna,et al.  On broadcast disk paging , 1998, STOC '98.

[20]  Dror Rawitz,et al.  Local ratio: A unified framework for approximation algorithms. In Memoriam: Shimon Even 1935-2004 , 2004, CSUR.

[21]  Samir Khuller,et al.  The Budgeted Maximum Coverage Problem , 1999, Inf. Process. Lett..

[22]  Raja Sengupta,et al.  Effects of vehicle-vehicle/roadside-vehicle communication on adaptive cruise controlled highway systems , 2002, Proceedings IEEE 56th Vehicular Technology Conference.

[23]  Uriel Feige,et al.  Making games short (extended abstract) , 1997, STOC '97.

[24]  Vincenzo Liberatore,et al.  Caching and Scheduling for Broadcast Disk Systems , 2001, JEAL.

[25]  Paolo Santi,et al.  The Node Distribution of the Random Waypoint Mobility Model for Wireless Ad Hoc Networks , 2003, IEEE Trans. Mob. Comput..

[26]  H IbarraOscar,et al.  Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems , 1975 .

[27]  Dorit S. Hochba,et al.  Approximation Algorithms for NP-Hard Problems , 1997, SIGA.