• DocumentCode
    518989
  • Title

    Relay assisted Slepian-Wolf compression to exploit temporal redundancy

  • Author

    Iqbal, Muhammad ; Aziz, Tariq ; Adnan, M. ; Abrar, M.

  • Author_Institution
    Sch. of Inf. & Commun. Eng., Beijing Univ. of Posts & Telecommun., Beijing, China
  • fYear
    2010
  • fDate
    11-13 May 2010
  • Firstpage
    390
  • Lastpage
    392
  • Abstract
    Distributed compression of multiple sources such as the nodes of wireless sensor networks has been focus of research to exploit spatial redundancy of the data being sensed by different sources. In sensor networks data gathered by the sensor nodes is spatially as well as temporally correlated. The scheme proposed in this paper exploits the temporal redundancy of the data gathered by single node by making use of two half-duplex relays. These relays not only serve to extend the transmission range but also provide framework for Slepian-Wolf compression. We have used symmetric Slepian-Wolf compression to achieve equal compression at both relays. We used separate encoding at the relays and joint decoding at the destination. We have used regular low density parity check (LDPC) code having rate ½. Although this scheme does not provide any diversity gain but this is useful to achieve high data rate and reduces transmission power requirements.
  • Keywords
    parity check codes; wireless sensor networks; LDPC codes; decoding; distributed compression; encoding; low density parity check code; relay-assisted Slepian-Wolf compression; temporal redundancy; wireless sensor networks; Data engineering; Decoding; Diversity methods; Parity check codes; Power system relaying; Relays; Source coding; Transmitters; Wireless communication; Wireless sensor networks; Distributed compression; Slepian-Wolf theorem; low density parity check;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    New Trends in Information Science and Service Science (NISS), 2010 4th International Conference on
  • Conference_Location
    Gyeongju
  • Print_ISBN
    978-1-4244-6982-6
  • Electronic_ISBN
    978-89-88678-17-6
  • Type

    conf

  • Filename
    5488586