Exploring distributed and adaptive compression in cluster-based sensor routing

Hend Alqamzi, Jing Li

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

Distributed compression is appealing to sensor networks due to its ability to compress out the redundancy within individual sources as well as across geographically-separated but content-correlated sources without explicit inter-source communication. This paper investigates how adaptive distributed compression can be efficiently integrated with the practical cluster-based sensor architecture in general and the low-energy adaptive clustering hierarchy (LEACH) protocol in particular. The goal is to exploit the power of distributed compression while keeping the operational overhead minimal. Using an adaptive scheme based on rate-compatible punctured convolutional codes, we show that an additional energy reduction of 20% - 41% is achievable compared to conventional compression without modifying the routing protocol or complicating the system architecture.

Original languageEnglish
Title of host publication2005 International Conference on Wirelessand Optical Communications Networks
Pages530-535
Number of pages6
Publication statusPublished - 2005
Event2005 International Conference on Wirelessand Optical Communications Networks - Dubai, United Arab Emirates
Duration: Mar 6 2005Mar 8 2005

Publication series

Name2005 International Conference on Wireless and Optical Communications Networks

Other

Other2005 International Conference on Wirelessand Optical Communications Networks
Country/TerritoryUnited Arab Emirates
CityDubai
Period3/6/053/8/05

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint

Dive into the research topics of 'Exploring distributed and adaptive compression in cluster-based sensor routing'. Together they form a unique fingerprint.

Cite this