Data selection for maximum coverage in sensor networks with cost constraints

Scott T. Rager, Ertugrul N. Ciftcioglu, Thomas F. La Porta, Alice Leung, William Dron, Ram Ramanathan, John Hancock

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

1 Citation (Scopus)

Abstract

In many deployments of wireless sensor networks (WSNs), the primary goal is to collect and deliver data from many nodes to a data sink. This goal must be met while considering limited resources, such as battery life, in the wireless nodes. In this work, we propose considering the content of generated data to make intelligent data and node selection decisions. We formally present the problem of maximizing coverage of this collected data while restricting individual node costs to remain within a given budget and provide an algorithm that provides the optimal solution. Next we consider the related problem of finding the optimal long-term average coverage subject to average cost constraints and give its solution, which uses Lyapunov Optimization techniques. For real world implementations, we also provide computationally feasible approximation algorithms of both problems along with proven bounds on their performance, including a novel technique that uses virtual queues for the average maximum coverage problem. Finally, we provide simulation results of all proposed algorithms. These results not only demonstrate the benefits of considering data content in scheduling, but also show the advantages from using the long-term average solution and the near-optimal performance of our greedy virtual queue approximation algorithm.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE International Conference on Distributed Computing in Sensor Systems, DCOSS 2014
PublisherIEEE Computer Society
Pages209-216
Number of pages8
ISBN (Print)9781479946198
DOIs
StatePublished - Jan 1 2014
Event9th IEEE International Conference on Distributed Computing in Sensor Systems, DCOSS 2014 - Marina Del Rey, CA, United States
Duration: May 26 2014May 28 2014

Publication series

NameProceedings - IEEE International Conference on Distributed Computing in Sensor Systems, DCOSS 2014

Other

Other9th IEEE International Conference on Distributed Computing in Sensor Systems, DCOSS 2014
CountryUnited States
CityMarina Del Rey, CA
Period5/26/145/28/14

Fingerprint

Approximation algorithms
Sensor networks
Costs
Wireless sensor networks
Scheduling

All Science Journal Classification (ASJC) codes

  • Software

Cite this

Rager, S. T., Ciftcioglu, E. N., La Porta, T. F., Leung, A., Dron, W., Ramanathan, R., & Hancock, J. (2014). Data selection for maximum coverage in sensor networks with cost constraints. In Proceedings - IEEE International Conference on Distributed Computing in Sensor Systems, DCOSS 2014 (pp. 209-216). [6846167] (Proceedings - IEEE International Conference on Distributed Computing in Sensor Systems, DCOSS 2014). IEEE Computer Society. https://doi.org/10.1109/DCOSS.2014.35
Rager, Scott T. ; Ciftcioglu, Ertugrul N. ; La Porta, Thomas F. ; Leung, Alice ; Dron, William ; Ramanathan, Ram ; Hancock, John. / Data selection for maximum coverage in sensor networks with cost constraints. Proceedings - IEEE International Conference on Distributed Computing in Sensor Systems, DCOSS 2014. IEEE Computer Society, 2014. pp. 209-216 (Proceedings - IEEE International Conference on Distributed Computing in Sensor Systems, DCOSS 2014).
@inproceedings{b60ae513e2034fc987225d97c0f20047,
title = "Data selection for maximum coverage in sensor networks with cost constraints",
abstract = "In many deployments of wireless sensor networks (WSNs), the primary goal is to collect and deliver data from many nodes to a data sink. This goal must be met while considering limited resources, such as battery life, in the wireless nodes. In this work, we propose considering the content of generated data to make intelligent data and node selection decisions. We formally present the problem of maximizing coverage of this collected data while restricting individual node costs to remain within a given budget and provide an algorithm that provides the optimal solution. Next we consider the related problem of finding the optimal long-term average coverage subject to average cost constraints and give its solution, which uses Lyapunov Optimization techniques. For real world implementations, we also provide computationally feasible approximation algorithms of both problems along with proven bounds on their performance, including a novel technique that uses virtual queues for the average maximum coverage problem. Finally, we provide simulation results of all proposed algorithms. These results not only demonstrate the benefits of considering data content in scheduling, but also show the advantages from using the long-term average solution and the near-optimal performance of our greedy virtual queue approximation algorithm.",
author = "Rager, {Scott T.} and Ciftcioglu, {Ertugrul N.} and {La Porta}, {Thomas F.} and Alice Leung and William Dron and Ram Ramanathan and John Hancock",
year = "2014",
month = "1",
day = "1",
doi = "10.1109/DCOSS.2014.35",
language = "English (US)",
isbn = "9781479946198",
series = "Proceedings - IEEE International Conference on Distributed Computing in Sensor Systems, DCOSS 2014",
publisher = "IEEE Computer Society",
pages = "209--216",
booktitle = "Proceedings - IEEE International Conference on Distributed Computing in Sensor Systems, DCOSS 2014",
address = "United States",

}

