Fast communication: Lifetime maximized data gathering in wireless sensor networks using limited-order distributed source coding

Authors:
Hamidreza Arjmandi;Mehrdad Taki;Farshad Lahouti
Affiliations:
Wireless Multimedia Communications Laboratory, Center of Excellence on Applied Electromagnetic Systems, School of Electrical & Computer Engineering, College of Engineering, University of Tehran, 1 ...;Wireless Multimedia Communications Laboratory, Center of Excellence on Applied Electromagnetic Systems, School of Electrical & Computer Engineering, College of Engineering, University of Tehran, 1 ...;Wireless Multimedia Communications Laboratory, Center of Excellence on Applied Electromagnetic Systems, School of Electrical & Computer Engineering, College of Engineering, University of Tehran, 1 ...
Venue:
Signal Processing
Year:
2011

Citing 11
Cited 0

Compression with Side Information Using Turbo Codes

DCC '02 Proceedings of the Data Compression Conference
Power efficient data gathering and aggregation in wireless sensor networks

ACM SIGMOD Record
Slepian-Wolf Coding of Multiple M-ary Sources Using LDPC Codes

DCC '04 Proceedings of the Conference on Data Compression
On Maximizing Lifetime of a Sensor Cluster

WOWMOM '05 Proceedings of the Sixth IEEE International Symposium on World of Wireless Mobile and Multimedia Networks
Approaching the Slepian-Wolf boundary using practical channel codes

Signal Processing - Special section: Distributed source coding
Distributed coding of three binary and Gaussian correlated sources using punctured turbo codes

Signal Processing - Special section: Distributed source coding
An energy-efficient adaptive DSC scheme for wireless sensor networks

Signal Processing
Cross-layer multirate interaction with distributed source coding in wireless sensor networks

IEEE Transactions on Wireless Communications
Distributed source coding using syndromes (DISCUS): design and construction

IEEE Transactions on Information Theory
Networked Slepian-Wolf: theory, algorithms, and scaling laws

IEEE Transactions on Information Theory
A survey on sensor networks

IEEE Communications Magazine

Quantified Score

Hi-index	0.08

Visualization

Abstract

This paper addresses the problem of efficient data gathering in wireless sensor networks with a complexity constrained data gathering node. Due to the complexity constraint, the data gathering node employs an asymmetric DSC that (de)compresses the data of a given node exploiting its dependency with a limited number of other nodes. This is characterized in a DSC rate allocation structure that is referred to as limited-order DSC. Within this structure, we investigate the problem of rate allocation for the nodes to maximize the network lifetime. To this end, an algorithm is proposed that is proven optimal with polynomial complexity in terms of number of network nodes. Numerical results demonstrate that the algorithm, even with limited complexity, allows for exploiting most of the achievable compression gain.