後卓越進度報告蔡育仁老師實驗室 2006/09/04. Distribute Source Coding in WSNs Distributed source coding is a data compression technique to reduce the redundancy without.

Slides:

Advertisements

Similar presentations

1 S Digital Communication Systems Advanced Modulation and Random Access Techniques.

Advertisements

Min Song 1, Yanxiao Zhao 1, Jun Wang 1, E. K. Park 2 1 Old Dominion University, USA 2 University of Missouri at Kansas City, USA IEEE ICC 2009 A High Throughput.

Low-Energy Adaptive Clustering Hierarchy 指導老師 : 潘仁義唐健恒.

An Energy Efficient Routing Protocol for Cluster-Based Wireless Sensor Networks Using Ant Colony Optimization Ali-Asghar Salehpour, Babak Mirmobin, Ali.

LOGO Video Packet Selection and Scheduling for Multipath Streaming IEEE TRANSACTIONS ON MULTIMEDIA, VOL. 9, NO. 3, APRIL 2007 Dan Jurca, Student Member,

SUSTAIN: An Adaptive Fault Tolerance Service for Geographically Overlapping Wireless Cyber-Physical Systems Gholam Abbas Angouti Kolucheh, Qi Han

後卓越進度報告蔡育仁老師實驗室 2006/06/05. Step-by-Step Deployment of Location Sensors by Cramér-Rao Lower Bound Cramér-Rao Lower Bound (CRLB) is a lower bound of the.

後卓越進度報告蔡育仁老師實驗室 2007/03/19. Distribute Source Coding (DSC) in WSNs Distributed source coding is a data compression technique to reduce the redundancy.

Compression & Huffman Codes

Network Correlated Data Gathering With Explicit Communication: NP- Completeness and Algorithms R˘azvan Cristescu, Member, IEEE, Baltasar Beferull-Lozano,

1 後卓越計畫進度報告曾煜棋老師實驗室. 2 Problem Statement Event-driven Sensor Networks Exploiting the spatial correlation of sensor data Designing a specific MAC protocol.

An Energy-Efficient Data Storage Scheme for Multi- resolution Query in Wireless Sensor Networks 老師 : 溫志煜學生 : 官其瑩.

1 Data Persistence in Large-scale Sensor Networks with Decentralized Fountain Codes Yunfeng Lin, Ben Liang, Baochun Li INFOCOM 2007.

後卓越進度報告蔡育仁老師實驗室 2006/12/06. Distribute Source Coding (DSC) in WSNs Distributed source coding (DSC) is a data compression technique to reduce the redundancy.

1 後卓越計畫進度報告曾煜棋老師實驗室. 2 A Link-layer Protocol for Event-driven WSNs Joint two subissues Exploiting the spatial correlation of sensor data Designing a.

LLR-based Distributed Detection for Wireless Sensor Networks 後卓越進度報告蔡育仁老師實驗室 2008/01/07.

1/7/ 後卓越計畫進度報告 Broadband System Laboratory Advisor : Prof. Chin-Liang Wang Presented by Tran Duc Thang A NEW TECHNIQUE FOR LOCALIZATION IN WIRELESS.

Wireless & Mobile Networking: Multiple Radio Access Azizol Bin Abdullah (A2.04) Rujukan: Text Book Chapter 6.

1 後卓越計畫進度報告楊舜仁老師實驗室 Objective Investigate the bandwidth management mechanisms for IEEE j networks. The goal of bandwidth management.

後卓越進度報告蔡育仁老師實驗室 2006/11/13. Distribute Source Coding (DSC) in WSNs Distributed source coding (DSC) is a data compression technique to reduce the redundancy.

Slide 1 後卓越計畫進度報告楊舜仁老師實驗室 Slide 2 Motivation l An MBMS source entity shall provide multiple classes of service quality for a single MBMS.

後卓越計畫進度報告清華大學陳文村教授 Outline Completed works Current works Publications.

後卓越進度報告蔡育仁老師實驗室 2007/08/13. DSC with Slotted ALOHA in Clustered WSN We analyze further the clustered WSNs applying  Compression: DSC (sequential encoding/decoding)

