Abstract
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- <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">k</i> scheduler that schedules a sensor to transmit for <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">k</i> consecutive code-letters before switching to a new sensor. The random coding exponent is derived as a function of <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">k</i> , and it is shown that there is an optimal <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">k</i> 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 <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">k</i> of the stay- <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">k</i> scheduler for LDPC codes can be inferred from that for the random coding exponent.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
