On mobile sensor data collection using data mules

Arun Das, Anisha Mazumder, Arunabha Sen, Nathalie Mitton

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

4 Citations (Scopus)

Abstract

The sensor data collection problem using data mules has been studied fairly extensively in the literature. However, in most of these studies, while the mule is mobile, all sensors are stationary. The objective of most of these studies is to minimize the time needed by the mule to collect data from all the sensors and return to the data collection point from where it embarked on its data collection journey. The problem studied in this paper has two major differences with these earlier studies. First, in this study we assume that both the mule as well as the sensors are mobile. Second, we do not attempt to minimize the data collection time. Instead, we minimize the number of mules that will be needed to collect data from all the sensors, subject to the constraint that the data collection process has to be completed within some pre-specified time. We show that the mule minimization problem is NP-Complete and analyze the problem in two settings. We provide solutions to the problem in both settings by first transforming the problem to a generalized version of the minimum flow problem in a network, and then solving it optimally using Integer Linear Programming. Finally, we evaluate our algorithms through experiments and present our results.

Original languageEnglish (US)
Title of host publication2016 International Conference on Computing, Networking and Communications, ICNC 2016
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Print)9781467385794
DOIs
StatePublished - Mar 23 2016
EventInternational Conference on Computing, Networking and Communications, ICNC 2016 - Kauai, United States
Duration: Feb 15 2016Feb 18 2016

Other

OtherInternational Conference on Computing, Networking and Communications, ICNC 2016
CountryUnited States
CityKauai
Period2/15/162/18/16

Fingerprint

Sensors
Linear programming
Computational complexity
programming
experiment
Experiments
time

ASJC Scopus subject areas

  • Computer Science Applications
  • Computer Networks and Communications
  • Social Sciences (miscellaneous)

Cite this

Das, A., Mazumder, A., Sen, A., & Mitton, N. (2016). On mobile sensor data collection using data mules. In 2016 International Conference on Computing, Networking and Communications, ICNC 2016 [7440562] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICCNC.2016.7440562

On mobile sensor data collection using data mules. / Das, Arun; Mazumder, Anisha; Sen, Arunabha; Mitton, Nathalie.

2016 International Conference on Computing, Networking and Communications, ICNC 2016. Institute of Electrical and Electronics Engineers Inc., 2016. 7440562.

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

Das, A, Mazumder, A, Sen, A & Mitton, N 2016, On mobile sensor data collection using data mules. in 2016 International Conference on Computing, Networking and Communications, ICNC 2016., 7440562, Institute of Electrical and Electronics Engineers Inc., International Conference on Computing, Networking and Communications, ICNC 2016, Kauai, United States, 2/15/16. https://doi.org/10.1109/ICCNC.2016.7440562
Das A, Mazumder A, Sen A, Mitton N. On mobile sensor data collection using data mules. In 2016 International Conference on Computing, Networking and Communications, ICNC 2016. Institute of Electrical and Electronics Engineers Inc. 2016. 7440562 https://doi.org/10.1109/ICCNC.2016.7440562
Das, Arun ; Mazumder, Anisha ; Sen, Arunabha ; Mitton, Nathalie. / On mobile sensor data collection using data mules. 2016 International Conference on Computing, Networking and Communications, ICNC 2016. Institute of Electrical and Electronics Engineers Inc., 2016.
@inproceedings{e033e78a43934f609133e56f1fd35444,
title = "On mobile sensor data collection using data mules",
abstract = "The sensor data collection problem using data mules has been studied fairly extensively in the literature. However, in most of these studies, while the mule is mobile, all sensors are stationary. The objective of most of these studies is to minimize the time needed by the mule to collect data from all the sensors and return to the data collection point from where it embarked on its data collection journey. The problem studied in this paper has two major differences with these earlier studies. First, in this study we assume that both the mule as well as the sensors are mobile. Second, we do not attempt to minimize the data collection time. Instead, we minimize the number of mules that will be needed to collect data from all the sensors, subject to the constraint that the data collection process has to be completed within some pre-specified time. We show that the mule minimization problem is NP-Complete and analyze the problem in two settings. We provide solutions to the problem in both settings by first transforming the problem to a generalized version of the minimum flow problem in a network, and then solving it optimally using Integer Linear Programming. Finally, we evaluate our algorithms through experiments and present our results.",
author = "Arun Das and Anisha Mazumder and Arunabha Sen and Nathalie Mitton",
year = "2016",
month = "3",
day = "23",
doi = "10.1109/ICCNC.2016.7440562",
language = "English (US)",
isbn = "9781467385794",
booktitle = "2016 International Conference on Computing, Networking and Communications, ICNC 2016",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - On mobile sensor data collection using data mules

AU - Das, Arun

AU - Mazumder, Anisha

AU - Sen, Arunabha

AU - Mitton, Nathalie

PY - 2016/3/23

Y1 - 2016/3/23

N2 - The sensor data collection problem using data mules has been studied fairly extensively in the literature. However, in most of these studies, while the mule is mobile, all sensors are stationary. The objective of most of these studies is to minimize the time needed by the mule to collect data from all the sensors and return to the data collection point from where it embarked on its data collection journey. The problem studied in this paper has two major differences with these earlier studies. First, in this study we assume that both the mule as well as the sensors are mobile. Second, we do not attempt to minimize the data collection time. Instead, we minimize the number of mules that will be needed to collect data from all the sensors, subject to the constraint that the data collection process has to be completed within some pre-specified time. We show that the mule minimization problem is NP-Complete and analyze the problem in two settings. We provide solutions to the problem in both settings by first transforming the problem to a generalized version of the minimum flow problem in a network, and then solving it optimally using Integer Linear Programming. Finally, we evaluate our algorithms through experiments and present our results.

AB - The sensor data collection problem using data mules has been studied fairly extensively in the literature. However, in most of these studies, while the mule is mobile, all sensors are stationary. The objective of most of these studies is to minimize the time needed by the mule to collect data from all the sensors and return to the data collection point from where it embarked on its data collection journey. The problem studied in this paper has two major differences with these earlier studies. First, in this study we assume that both the mule as well as the sensors are mobile. Second, we do not attempt to minimize the data collection time. Instead, we minimize the number of mules that will be needed to collect data from all the sensors, subject to the constraint that the data collection process has to be completed within some pre-specified time. We show that the mule minimization problem is NP-Complete and analyze the problem in two settings. We provide solutions to the problem in both settings by first transforming the problem to a generalized version of the minimum flow problem in a network, and then solving it optimally using Integer Linear Programming. Finally, we evaluate our algorithms through experiments and present our results.

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

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

U2 - 10.1109/ICCNC.2016.7440562

DO - 10.1109/ICCNC.2016.7440562

M3 - Conference contribution

AN - SCOPUS:84966667969

SN - 9781467385794

BT - 2016 International Conference on Computing, Networking and Communications, ICNC 2016

PB - Institute of Electrical and Electronics Engineers Inc.

ER -