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

IPSN 2007: Proceedings of the Sixth International Symposium on Information Processing in Sensor Networks

Volumn , Issue , 2007, Pages 244-253

  Liu, Junning ^a   Liu, Zhen ^b   Towsley, Don ^a   Xia, Cathy H ^b  

^a The Manning College of Information and Computer Sciences   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Joint coding and scheduling; Multi snapshots data collection; Network coding; Sensor network; Utility maximization

Indexed keywords

ALGORITHMS; ENCODING (SYMBOLS); OPTIMIZATION; QUERY PROCESSING; RESOURCE ALLOCATION; SCHEDULING;

GREEDY ALGORITHMS; JOINT CODING; MULTI-SNAPSHOTS DATA COLLECTION; NETWORK CODING; UTILITY MAXIMIZATION;

SENSOR NETWORKS;

EID: 35348886639     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1236360.1236394     Document Type: Conference Paper

References (17)

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 flow. IEEE Transactions on Information Theory, 46(4):1204-1216, July 2000.
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.
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.
8. S. Lin and D. Costello. Error Control Coding: Fundamentals and Applications. Prentice Hall, 1982.
9. M. Luby. Lt codes. In The 43rd Annual IEEE Symposium on Foundations of Computer Science, pages 271-282, 2002.
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. Neuhoff. 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.
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.
16. J. Warland. An introduction to queueing networks. Prentice Hall, 1988.
17. P. Whittle. Arm-acquiring bandits. The Annals of Probability, 9, 1981.