後卓越進度報告蔡育仁老師實驗室 2006/07/10. Non-uniform Deployment for Lifetime-based Sensor Networks Propose a non-uniform density for random deployment based on the.

Realistic and Efficient Multi-Channel Communications in Wireless Sensor Networks Author: Yafeng Wu, John A. Stankovic, Tian He, and Shan Lin.

Networked Slepian–Wolf: Theory, Algorithms, and Scaling Laws R˘azvan Cristescu, Member, IEEE, Baltasar Beferull-Lozano, Member, IEEE, Martin Vetterli,

後卓越計畫進度報告楊舜仁老師實驗室 Overlapping RA Scheme Reduce the RAU cost caused by the ping-pong effect In overlapping RA scheme, one cell may belong.

1 Link Layer Message M A B Problem: Given a message M at a node A consisting of several packets, how do you send the packets to a “neighbor” node B –Neighbor:

© 2005, it - instituto de telecomunicações. Todos os direitos reservados. Gerhard Maierbacher Scalable Coding Solutions for Wireless Sensor Networks IT.

後卓越進度報告蔡育仁老師實驗室 2007/06/04. DSC with Slotted ALOHA Random Access Distributed source coding (DSC) We study the effect of MACs on the efficiency (delivery.

後卓越計畫進度報告 (2007/6/4) 中央大學許健平教授淡江大學張志勇教授. Routing with Hexagonal Virtual Coordinate in Wireless Sensor Networks.

1 Mathematical Modeling and Algorithms for Wireless Sensor Networks Bhaskar Krishnamachari Autonomous Networks Research Group Department of Electrical.

後卓越進度報告蔡育仁老師實驗室 2006/05/01. Implementation — Coverage-preserving Routing (1/2) R1, R2 and R3: disjoint routes to the destination Coverage Metric: R2.

How to Turn on The Coding in MANETs Chris Ng, Minkyu Kim, Muriel Medard, Wonsik Kim, Una-May O’Reilly, Varun Aggarwal, Chang Wook Ahn, Michelle Effros.

CSI Uncertainty in A.I. Lecture 201 Basic Information Theory Review Measuring the uncertainty of an event Measuring the uncertainty in a probability.

後卓越計畫 — 子計畫四進度報告陳文村校長實驗室 MNET. Lab.2 Group Guiding Services in WSNs Leader tracking Help service Member -recall.

Talha Naeem Qureshi Joint work with Tauseef Shah and Nadeem Javaid

Variable Bit Rate Video Coding April 18, 2002 (Compressed Video over Networks: Chapter 9)

M-GEAR: Gateway-Based Energy-Aware Multi-Hop Routing Protocol

X1X1 X2X2 Encoding : Bits are transmitting over 2 different independent channels.  Rn bits Correlation channel  (1-R)n bits Wireless channel Code Design:

Wireless Sensor Network Protocols Dr. Monir Hossen ECE, KUET Department of Electronics and Communication Engineering, KUET.

MAC Protocols In Sensor Networks.  MAC allows multiple users to share a common channel.  Conflict-free protocols ensure successful transmission. Channel.

Cross-Layer Optimization in Wireless Networks under Different Packet Delay Metrics Chris T. K. Ng, Muriel Medard, Asuman Ozdaglar Massachusetts Institute.

Andrew Liau, Shahram Yousefi, Senior Member, IEEE, and Il-Min Kim Senior Member, IEEE Binary Soliton-Like Rateless Coding for the Y-Network IEEE TRANSACTIONS.

報告人：林祐沁學生指導教授：童曉儒老師 March 2, Wireless Video Surveillance Server Based on CDMA1x and H.264.

Erasure Coding for Real-Time Streaming Derek Leong and Tracey Ho California Institute of Technology Pasadena, California, USA ISIT

4: DataLink Layer1 Multiple Access Links and Protocols Three types of “links”: r point-to-point (single wire, e.g. PPP, SLIP) r broadcast (shared wire.

A SURVEY OF MAC PROTOCOLS FOR WIRELESS SENSOR NETWORKS

Device-Free Localization Ossi Kaltiokallio Department of Automation and Systems Technology Aalto University School of Science and Technology

A Power Assignment Method for Multi-Sink WSN with Outage Probability Constraints Marcelo E. Pellenz*, Edgard Jamhour*, Manoel C. Penna*, Richard D. Souza.

Maximizing the lifetime of WSN using VBS Yaxiong Zhao and Jie Wu Computer and Information Sciences Temple University.

Dr. Sudharman K. Jayaweera and Amila Kariyapperuma ECE Department University of New Mexico Ankur Sharma Department of ECE Indian Institute of Technology,

5: DataLink Layer 5a-1 Multiple Access protocol. 5: DataLink Layer 5a-2 Multiple Access Links and Protocols Three types of “links”: r point-to-point (single.

Toward a Packet Duplication Control for Opportunistic Routing in WSNs Georgios Z. Papadopoulos, Julien Beaudaux, Antoine Gallais, Periklis Chatzimisios,

A Multi-Channel Cooperative MIMO MAC Protocol for Wireless Sensor Networks(MCCMIMO) MASS 2010.

CS294-9 :: Fall 2003 Joint Source/Channel Coding Ketan Mayer-Patel.

後卓越計畫進度報告楊舜仁老師實驗室 SCTP Multihoming.

بسم الله الرحمن الرحيم My Project Huffman Code. Introduction Introduction Encoding And Decoding Encoding And Decoding Applications Applications Advantages.

Data funneling : routing with aggregation and compression for wireless sensor networks Petrovic, D.; Shah, R.C.; Ramchandran, K.; Rabaey, J. ; SNPA 2003.

“LPCH and UDLPCH: Location-aware Routing Techniques in WSNs”. Y. Khan, N. Javaid, M. J. Khan, Y. Ahmad, M. H. Zubair, S. A. Shah.

Toward Reliable and Efficient Reporting in Wireless Sensor Networks Authors: Fatma Bouabdallah Nizar Bouabdallah Raouf Boutaba.

後卓越計畫進度報告楊舜仁老師實驗室 Outline  Introduction  SIP based mobile QoS model  MH registers the SIP based service  MH initiates the SIP based.

4 Introduction Carrier-sensing Range Network Model Distributed Data Collection Simulation 6 Conclusion 2.

1 Using Network Coding for Dependent Data Broadcasting in a Mobile Environment Chung-Hua Chu, De-Nian Yang and Ming-Syan Chen IEEE GLOBECOM 2007 Reporter.

後卓越計畫進度報告中央大學許健平教授淡江大學張志勇教授 94/06/05 Obstacle-Free Routing for WSNs.

Energy Efficient Data Management in Sensor Networks Sanjay K Madria Web and Wireless Computing Lab (W2C) Department of Computer Science, Missouri University.

An Application-Specific Protocol Architecture for Wireless Microsensor Networks 컴퓨터 공학과 오영준.

AN EFFICIENT TDMA SCHEME WITH DYNAMIC SLOT ASSIGNMENT IN CLUSTERED WIRELESS SENSOR NETWORKS Shafiq U. Hashmi, Jahangir H. Sarker, Hussein T. Mouftah and.

後卓越計畫進度報告陳志成教授實驗室 2008/01/06.

Presentation transcript:

後卓越進度報告蔡育仁老師實驗室 2006/09/04

Distribute Source Coding in WSNs Distributed source coding 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. Slepian-Wolf method is a distributed source coding algorithm. … … … : received signal

Multiple Access in Distributed Source Coding Systems Distributed source codings which require sequential decoding are sensitive to multiple access techniques in WSNs. For example, to resolve information from the data received by the sink node, Slepian-Wolf method requires data to be received in ordered. Multiple access has to be proper designed in WSNs with distributed source coding to minimize the decoding delay or loss due to sequential decoding.

: Sink : Sensor

System Considerations We first consider a WSN with slotted ALOHA. There are N nodes in a cluster. Node i transmit a packet in a slot with probability. 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.

Goal & Further Work We want to find optimal probability P i based on  Minimize the decoding latency  Minimize the decoding loss rate In future work, we will take packet lengths into consideration to allocate the optimum P i for packets with different lengths.