By Topic

A study on combined routing and source coding with explicit side information in sensor networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Huiyu Luo ; Dept. of Electr. Eng., California Univ., Los Angeles, CA, USA ; G. Pottie

This paper studies the problem of combining tree routing and data compression with explicit side information in wireless sensor networks. We first present our network flow and data rate model based on the observation that in many practical situations, side information providing the most coding gain comes from a few nearby sensors. An optimization problem is then formulated and shown to be NP hard. It is subsequently cast as a mixed integer program. For our particular model, we examine several approximation algorithms, and compare their performances through simulations. Improvement over shortest path trees, which completely ignore the source correlation, is achieved only by judiciously merging flows of correlated data based on the coding gain information

Published in:

GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.  (Volume:5 )

Date of Conference:

2-2 Dec. 2005