1 / 12

Location Estimation in Wireless Sensor Networks

This report discusses location estimation algorithms for wireless sensor networks, including range-based and range-free schemes, as well as the distributed location estimation algorithm. It also explores strategies for reducing the estimation range and computation complexity. The article provides insights into how to cut the estimation range and the slope of line segments in real network environments.

ffletcher
Download Presentation

Location Estimation in Wireless Sensor Networks

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. 後卓越計畫進度 中央大學 許健平 教授 淡江大學 張志勇 教授 報告 張育嘉

  2. Location Estimation for Wireless Sensor Networks • Location estimation algorithms can be categorized as • Range-based schemes • TOA, TDOA, AOA, RSSI • Range-free schemes • DV-based scheme • Convex Position Estimation (CPE)

  3. Convex Position Estimation (CPE)

  4. Distributed Location Estimation Algorithm • A few nodes have known position – equipped with GPS or placed deliberately (Beacon node) • The remainder nodes estimate position from knowledge about communication links • The beacon node has the ability of modifying the power level

  5. O4 (x4,y4) P O2 (x2,y2) r O2 (x2,y2) O2 (x2,y2) O2 (x2,y2) O1 (x1,y1) O1 (x1,y1) O1 (x1,y1) Ｑ O3 (x3,y3) O1 (x1,y1) O3 (x3,y3) O3 (x3,y3) Distributed Location Estimation Algorithm

  6. O4 (x4,y4) O4 (x4,y4) O2 (x2,y2) O2 (x2,y2) O1 (x1,y1) O3 (x3,y3) O1 (x1,y1) O3 (x3,y3) Reduce the Range of ER • If a normal node have farther neighbor beacon, the ER can be reduced to smaller one

  7. Reduce the ER: Rule 1 • Rule 1: The cut point is based on the intersection point of circle and the borders of estimative rectangle

  8. Reduce the ER: Rule 2 • Rule 2: The cut point is based on the midpoint of intersection arc

  9. Reduce the Computation Complexity • We need to use some trigonometric functions, such as sin, cos, asin and acos to find the midpoint of an arc • A line segment is used to instead of the arc

  10. How to Cut the ER? • We need to define complete rules to decide what border must be cut (b) (c) (a)

  11. Slope of Line Segment • We can divide the slope range of a line segment into four regions as the figure show. tan 112.5° = -2.4142 tan 67.5° = 2.4142 tan 22.5° = 0.4142 tan -22.5° = -0.4142 tan -67.5° = -2.4142

  12. Real networks environment

More Related