Class7-Joint_Routing_And_Compression

Class7-Joint_Routing_And_Compression - Joint Routing and...

Info iconThis preview shows pages 1–9. Sign up to view the full content.

View Full Document Right Arrow Icon
1 Joint Routing and Compression in Wireless Sensor Networks Bhaskar Krishnamachari Autonomous Networks Research Group Department of Electrical Engineering-Systems USC Viterbi School of Engineering http://ceng.usc.edu/~anrg Joint work with Sundeep Pattem, Ramesh Govindan Antonio Ortega, Alex Ciancio, Sungwon Lee
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
2 Great Barrier Reef, Australia 2600 km over an area of about 344000 sqkm, 3000 individual reefs, 900 islands A disaster in the making: Coral Bleaching, caused by climate change
Background image of page 2
Collaborating with the Australian Institute of Marine Sciences to deploy a 50-100 node sensor network Goal: Monitor temperature and water quality to identify conditions that affect coral health over several months Research Focus: Design and analyze routing and compression algorithms for energy efficient operation A real world test-bed
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Outline Theoretical analysis of cluster-based joint routing and compression in sensor networks Practical wavelet-based joint routing and compression in sensor networks Compressive sensing in sensor networks 4
Background image of page 4
5 1. Impact of Spatial Correlation on Routing with Compression Pattem, Krishnamachari, Govindan, “Impact of Spatial Correlation on Routing with Compression in Wireless Sensor Networks,” IPSN 2004 . [Best Paper Award], TOSN journal version under review.
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
6 Routing + Compression Strategies Routing Driven Compression: route along shortest paths to sink, compress wherever paths happen to overlap Compression Driven Routing: Route to maximize compression, though this may incur longer paths Distributed Source Coding (ideal): perform distributed compression at sources, and route along shortest paths. If we ignore costs of learning correlation, this provides an idealized lower bound.
Background image of page 6
7 Comparison of Basic Strategies
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
8 Clustering First consider the toy model: linear set of n sources in a square grid, at a distance D away from the sink. Data within a cluster of s nodes is
Background image of page 8
Image of page 9
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 12/21/2010 for the course EE 652 taught by Professor Bhaskarkrishnamachari during the Fall '07 term at USC.

Page1 / 32

Class7-Joint_Routing_And_Compression - Joint Routing and...

This preview shows document pages 1 - 9. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online