Transform-Based Distributed Data Gathering

A general class of unidirectional transforms is presented that can be computed in a distributed manner along an arbitrary routing tree. Additionally, we provide a set of conditions under which these transforms are invertible. These transforms can be computed as data is routed towards the collection...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on signal processing 2010-07, Vol.58 (7), p.3802-3815
Main Authors: Shen, Godwin, Ortega, Antonio
Format: Article
Language:English
Subjects:
Bandwidth
Broadcasting
Computation
Data communication
Data compression
Distributed computing
Energy consumption
Energy measurement
Networks
Routing
Routing (telecommunications)
Sensors
Transforms
Trees
Wavelet transforms
Wireless communication
Wireless sensor networks
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A general class of unidirectional transforms is presented that can be computed in a distributed manner along an arbitrary routing tree. Additionally, we provide a set of conditions under which these transforms are invertible. These transforms can be computed as data is routed towards the collection (or sink) node in the tree and exploit data correlation between nodes in the tree. Moreover, when used in wireless sensor networks, these transforms can also leverage data received at nodes via broadcast wireless communications. Various constructions of unidirectional transforms are also provided for use in data gathering in wireless sensor networks. New wavelet transforms are also proposed which provide significant improvements over existing unidirectional transforms.
ISSN:1053-587X
1941-0476
DOI:10.1109/TSP.2010.2047640