Efficient location-based decision-supporting content distribution to mobile groups

Authors:
Mhameed Aezladen;Reuven Cohen;Danny Raz
Affiliations:
Department of Computer Science, Technion-Israel Institute of Technology, Haifa, Israel;Department of Computer Science, Technion-Israel Institute of Technology, Haifa, Israel;Department of Computer Science, Technion-Israel Institute of Technology, Haifa, Israel
Venue:
IEEE/ACM Transactions on Networking (TON)
Year:
2012

Citing 17
Cited 0

Broadcast disks: data management for asymmetric communication environments

SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Approximation algorithms for NP-hard problems

Approximation algorithms for NP-hard problems
Making games short (extended abstract)

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A group mobility model for ad hoc wireless networks

MSWiM '99 Proceedings of the 2nd ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems
Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems

Journal of the ACM (JACM)
Dynamic programming revisited: improving knapsack algorithms

Computing - Special issue on combinatorial optimization
The budgeted maximum coverage problem

Information Processing Letters
On Broadcast Disk Paging

SIAM Journal on Computing
The Node Distribution of the Random Waypoint Mobility Model for Wireless Ad Hoc Networks

IEEE Transactions on Mobile Computing
Caching and Scheduling for Broadcast Disk Systems

Journal of Experimental Algorithmics (JEA)
Broadcast reception rates and effects of priority access in 802.11-based vehicular ad-hoc networks

Proceedings of the 1st ACM international workshop on Vehicular ad hoc networks
MDDV: a mobility-centric data dissemination algorithm for vehicular networks

Proceedings of the 1st ACM international workshop on Vehicular ad hoc networks
Urban multi-hop broadcast protocol for inter-vehicle communication systems

Proceedings of the 1st ACM international workshop on Vehicular ad hoc networks
Local ratio: A unified framework for approximation algorithms. In Memoriam: Shimon Even 1935-2004

ACM Computing Surveys (CSUR)
A Fully Polynomial-Time Approximation Scheme for Feasibility Analysis in Static-Priority Systems with Arbitrary Relative Deadlines

ECRTS '05 Proceedings of the 17th Euromicro Conference on Real-Time Systems
An efficient approximation for the generalized assignment problem

Information Processing Letters
The Generalized Maximum Coverage Problem

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.