Sciweavers

155 search results - page 6 / 31
» Formal Theory of Noisy Sensor Network Localization
Sort
View
FOCS
2008
IEEE
14 years 2 months ago
Lower Bounds for Noisy Wireless Networks using Sampling Algorithms
We show a tight lower bound of Ω(N log log N) on the number of transmissions required to compute several functions (including the parity function and the majority function) in a...
Chinmoy Dutta, Jaikumar Radhakrishnan
MOBIHOC
2005
ACM
14 years 7 months ago
Localization and routing in sensor networks by local angle information
Location information is very useful in the design of sensor network infrastructures. In this paper, we study the anchor-free 2D localization problem by using local angle measureme...
Jehoshua Bruck, Jie Gao, Anxiao Jiang
TON
2010
109views more  TON 2010»
13 years 5 months ago
Rendered path: range-free localization in anisotropic sensor networks with holes
Sensor positioning is a crucial part of many location-dependent applications that utilize wireless sensor networks (WSNs). Current localization approaches can be divided into two ...
Mo Li, Yunhao Liu
IWCMC
2006
ACM
14 years 1 months ago
Distributed obstacle localization in large wireless sensor networks
Obstacles are but pleasing for many aspects of large realworld sensor networks. Among other things, the presence of obstacles distort the sensor node localization process and migh...
Frank Reichenbach, Ralf Salomon, Dirk Timmermann
ICMLA
2009
13 years 5 months ago
Learning Parameters for Relational Probabilistic Models with Noisy-Or Combining Rule
Languages that combine predicate logic with probabilities are needed to succinctly represent knowledge in many real-world domains. We consider a formalism based on universally qua...
Sriraam Natarajan, Prasad Tadepalli, Gautam Kunapu...