Sensor Network Localization - Repost from Jon Dattorro
Heuristic solution to a sensor-network localization problem, proposed by Carter & Jin, is limited to two Euclidean dimensions and applies semidefinite programming (SDP) to little subproblems. A large network is partitioned into smaller subnetworks (as small as one sensor) and then semidefinite programming and heuristics called SPASELOC are applied to localize each and every partition by two-dimensional distance geometry. Their partitioning procedure is one-pass, yet termed iterative; a term applicable only in so far as adjoining partitions can share localized sensors and anchors (absolute sensor positions known
a priori). But there is no iteration on the entire network, hence the term "iterative" is perhaps inappropriate. As partitions are selected based on "rule sets" (heuristics, not geographics), they also term the partitioning adaptive. But no adaptation actually occurs once a partition has been determined.
Get updates with RSS
Be the first to know about new products and free stuff from IconBuffet. Subscribe to our RSS feed:
Find work or post a listing at Authentic Jobs.
