Randomized algorithms
A digital fountain approach to reliable distribution of bulk data
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Error Control Coding, Second Edition
Error Control Coding, Second Edition
Siphon: overload traffic management using multi-radio virtual sinks in sensor networks
Proceedings of the 3rd international conference on Embedded networked sensor systems
Decentralized erasure codes for distributed networked storage
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Growth codes: maximizing sensor network data persistence
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
IEEE Transactions on Information Theory
Resilient coding algorithms for sensor network data persistence
EWSN'08 Proceedings of the 5th European conference on Wireless sensor networks
Enhancing data persistence for energy constrained networks by network modulation
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Maximizing growth codes utility in large-scale wireless sensor networks
Euro-Par'10 Proceedings of the 16th international Euro-Par conference on Parallel processing: Part II
Network modulation: an algebraic approach to enhancing network data persistence
EURASIP Journal on Wireless Communications and Networking - Special issue on physical-layer network coding for wireless cooperative networks
Hi-index | 0.00 |
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.