Sciweavers

60 search results - page 6 / 12
» Anchor selection with anchor location uncertainty in wireles...
Sort
View
SIAMDM
2010
149views more  SIAMDM 2010»
13 years 5 months ago
Formal Theory of Noisy Sensor Network Localization
Graph theory has been used to characterize the solvability of the sensor network localization problem. If sensors correspond to vertices and edges correspond to sensor pairs betwee...
Brian D. O. Anderson, Iman Shames, Guoqiang Mao, B...
ICC
2008
IEEE
141views Communications» more  ICC 2008»
14 years 1 months ago
Greedy Hop Distance Routing Using Tree Recovery on Wireless Ad Hoc and Sensor Networks
—Connectivity-based routing protocols use the hop count vector to a group of anchors for packet forwarding. Due to the discrete nature of hop count based coordinates, without an ...
Shao Tao, Akkihebbal L. Ananda, Mun Choon Chan
WOWMOM
2006
ACM
122views Multimedia» more  WOWMOM 2006»
14 years 1 months ago
Multiple-Access Insights from Bounds on Sensor Localization
In this paper, we build on known bounds on localization in sensor networks and provide new insights that can be used in multiple-access design from a localization perspective. Spe...
Swaroop Venkatesh, R. Michael Buehrer
SIGMETRICS
2010
ACM
214views Hardware» more  SIGMETRICS 2010»
14 years 8 days ago
Distributed sensor network localization from local connectivity: performance analysis for the HOP-TERRAIN algorithm
This paper addresses the problem of determining the node locations in ad-hoc sensor networks when only connectivity information is available. In previous work, we showed that the ...
Amin Karbasi, Sewoong Oh
ICASSP
2010
IEEE
13 years 7 months ago
A convex relaxation for approximate maximum-likelihood 2D source localization from range measurements
This paper addresses the problem of locating a single source from noisy range measurements in wireless sensor networks. An approximate solution to the maximum likelihood location ...
Pinar Oguz-Ekim, João Pedro Gomes, Jo&atild...