National Tsing Hua University Institutional Repository:The Efficiency and Delay of Distributed Source Coding in Random Access Sensor Networks
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 54367/62174 (87%)
Visitors : 14538283      Online Users : 67
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTHU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    NTHUR > Research & Development Office > Computer and Communication Research Center  > CCRC Technical Reports  >  The Efficiency and Delay of Distributed Source Coding in Random Access Sensor Networks

    Please use this identifier to cite or link to this item:

    Title: The Efficiency and Delay of Distributed Source Coding in Random Access Sensor Networks
    Authors: Yuh-Ren Tsai
    Yao-Win Hong
    Yan-Yu Liao
    Kai-Jie Yang
    Date: 2007
    Publisher: Institute of Electrical and Electronics Engineers Inc.
    Keywords: Efficiency and Delay
    Distributed Source Coding
    Random Access Sensor Networks
    Abstract: The reliability and delay of Slepian-Wolf distributed source coding (DSC) in sensor networks is analyzed under the random access setting. Consider a network of N sensors that observes correlated information from the environment and sends the local data to a central processor through direct transmission links. Due to the low message rate in sensor networks, we adopt the slotted ALOHA random access protocol where the time is divided into synchronized time slots and each sensor is allowed to access the time slots with independent probabilities. To eliminate the redundancy in the transmitted data, the sensors encode the local messages based on the Slepian-Wolf DSC method. Specifically, we assume that the sensors’ message are encoded with a sequential dependency among each other and, thus, must be decoded one after the other such that the decoding of a particular message is reliant on the successful decoding of allthe messages encoded earlier in the sequence. In this case, the loss of one message may result in the failure of other messages and the delay in the successful decoding of a particular message also varies from sensor to sensor. In this work, we analyze the performance of Slepian-Wolf DSC in random access networks in terms of the rate of successful decoding and the average delay of each message. Specifically, we propose and compare different transmission probability assignments for DSC in the ALOHA network and emphasize the importance of the MAC design.
    Relation Link:
    Appears in Collections:[Computer and Communication Research Center ] CCRC Technical Reports
    [Institute of Communications Engineering] COM Conference Papers
    [Design Technology Center ] DTC Conference Papers

    Files in This Item:

    File Description SizeFormat
    2030137030020.pdf264KbAdobe PDF900View/Open


    SFX Query


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback