Lifetime maximized data gathering in wireless sensor networks using limited-order distributed source coding
DOI10.1016/J.SIGPRO.2011.05.003zbMATH Open1222.94004OpenAlexW405247004MaRDI QIDQ634890FDOQ634890
Authors: Hamidreza Arjmandi, Mehrdad Taki, Farshad Lahouti 
Publication date: 17 August 2011
Published in: Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.sigpro.2011.05.003
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
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Communication theory (94A05) Source coding (94A29)
Cites Work
- Elements of Information Theory
- Noiseless coding of correlated information sources
- Distributed source coding using syndromes (DISCUS): design and construction
- 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
- Networked Slepian–Wolf: Theory, Algorithms, and Scaling Laws
- An energy-efficient adaptive DSC scheme for wireless sensor networks
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)
