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

Slides:



Advertisements
Similar presentations
Chapter 4 Partition I. Covering and Dominating.
Advertisements

Using Cramer-Rao-Lower-Bound to Reduce Complexity of Localization in Wireless Sensor Networks Dominik Lieckfeldt, Dirk Timmermann Department of Computer.
1 Broadband System Laboratory Advisor : Prof. Chin-Liang Wang Presented by Yih-Shyh Chiou August 8, 2005 後 卓 越 計 畫 進 度 報 告後 卓 越 計 畫 進 度 報 告.
Iowa State University Department of Computer Science Software Engineering Laboratory Compromising Location Privacy in Wireless Networks Using Sensors with.
Computer Networks Group Universität Paderborn Ad hoc and Sensor Networks Chapter 9: Localization & positioning Holger Karl.
My first aperosentation 9/6/2008 Marios Karagiannis.
後卓越進度報告 蔡育仁老師實驗室 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.
1 Mobility-assisted Spatiotemporal Detection in Wireless Sensor Networks Guoliang Xing 1 ; JianpingWang 1 ; Ke Shen 3 ; Qingfeng Huang 2 ; Xiaohua Jia.
1 後卓越計畫進度報告 曾煜棋老師實驗室. 2 Problem Statement Event-driven Sensor Networks Exploiting the spatial correlation of sensor data Designing a specific MAC protocol.
A Beacon-Less Location Discovery Scheme for Wireless Sensor Networks Lei Fang (Syracuse) Wenliang (Kevin) Du (Syracuse) Peng Ning (North Carolina State)
後卓越進度報告 蔡育仁老師實驗室 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.
Data Fusion Improves the Coverage of Wireless Sensor Networks Guoliang Xing 1, Rui Tan 2, Benyuan Liu 3, Jianping Wang 2, Xiaohua Jia 2,Chih-wei Yi 4 1.
1 University of Freiburg Computer Networks and Telematics Prof. Christian Schindelhauer Wireless Sensor Networks 16th Lecture Christian Schindelhauer.
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.
後卓越計畫進度報告 清華大學 許健平教授 淡江大學 張志勇教授 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)
Indoor Location System based on 戴毓廷 吳信賢 許碩仁.
後卓越進度報告 蔡育仁老師實驗室 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.
1 University of Freiburg Computer Networks and Telematics Prof. Christian Schindelhauer Wireless Sensor Networks 17th Lecture Christian Schindelhauer.
Novel Self-Configurable Positioning Technique for Multihop Wireless Networks Authors : Hongyi Wu Chong Wang Nian-Feng Tzeng IEEE/ACM TRANSACTIONS ON NETWORKING,
Scalable Information-Driven Sensor Querying and Routing for ad hoc Heterogeneous Sensor Networks Maurice Chu, Horst Haussecker and Feng Zhao Xerox Palo.
後卓越進度報告 蔡育仁老師實驗室 2006/09/04. Distribute Source Coding in WSNs Distributed source coding is a data compression technique to reduce the redundancy without.
後卓越進度報告 蔡育仁老師實驗室 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.
Department of Computer Engineering Koc University, Istanbul, Turkey
後卓越進度報告 蔡育仁老師實驗室 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.
Vectors: planes. The plane Normal equation of the plane.
CRANE Project Wireless Networking Demonstration. a)Single-hop transmission b)Multi-hop transmission with a mobile relay node.
Indoor Localization Carick Wienke Advisor: Dr. Nicholas Kirsch University of New Hampshire ECE 791H Using a Modern Smartphone.
Sensor Positioning in Wireless Ad-hoc Sensor Networks Using Multidimensional Scaling Xiang Ji and Hongyuan Zha Dept. of Computer Science and Engineering,
Localization With Mobile Anchor Points in Wireless Sensor Networks
Solving the Indoor SLAM Problem for a Low-Cost Robot Using Sensor Data Fusion and Autonomous Feature-Based Exploration PhD Student: Prof. MSc. Luciano.
Dynamic Fine-Grained Localization in Ad-Hoc Networks of Sensors Weikuan Yu Dept. of Computer and Info. Sci. The Ohio State University.
Detection, Classification and Tracking in a Distributed Wireless Sensor Network Presenter: Hui Cao.
A new Ad Hoc Positioning System 컴퓨터 공학과 오영준.
Probabilistic Coverage in Wireless Sensor Networks Authors : Nadeem Ahmed, Salil S. Kanhere, Sanjay Jha Presenter : Hyeon, Seung-Il.
A Passive Approach to Sensor Network Localization Rahul Biswas and Sebastian Thrun International Conference on Intelligent Robots and Systems 2004 Presented.
Performance Study of Localization Techniques in Zigbee Wireless Sensor Networks Ray Holguin Electrical Engineering Major Dr. Hong Huang Advisor.
Privacy Protection in Social Networks Instructor: Assoc. Prof. Dr. DANG Tran Khanh Present : Bui Tien Duc Lam Van Dai Nguyen Viet Dang.
An Efficient Localization Algorithm Focusing on Stop-and-Go Behavior of Mobile Nodes IEEE PerCom 2011 Takamasa Higuchi, Sae Fujii, Hirozumi Yamaguchi and.
4.5A Find and Use Slopes of Lines. Recall: The slope of a non-vertical line is the ratio of vertical change (rise) to horizontal change (run) between.
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.
後卓越計畫 進度報告 楊舜仁老師實驗室 Outline  Introduction  SIP based mobile QoS model  MH registers the SIP based service  MH initiates the SIP based.
Wireless Sensor Networks M Homework #1. Part 1 Consider two sensor devices (one transmitter and one receiver) IEEE standard- compliant. Assume.
Ecolocation: A Sequence Based Technique for RF Localization in Wireless Sensor Networks Kiran Yedavaliy*, Bhaskar Krishnamachariy*, Sharmila Ravulaz**
Cooperative Location-Sensing for Wireless Networks Charalampos Fretzagias and Maria Papadopouli Department of Computer Science University of North Carolina.
後卓越計畫進度報告 中央大學許健平教授 淡江大學張志勇教授 94/06/05 Obstacle-Free Routing for WSNs.
Secure positioning in Wireless Networks Srdjan Capkun, Jean-Pierre Hubaux IEEE Journal on Selected area in Communication Jeon, Seung.
Density-Aware Hop-Count Localization (DHL) in Wireless Sensor Networks with Variable Density Sau Yee Wong 1,2, Joo Chee Lim 1, SV Rao 1, Winston KG Seah.
後卓越計畫進度報告 王晉良老師實驗室 2007/8/13. 2 Positioning in Sensor Networks Suppose there are N sensors the (known) location of sensor i. Let be the position of the.
Localization by TDOA ©Thomas Haenselmann – Department of Computer Science IV – University of Mannheim Lecture on Sensor Networks Historical Development.
Under Guidance- Internal Guide- Ms. Shruti T.V
Jointly Positioning Multiple Users in Aid of User-to-User Distances Dr
後卓越計畫進度報告 陳志成教授實驗室 2008/01/06.
6.4 Global Positioning of Nodes
Localization with witnesses
Lecture 13 review Explain how distance vector algorithm works.
Attack-Resistant Location Estimation in Sensor Networks
The Circle x2+y2+2gx+2fy+c = 0 (x-a)2 + (y-b)2 = r2 x2 + y2 = r2
Wireless Mesh Networks
Presentation transcript:

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

