Lifetime maximized data gathering in wireless sensor networks using limited-order distributed source coding
From MaRDI portal
Publication:634890
Recommendations
- Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks.
- Communication scheduling in data gathering networks with limited memory
- Maximum lifetime data sensing and extraction in energy constrained networked sensor systems
- Decomposition algorithms for maximizing the lifetime of wireless sensor networks with mobile sinks
- scientific article; zbMATH DE number 6611775
Cites work
- An energy-efficient adaptive DSC scheme for wireless sensor networks
- Approaching the Slepian-Wolf boundary using practical channel codes
- Distributed coding of three binary and Gaussian correlated sources using punctured turbo codes
- Distributed source coding using symbol-based and non-binary turbo codes -- applications to wireless sensor networks
- Distributed source coding using syndromes (DISCUS): design and construction
- Elements of Information Theory
- Networked Slepian–Wolf: Theory, Algorithms, and Scaling Laws
- Noiseless coding of correlated information sources
Cited in
(3)
This page was built for publication: Lifetime maximized data gathering in wireless sensor networks using limited-order distributed source coding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q634890)