By Topic

On the Error Exponent and the Use of LDPC Codes for Cooperative Sensor Networks With Misinformed Nodes

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)
Zhiyu Yang ; Marvell Semicond. Inc., Santa Clara ; Lang Tong

The problem of retrieving information by a mobile access point from a sensor network where sensors cooperatively transmit messages using a common codebook is considered. It is assumed that there is a probability that a sensor is misinformed with a wrong message, which complicates the information retrieval process. The access point uses the capacity achieving stay-k scheduler that schedules a sensor to transmit for k consecutive code-letters before switching to a new sensor. The random coding exponent is derived as a function of k, and it is shown that there is an optimal k that gives the largest error exponent. The application of low-definition parity-check (LDPC) codes is considered next. It is shown in simulations that the optimal k of the stay-k scheduler for LDPC codes can be inferred from that for the random coding exponent.

Published in:

Information Theory, IEEE Transactions on  (Volume:53 ,  Issue: 9 )