Cooperative data dissemination to mission sites

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish (US)
Title of host publicationWireless Sensing, Localization, and Processing V
Volume7706
DOIs
StatePublished - Dec 1 2010
EventWireless Sensing, Localization, and Processing V - Orlando, FL, United States
Duration: Apr 8 2010Apr 9 2010

Other

OtherWireless Sensing, Localization, and Processing V
CountryUnited States
CityOrlando, FL
Period4/8/104/9/10

Fingerprint

Data Dissemination
Ad hoc networks
costs
Costs
Computational complexity
Time delay
arrivals
Latency
time lag
Minimise
Content Distribution
Delay Time
NP-hard Problems
Ad Hoc Networks
Response Time
Assign

All Science Journal Classification (ASJC) codes

  • Electronic, Optical and Magnetic Materials
  • Condensed Matter Physics
  • Computer Science Applications
  • Applied Mathematics
  • Electrical and Electronic Engineering

Cite this

Chen, F., Johnson, M. P., Bar-Noy, A., & La Porta, T. F. (2010). Cooperative data dissemination to mission sites. In Wireless Sensing, Localization, and Processing V (Vol. 7706). [77060V] https://doi.org/10.1117/12.851186
Chen, Fangfei ; Johnson, Matthew P. ; Bar-Noy, Amotz ; La Porta, Thomas F. / Cooperative data dissemination to mission sites. Wireless Sensing, Localization, and Processing V. Vol. 7706 2010.
@inproceedings{45859bddfc5645daa8120760f4b73317,
title = "Cooperative data dissemination to mission sites",
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.",
author = "Fangfei Chen and Johnson, {Matthew P.} and Amotz Bar-Noy and {La Porta}, {Thomas F.}",
year = "2010",
month = "12",
day = "1",
doi = "10.1117/12.851186",
language = "English (US)",
isbn = "9780819481702",
volume = "7706",
booktitle = "Wireless Sensing, Localization, and Processing V",

}

Chen, F, Johnson, MP, Bar-Noy, A & La Porta, TF 2010, Cooperative data dissemination to mission sites. in Wireless Sensing, Localization, and Processing V. vol. 7706, 77060V, Wireless Sensing, Localization, and Processing V, Orlando, FL, United States, 4/8/10. https://doi.org/10.1117/12.851186

Cooperative data dissemination to mission sites. / Chen, Fangfei; Johnson, Matthew P.; Bar-Noy, Amotz; La Porta, Thomas F.

Wireless Sensing, Localization, and Processing V. Vol. 7706 2010. 77060V.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Cooperative data dissemination to mission sites

AU - Chen, Fangfei

AU - Johnson, Matthew P.

AU - Bar-Noy, Amotz

AU - La Porta, Thomas F.

PY - 2010/12/1

Y1 - 2010/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=79958175863&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79958175863&partnerID=8YFLogxK

U2 - 10.1117/12.851186

DO - 10.1117/12.851186

M3 - Conference contribution

SN - 9780819481702

VL - 7706

BT - Wireless Sensing, Localization, and Processing V

ER -

Chen F, Johnson MP, Bar-Noy A, La Porta TF. Cooperative data dissemination to mission sites. In Wireless Sensing, Localization, and Processing V. Vol. 7706. 2010. 77060V https://doi.org/10.1117/12.851186