Cart (Loading....) | Create Account
Close category search window
 

Optimal Matching in Wireless 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
$31 $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)
Roumy, A. ; Inst. Nat. de Resherche en Inf. et en au-tomatique, Rennes ; Gesbert, D.

We design a wireless sensor network (WSN) in terms of rate and power allocation in order to send without loss the data gathered by the nodes to a common sink. Correlation between the data and channel impairments dictate the constraints of the optimization problem. We further assume that the WSN uses off-the-shelf compression and channel coding algorithms. More precisely source and channel coding are separated and distributed source coding is performed by pairs of nodes. This raises the problem of optimally matching the nodes. We show that under all these constraints the optimal design (including rate/power allocation and matching) has polynomial complexity (in the number of nodes in the network). A closed form solution is given for the rate/power allocation, and the matching solution is readily interpreted. For noiseless channels, the optimization matches close nodes whereas, for noisy channels, there is a tradeoff between matching close nodes and matching nodes with different distances to the sink. This fact is illustrated by simulations based on empirical measures. We also show that the matching technique provides substantial gains in either storage capacity or power consumption for the WSN with regard to the case where the correlation between the nodes is not used.

Published in:

Selected Topics in Signal Processing, IEEE Journal of  (Volume:1 ,  Issue: 4 )

Date of Publication:

Dec. 2007

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.