Article

Maximizing the data utility of a data archiving & querying system through joint coding and scheduling

Authors:

Cathy H. XiaAuthors Info & Claims

IPSN '07: Proceedings of the 6th international conference on Information processing in sensor networks

Pages 244 - 253

https://doi.org/10.1145/1236360.1236394

Published: 25 April 2007 Publication History

Abstract

We study a joint scheduling and coding problem for collecting multi-snapshots spatial data in a resource constrained sensor network. Motivated by a distributed coding scheme for single snapshot data collection [7], we generalize the scenario to include multi-snapshots and general coding schemes. Associating a utility function with the recovered data, we aim to maximize the expected utility gain through joint coding and scheduling.

We first assume non-mixed coding where coding is only allowed for data of the same snapshot. We study the problem of how to schedule (or prioritize) the codewords from multiple snapshots under an archiving model where data from all snapshots are of interests with additive utilities. We formalize the scheduling problem into a Multi-Armed Bandit (MAB) problem. We derive the optimal solution using Gittins Indices, and identify conditions under which a greedy algorithm is optimal.

We then consider random mixed coding where data from different snapshots are randomly coded together. We generalize the growth codes in [7] to arbitrary linear-codes-based random mixed coding and show that there exists an optimal degree of coding. Various practical issues and the buffer size impact on performance are then discussed.

References

[1]

V. P. A. Dimakis and K. Ramchandran. Decentralized erasure codes for distributed networked storage. IEEE Transactions on Information Theory, 2006.

[2]

R. Ahlswede, N. Cai, S. Li, and R. Yeung. Network information ow. IEEE Transactions on Information Theory, 46(4):1204--1216, July 2000.

Digital Library

[3]

C. Berrou, A. Glavieux, and P. Thitimajshima. Near shannon limit error-correcting coding and decoding: Turbo-codes. In Proceedings of IEEE International Communications Conference, 1993.

[4]

J. W. Byers, M. Luby, M. Mitzenmacher, and A. Rege. A digital fountain approach to reliable distribution of bulk data. In SIGCOMM, pages 56--67, 1998.

Digital Library

[5]

K. Fall. A delay tolerant network architecture for challenged internets, 2003.

[6]

J. Gittins and D. Jones. A dynamic allocation index for the sequential design of experiments. Progress in Statistics, 1, 1972.

[7]

A. Kamra, J. Feldman, V. Misra, and D. Rubenstein. Growth codes: Maximizing sensor network data persistence. In Proceedings of ACM Sigcomm, 2006.

Digital Library

[8]

S. Lin and D. Costello. Error Control Coding: Fundamentals and Applications. Prentice Hall, 1982.

Digital Library

[9]

M. Luby. Lt codes. In The 43rd Annual IEEE Symposium on Foundations of Computer Science, pages 271--282, 2002.

Digital Library

[10]

D. J. MacKay and R. M. Neal. Near shannon limit performance of low density parity check codes. In Electronics Letters, 1996.

[11]

D. Marco, E. Duarte-Melo, M. Liu, and D. L. Neuho On the many-to-one transport capacity of a dense wireless sensor network and the compressibility of its data. In IPSN, 2003.

[12]

R. Motwani and P. Raghavan. Randomized algorithms. Cambridge University Press, 1995.

Digital Library

[13]

J. Nino-Mora. Dynamic allocation indices for restless projects and queueing admission control: A polyhedral approach. Math. Program, 2002.

[14]

P. Varaiya, J. Walrand, and C. Buyukkoc. Extensions of the multiarmed bandit problem: The discounted case. IEEE Transactions on Automatic Control, 1985.

[15]

C. Wan, S. B. Eisenman, A. T. Campbell, and J. Crowcroft. Siphon: overload traffic management using multi-radio virtual sinks in sensor networks. In SenSys, 2005.

Digital Library

[16]

J. Warland. An introduction to queueing networks. Prentice Hall, 1988.

[17]

P. Whittle. Arm-acquiring bandits. The Annals of Probability, 9, 1981.

Cited By

