Sciweavers

999 search results - page 171 / 200
» Localization for anisotropic sensor networks
Sort
View
SODA
2008
ACM
100views Algorithms» more  SODA 2008»
13 years 9 months ago
A tight lower bound for parity in noisy communication networks
We show a tight lower bound of (N log log N) on the number of transmission required to compute the parity of N bits (with constant error) in a network of N randomly placed sensors...
Chinmoy Dutta, Yashodhan Kanoria, D. Manjunath, Ja...
34
Voted
WSTFEUS
2003
IEEE
14 years 1 months ago
DOLPHIN: An Autonomous Indoor Positioning System in Ubiquitous Computing Environment
Determining physical location of indoor objects is one of the key issues in development of context-aware applications in ubiquitous computing environment. This is mainly because c...
Yasuhiro Fukuju, Masateru Minami, Hiroyuki Morikaw...
GLOBECOM
2009
IEEE
14 years 2 months ago
Fusion and Diversity Trade-Offs in Cooperative Estimation over Fading Channels
—In this paper we consider a network of distributed sensors that are trying to measure a parameter of interest cooperatively, by exchanging their acquired information repeatedly ...
Mehrzad Malmirchegini, Yasamin Mostofi
SENSYS
2006
ACM
14 years 1 months ago
Target tracking with binary proximity sensors: fundamental limits, minimal descriptions, and algorithms
We explore fundamental performance limits of tracking a target in a two-dimensional field of binary proximity sensors, and design algorithms that attain those limits. In particul...
Nisheeth Shrivastava, Raghuraman Mudumbai, Upamany...
TWC
2010
13 years 2 months ago
Distributed consensus-based demodulation: algorithms and error analysis
This paper deals with distributed demodulation of space-time transmissions of a common message from a multiantenna access point (AP) to a wireless sensor network. Based on local me...
Hao Zhu, Alfonso Cano, Georgios B. Giannakis