後卓越進度報告 蔡育仁老師實驗室 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.

Slides:



Advertisements
Similar presentations
Distributed Selection of References for Localization in Wireless Sensor Networks Dominik Lieckfeldt, Jiaxi You, Dirk Timmermann Institute of Applied Microelectronics.
Advertisements

Fundamental Performance Limits in Image Registration By Dirk Robinson and Peyman Milanfar IEEE Transactions on Image Processing Vol. 13, No. 9, 9/2004.
後卓越進度報告 蔡育仁老師實驗室 2007/03/19. Distribute Source Coding (DSC) in WSNs Distributed source coding is a data compression technique to reduce the redundancy.
1 後卓越計畫進度報告 曾煜棋老師實驗室. 2 Problem Statement Event-driven Sensor Networks Exploiting the spatial correlation of sensor data Designing a specific MAC protocol.
Minimax Estimators Dominating the Least-Squares Estimator Zvika Ben-Haim and Yonina C. Eldar Technion - Israel Institute of Technology.
The Mean Square Error (MSE):. Now, Examples: 1) 2)
後卓越進度報告 蔡育仁老師實驗室 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.
Deployment of Surface Gateways for Underwater Wireless Sensor Networks Saleh Ibrahim Advising Committee Prof. Reda Ammar Prof. Jun-Hong Cui Prof. Sanguthevar.
1/7/ 後卓越計畫進度報告 Broadband System Laboratory Advisor : Prof. Chin-Liang Wang Presented by Tran Duc Thang A NEW TECHNIQUE FOR LOCALIZATION IN WIRELESS.
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.
Location Estimation in Sensor Networks Moshe Mishali.
後卓越計畫進度報告 清華大學 許健平教授 淡江大學 張志勇教授 96/08/13. Optimal Deployment rsrs rsrs rsrs AB C Sensing range rsrs.
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.
後卓越計畫進度報告 楊舜仁老師實驗室 Overlapping RA Scheme Reduce the RAU cost caused by the ping-pong effect In overlapping RA scheme, one cell may belong.
Elastic Registration in the Presence of Intensity Variations Source: IEEE Transactions on Medical Imaging, Vol. 22, No. 7, July 2003 Authors: Senthil Periaswamy,
APPROXIMATE EXPRESSIONS FOR THE MEAN AND COVARIANCE OF THE ML ESTIMATIOR FOR ACOUSTIC SOURCE LOCALIZATION Vikas C. Raykar | Ramani Duraiswami Perceptual.
後卓越進度報告 蔡育仁老師實驗室 2006/09/04. Distribute Source Coding in WSNs Distributed source coding is a data compression technique to reduce the redundancy without.
Jana van Greunen - 228a1 Analysis of Localization Algorithms for Sensor Networks Jana van Greunen.
後卓越進度報告 蔡育仁老師實驗室 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.
Optimal binary search trees
後卓越進度報告 蔡育仁老師實驗室 2006/05/01. Implementation — Coverage-preserving Routing (1/2) R1, R2 and R3: disjoint routes to the destination Coverage Metric: R2.
後卓越計畫 — 子計畫四 進度報告 陳文村 校長實驗室 MNET. Lab.2 Group Guiding Services in WSNs Leader tracking Help service Member -recall.
Performance Analysis of Relative Location Estimation for Multihop Wireless Sensor Networks Qicai Shi; Kyperountas, S.; Correal, N.S.; Feng Niu Selected.
Some Results on Source Localization Soura Dasgupta, U of Iowa With: Baris Fidan, Brian Anderson, Shree Divya Chitte and Zhi Ding.
研習報告與討論研習報告與討論 蔡騰寬 中研院生醫所林陽生老師實驗室. Interaction of TCF4 with DP103 and FHL3.
Wireless Body Area Network Case Study: UWB based Human Motion Tracking 1.
ALGEBRA TILES Variables such as ‘x’ and ‘y’ are used to represent an unknown number Algebra tiles are the generally accepted manipulative to help students.
Sniper Localization Using Acoustic Sensors Allison Doren Anne Kitzmiller Allie Lockhart Under the Direction of Dr. Arye Nehorai December 11, 2013 [6]
卓越計劃進度報告 JNDI Java Naming and Directory Interface 網際網路實驗室 報告人 潘燕弘.
On the Construction of Data Aggregation Tree with Minimum Energy Cost in Wireless Sensor Networks: NP-Completeness and Approximation Algorithms National.
Ilmenau University of Technology Communications Research Laboratory 1  A new multi-dimensional model order selection technique called closed- form PARAFAC.
Scalable and Fully Distributed Localization With Mere Connectivity.
Bruno Ribeiro CS69000-DM1 Topics in Data Mining. Bruno Ribeiro  Reviews of next week’s papers due Friday 5pm (Sunday 11:59pm submission closes) ◦ Assignment.
Efficient Deployment Algorithms for Prolonging Network Lifetime and Ensuring Coverage in Wireless Sensor Networks Yong-hwan Kim Korea.
Semi-Blind (SB) Multiple-Input Multiple-Output (MIMO) Channel Estimation Aditya K. Jagannatham DSP MIMO Group, UCSD ArrayComm Presentation.
July 30th, 2004comp.dsp conference1 Frequency Estimation Techniques Peter J. Kootsookos
Challenges and Opportunities Posed by Power Laws in Network Analysis Bruno Ribeiro UMass Amherst MURI REVIEW MEETING Berkeley, 26 th Oct 2011.
5x 4 – 405 = 5(x 4 – 81) = 5(x 2 + 9)(x 2 – 9) = 5(x 2 + 9)(x + 3)(x – 3) by D. Fisher.
Relative Accuracy based Location Estimation in Wireless Ad Hoc Sensor Networks May Wong 1 Demet Aksoy 2 1 Intel, Inc. 2 University of California, Davis.
A Unified Framework for Max -Min and Min-Max Fairness with application
0 IEEE SECON 2004 Estimation Bounds for Localization October 7 th, 2004 Cheng Chang EECS Dept,UC Berkeley Joint work with Prof.
Doc.: IEEE a Submission September 2004 Neiyer Correal, Motorola Inc.Slide 1 Project: IEEE P Working Group for Wireless Personal.
Improved Channel Estimation Based on Parametric Channel Approximation Modeling for OFDM Systems IEEE TRANSATIONS ON BROADCASTING , VOL. 54 NO. 2 JUNE.
G. Giorgetti, ACM MELT 2008 – San Francisco – September 19, 2008 Localization using Signal Strength: TO RANGE OR NOT TO RANGE? Gianni Giorgetti Sandeep.
後卓越計畫 進度報告 楊舜仁老師實驗室 SCTP Multihoming.
Bing Wang, Wei Wei, Hieu Dinh, Wei Zeng, Krishna R. Pattipati (Fellow IEEE) IEEE Transactions on Mobile Computing, March 2012.
Doc.: a Submission September 2004 Z. Sahinoglu, Mitsubishi Electric research LabsSlide 1 A Hybrid TOA/RSS Based Location Estimation Zafer.
Efficient Pairwise Key Establishment Scheme Based on Random Pre-Distribution Keys in Wireless Sensor Networks Source: Lecture Notes in Computer Science,
Yi Jiang MS Thesis 1 Yi Jiang Dept. Of Electrical and Computer Engineering University of Florida, Gainesville, FL 32611, USA Array Signal Processing in.
Geology 6600/7600 Signal Analysis Last time: Linear Systems Uncorrelated additive noise in the output signal, y = v + n, of a SISO system can be estimated.
後卓越計畫 進度報告 楊舜仁老師實驗室 Outline  Introduction  SIP based mobile QoS model  MH registers the SIP based service  MH initiates the SIP based.
On Mobile Sink Node for Target Tracking in Wireless Sensor Networks Thanh Hai Trinh and Hee Yong Youn Pervasive Computing and Communications Workshops(PerComW'07)
BLOCK BASED MOTION ESTIMATION. Road Map Block Based Motion Estimation Algorithms. Procedure Of 3-Step Search Algorithm. 4-Step Search Algorithm. N-Step.
後卓越計畫進度報告 中央大學許健平教授 淡江大學張志勇教授 94/06/05 Obstacle-Free Routing for WSNs.
Sensor Networks Jason Turbyfill 16 February 2005.
Presentation : “ Maximum Likelihood Estimation” Presented By : Jesu Kiran Spurgen Date :
Estimator Properties and Linear Least Squares
A Key Pre-Distribution Scheme Using Deployment Knowledge for Wireless Sensor Networks Zhen Yu & Yong Guan Department of Electrical and Computer Engineering.
後卓越計畫進度報告 陳志成教授實驗室 2008/01/06.
t distribution Suppose Z ~ N(0,1) independent of X ~ χ2(n). Then,
A Hybrid TOA/RSS Based Location Estimation
Self-protection experiment
Table 2. Regression statistics for independent and dependent variables
Presentation transcript:

後卓越進度報告 蔡育仁老師實驗室 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 mean square error of the unbiased estimators. CRLB of location estimations depends on the propagation model and the topology of the sensor network. Propose a step-by-step deployment method to minimize the CRLB in a low complexity manner. MSE of Est. Sensor Location Estimator 1 Estimator 2 CRLB

Step-by-Step Deployment Procedure Let the x- and y-axis location vectors of the deployed nodes is denoted as X, Y. From CRLB, the mean squared error of the estimated location (x,y) has a lower bound given by [1] where are Fisher Information Matrices Given the deployed location vectors X and Y, we want to find the next best deploying position (x*,y*), i.e. X*=[X x*], Y*=[Y y*], to minimize or minimize

Step-by-Step Deployment (100 × 100 unit 2 ) — the 5th Node Sensor Location Avg. CRLB (unit 2 ) Occurs the Minimum CRLB Deployed Locations

Step-by-Step Deployment (100 × 100 unit 2 ) — the 6th Node Sensor Location Avg. CRLB (unit 2 ) 5th Deployed Loc. Deployed Locations Occurs the Minimum CRLB

Step-by-Step Deployment (100 × 100 unit 2 ) — 9 Nodes with Different Initial Conditions (Begin with 4 Nodes) 100 units Avg. CRLB (unit 2 )

Future Works & Reference Apply the minimum estimation error deployment to an irregular deploying area Find the analytical Global Minimum CRLB Location without heuristic search [1] N. Patwari et al., “Relative location estimation in wireless sensor networks,” IEEE Trans. Sig. Proc., vol. 51, pp , Aug. 2003