Zhang WZhang QXu XWan J(2012)An Optimized Degree Strategy for Persistent Sensor Network Data DistributionProceedings of the 2012 20th Euromicro International Conference on Parallel, Distributed and Network-based Processing10.1109/PDP.2012.75(130-137)Online publication date: 15-Feb-2012
https://dl.acm.org/doi/10.1109/PDP.2012.75
Choi GSungeun Lee Ma X(2012)Enhancing data persistence of wireless networks: Where NeMo meets OFDM2012 46th Annual Conference on Information Sciences and Systems (CISS)10.1109/CISS.2012.6310853(1-6)Online publication date: Mar-2012
https://doi.org/10.1109/CISS.2012.6310853
Zhao YWang XZhao JXue X(2010)Maximizing growth codes utility in large-scale wireless sensor networksProceedings of the 16th international Euro-Par conference on Parallel processing: Part II10.5555/1885276.1885326(466-477)Online publication date: 31-Aug-2010
https://dl.acm.org/doi/10.5555/1885276.1885326
Show More Cited By

Index Terms

Maximizing the data utility of a data archiving & querying system through joint coding and scheduling

Recommendations

Network coding-aware rate control and scheduling in wireless networks
ICME'09: Proceedings of the 2009 IEEE international conference on Multimedia and Expo

In this paper, we study rate control and scheduling over wireless networks with intersession network coding, as a utility maximization problem. We demonstrate that making rate control and scheduling aware of the underlying network coding increases ...
Adaptive data-aware utility-based scheduling in resource-constrained systems

This paper addresses the problem of the dynamic scheduling of data-intensive multiprocessor jobs. Each job requires some number of CPUs and some amount of data that needs to be downloaded into a local storage. The completion of each job brings some ...
Adaptive data-aware utility-based scheduling in resource-constrained systems

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

IPSN '07: Proceedings of the 6th international conference on Information processing in sensor networks

April 2007

592 pages

ISBN:9781595936387

DOI:10.1145/1236360

General Chair:
Tarek Abdelzaher
University of Illinois at Urbana-Champaign
,
Program Chairs:
Leo Guibas
Stanford University
,
Matt Welsh
Harvard University

Copyright © 2007 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 25 April 2007

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

IPSN07

Sponsor:

IPSN07: The 6th International Conference on Information Processing in Sensor Networks

April 25 - 27, 2007

Massachusetts, Cambridge, USA

Acceptance Rates

Overall Acceptance Rate 143 of 593 submissions, 24%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
318
Total Downloads

Downloads (Last 12 months)1
Downloads (Last 6 weeks)1

Reflects downloads up to 08 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Zhang WZhang QXu XWan J(2012)An Optimized Degree Strategy for Persistent Sensor Network Data DistributionProceedings of the 2012 20th Euromicro International Conference on Parallel, Distributed and Network-based Processing10.1109/PDP.2012.75(130-137)Online publication date: 15-Feb-2012
https://dl.acm.org/doi/10.1109/PDP.2012.75
Choi GSungeun Lee Ma X(2012)Enhancing data persistence of wireless networks: Where NeMo meets OFDM2012 46th Annual Conference on Information Sciences and Systems (CISS)10.1109/CISS.2012.6310853(1-6)Online publication date: Mar-2012
https://doi.org/10.1109/CISS.2012.6310853
Zhao YWang XZhao JXue X(2010)Maximizing growth codes utility in large-scale wireless sensor networksProceedings of the 16th international Euro-Par conference on Parallel processing: Part II10.5555/1885276.1885326(466-477)Online publication date: 31-Aug-2010
https://dl.acm.org/doi/10.5555/1885276.1885326
Ma XChoi GZhang W(2010)Network modulationEURASIP Journal on Wireless Communications and Networking10.1155/2010/1413402010(1-15)Online publication date: 1-Jan-2010
https://dl.acm.org/doi/10.1155/2010/141340
Masiero RMunaretto DRossi MWidmer JZorzi M(2009)A Note on the Buffer Overlap Among Nodes Performing Random Network Coding in Wireless Ad Hoc NetworksVTC Spring 2009 - IEEE 69th Vehicular Technology Conference10.1109/VETECS.2009.5073314(1-5)Online publication date: Apr-2009
https://doi.org/10.1109/VETECS.2009.5073314
Zhang WMa XChoi G(2009)Enhancing data persistence for energy constrained networks by network modulation2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)10.1109/ALLERTON.2009.5394803(214-221)Online publication date: Sep-2009
https://doi.org/10.1109/ALLERTON.2009.5394803
Munaretto DWidmer JRossi MZorzi M(2008)Resilient coding algorithms for sensor network data persistenceProceedings of the 5th European conference on Wireless sensor networks10.5555/1786014.1786028(156-170)Online publication date: 30-Jan-2008
https://dl.acm.org/doi/10.5555/1786014.1786028

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten