Cooperative data dissemination to mission sites

Fangfei Chen; Matthew P. Johnson; Amotz Bar-Noy; Thomas F. La Porta

doi:10.1117/12.851186

28 April 2010 Cooperative data dissemination to mission sites

Fangfei Chen, Matthew P. Johnson, Amotz Bar-Noy, Thomas F. La Porta

Proceedings Volume 7706, Wireless Sensing, Localization, and Processing V; 77060V (2010) https://doi.org/10.1117/12.851186
Event: SPIE Defense, Security, and Sensing, 2010, Orlando, Florida, United States

Abstract

Timely dissemination of information to mobile users is vital in many applications. In a critical situation, no network infrastructure may be available for use in dissemination, over and above the on-board storage capability of the mobile users themselves. We consider the following specialized content distribution application: a group of users equipped with wireless devices build an ad hoc network in order cooperatively to retrieve information from certain regions (the mission sites). Each user requires access to some set of information items originating from sources lying within a region. Each user desires low-latency access to its desired data items, upon request (i.e., when pulled). In order to minimize average response time, we allow users to pull data either directly from sources or, when possible, from other nearby users who have already pulled, and continue to carry, the desired data items. That is, we allow for data to be pushed to one user and then pulled by one or more additional users. The total latency experienced by a user vis-vis a certain data item is then in general a combination of the push delay and the pull delay. We assume each delay time is a function of the hop distance between the pair of points in question. Our goal in this paper is to assign data to mobile users, in order to minimize the total cost and the average latency experienced by all the users. In a static setting, we solve this problem in two different schemes, one of which is easy to solve but wasteful, one of which relates to NP-hard problems but is less so. Then in a dynamic setting, we adapt the algorithm for the static setting and develop a new algorithm with respect to users' gradual arrival. In the end we show a trade-off can be made between minimizing the cost and latency.

Citation Download Citation

Fangfei Chen, Matthew P. Johnson, Amotz Bar-Noy, and Thomas F. La Porta "Cooperative data dissemination to mission sites", Proc. SPIE 7706, Wireless Sensing, Localization, and Processing V, 77060V (28 April 2010); https://doi.org/10.1117/12.851186

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available

Members: $17.00

Non-members: $21.00 ADD TO CART

PROCEEDINGS
8 PAGES

DOWNLOAD PAPER SAVE TO MY LIBRARY

GET CITATION

RIGHTS & PERMISSIONS

Get copyright permission Get copyright permission on Copyright Marketplace

KEYWORDS

Data storage

Algorithm development

Computer simulations

Analytical research

Computer science

Defense and security

Computer engineering

Show All Keywords

Keywords/Phrases

Search In:

Publication Years