2 RSS-Ratio Technique  The RSS have been popular modeled by a log- normal model: where P i : received power at sensor from beacon i (in dB);

3 RSS-Ratio Technique  Assume that a sensor node can receive signal from 3 beacons - VB1, VB2, VB3. The RSS will be RSS1, RSS2, RSS3. Assume that RSS1 > RSS3 > RSS2.  VB1, VB2, VB3 know their position. The distance between VB1 and VB2 is h, between VB1 and VB3 is s  Step 1: On VB1_VB2, choose the point D 12 which satisfy Similarly, choose D 13 on VB1_VB3  Step 2: From D 12 and D 13, sketch two perpendicular lines d 12, d 13. The intersection of this two lines is the first-estimation position C(x e,y e )..

4 RSS-Ratio Technique C(x e,y e ): x e =x VB1 +s/(a 13 +1); y e =y VB1 +h/(a 12 +1) (a 12 >a 13 ) C(x e,y e ): x e =x VB1 -s/(a 13 -1); y e =y VB1 +h/(a 12 +1) (a 12 <a 13 ) a 12h is the ratio between the distance from first- estimation position and VB2, VB1 a 13h is the ratio between the distance from first- estimation position and VB3, VB1 Clearly that a 12h < a 12org, a 13h < a 13org

5 RSS-Ratio Technique l 12 h-l 12 l 13 s - l 13 VB1 VB2 VB3 h Real position first-estimation position final-estimation position d12 d13 D 12 D 13 Estimation process

6 RSS-Ratio Technique  Step 3: Estimation Process – A half algorithm Define Ac: Accuracy Coefficient (e.g. Ac=0.05) If a 12h < a 12org - Ac  a 12h := a 12h + (a 12org - a 12h )/2 If a 13h < a 12org - Ac  a 13h := a 13h + (a 13org - a 13h )/2 C’(x e,y e ): x e =x VB1 +s/(a 13h +1); y e =y VB1 +h/(a 12h +1) (a 12org >a 13org ) C’(x e,y e ): x e =x VB1 -s/(a 13h -1); y e =y VB1 +h/(a 12h +1) (a 12org <a 13org ) Final-estimation position will have a 12org – a 12h <= Ac a 13org – a 13h <= Ac