Rager, ST, Ciftcioglu, EN, La Porta, TF, Leung, A, Dron, W, Ramanathan, R & Hancock, J 2014, Data selection for maximum coverage in sensor networks with cost constraints. in Proceedings - IEEE International Conference on Distributed Computing in Sensor Systems, DCOSS 2014., 6846167, Proceedings - IEEE International Conference on Distributed Computing in Sensor Systems, DCOSS 2014, IEEE Computer Society, pp. 209-216, 9th IEEE International Conference on Distributed Computing in Sensor Systems, DCOSS 2014, Marina Del Rey, CA, United States, 5/26/14. https://doi.org/10.1109/DCOSS.2014.35

Data selection for maximum coverage in sensor networks with cost constraints. / Rager, Scott T.; Ciftcioglu, Ertugrul N.; La Porta, Thomas F.; Leung, Alice; Dron, William; Ramanathan, Ram; Hancock, John.

Proceedings - IEEE International Conference on Distributed Computing in Sensor Systems, DCOSS 2014. IEEE Computer Society, 2014. p. 209-216 6846167 (Proceedings - IEEE International Conference on Distributed Computing in Sensor Systems, DCOSS 2014).

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

TY - GEN

T1 - Data selection for maximum coverage in sensor networks with cost constraints

AU - Rager, Scott T.

AU - Ciftcioglu, Ertugrul N.

AU - La Porta, Thomas F.

AU - Leung, Alice

AU - Dron, William

AU - Ramanathan, Ram

AU - Hancock, John

PY - 2014/1/1

Y1 - 2014/1/1

N2 - In many deployments of wireless sensor networks (WSNs), the primary goal is to collect and deliver data from many nodes to a data sink. This goal must be met while considering limited resources, such as battery life, in the wireless nodes. In this work, we propose considering the content of generated data to make intelligent data and node selection decisions. We formally present the problem of maximizing coverage of this collected data while restricting individual node costs to remain within a given budget and provide an algorithm that provides the optimal solution. Next we consider the related problem of finding the optimal long-term average coverage subject to average cost constraints and give its solution, which uses Lyapunov Optimization techniques. For real world implementations, we also provide computationally feasible approximation algorithms of both problems along with proven bounds on their performance, including a novel technique that uses virtual queues for the average maximum coverage problem. Finally, we provide simulation results of all proposed algorithms. These results not only demonstrate the benefits of considering data content in scheduling, but also show the advantages from using the long-term average solution and the near-optimal performance of our greedy virtual queue approximation algorithm.

AB - In many deployments of wireless sensor networks (WSNs), the primary goal is to collect and deliver data from many nodes to a data sink. This goal must be met while considering limited resources, such as battery life, in the wireless nodes. In this work, we propose considering the content of generated data to make intelligent data and node selection decisions. We formally present the problem of maximizing coverage of this collected data while restricting individual node costs to remain within a given budget and provide an algorithm that provides the optimal solution. Next we consider the related problem of finding the optimal long-term average coverage subject to average cost constraints and give its solution, which uses Lyapunov Optimization techniques. For real world implementations, we also provide computationally feasible approximation algorithms of both problems along with proven bounds on their performance, including a novel technique that uses virtual queues for the average maximum coverage problem. Finally, we provide simulation results of all proposed algorithms. These results not only demonstrate the benefits of considering data content in scheduling, but also show the advantages from using the long-term average solution and the near-optimal performance of our greedy virtual queue approximation algorithm.

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

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

U2 - 10.1109/DCOSS.2014.35

DO - 10.1109/DCOSS.2014.35

M3 - Conference contribution

AN - SCOPUS:84904438573

SN - 9781479946198

T3 - Proceedings - IEEE International Conference on Distributed Computing in Sensor Systems, DCOSS 2014

SP - 209

EP - 216

BT - Proceedings - IEEE International Conference on Distributed Computing in Sensor Systems, DCOSS 2014

PB - IEEE Computer Society

ER -

Rager ST, Ciftcioglu EN, La Porta TF, Leung A, Dron W, Ramanathan R et al. Data selection for maximum coverage in sensor networks with cost constraints. In Proceedings - IEEE International Conference on Distributed Computing in Sensor Systems, DCOSS 2014. IEEE Computer Society. 2014. p. 209-216. 6846167. (Proceedings - IEEE International Conference on Distributed Computing in Sensor Systems, DCOSS 2014). https://doi.org/10.1109/DCOSS.2014.35