1 / 7

後卓越進度報告

後卓越進度報告. 蔡育仁老師實驗室 2006/12/06. Distributed source coding (DSC) is a data compression technique to reduce the redundancy without direct communication among sensor nodes. Sensors are encoders to individually encode their received information related to a single event.

mathewa
Download Presentation

後卓越進度報告

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. 後卓越進度報告 蔡育仁老師實驗室 2006/12/06

  2. Distributed source coding (DSC) is a data compression technique to reduce the redundancy without direct communication among sensor nodes. Sensors are encoders to individually encode their received information related to a single event. E.g., Slepian-Wolf method is a widely used distributed source coding algorithm. : received signal … … … : Sensor Decoding Order : Sink Distribute Source Coding (DSC) in WSNs

  3. DSC with Random Access — Assumptions • Performance of a DSC scheme in a slotted ALOHA WSN has been investigated. • Consider a cluster with Nsensors and a sink. Node itransmit a packet in a slot with probability Pi. • If the packet of node i corresponding to an event is received successfully, this node will not transmit other packets for this event again. • The packet of node i can be reconstructed if the packet of node 1 to node i–1 was received successfully.

  4. G=1.5 1 0.9 0.8 0.7 0.6 Success rate Simulation Results Numerical Results 0.5 0.4 Scenario I Scenario II Scenario III Scenario IV 0.3 0.2 0.1 0 0 20 60 100 120 40 80 time slot Performance Evaluation

  5. G=1.5 6 5 4 Simulation Results Numerical Results 3 the std of number of reconstruction packets Scenario I Scenario II Scenario III Scenario IV 2 1 0 150 0 50 100 200 time slot Performance Evaluation

  6. 90 β= 0 (Equal Prob.) 80 β= 0.01 2-step type-I 2-step type-II 70 2-step type-III 2-step type-IV 60 50 40 30 20 10 0 0 2 4 6 8 10 12 14 Performance Evaluation Average Delay (Slots) Received Message Number of Interest

  7. DSC with Random Access — Future Work • Adaptively adjust to improve the system performance. • Extend to multicluster case with unknown cluster member.

More Related