Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
24,091
Source Localization and
"... Distributed sensor networks have been proposed for a wide range of applications. The main purpose of a sensor network is to monitor an area, including detecting, identifying, localizing, and tracking one or more objects of interest. These networks may be used by the military in surveillance, reconna ..."
Abstract
- Add to MetaCart
for the collaborative processing of wideband acoustic and seismic signals for source localization and beamforming in an energy-constrained distributed sensor network. The purpose of this article is to provide an overview of these issues.
Source Localization
- Audio Signal Processing for Next Generation Multimedia Communication Systems
, 2004
"... In this paper, we investigate the consistency of extended Kalman filter (EKF)-based cooperative localization (CL) from the perspective of observability. We analytically show that the error-state system model employed in the standard EKF-based CL always has an observable subspace of higher dimension ..."
Abstract
-
Cited by 3 (0 self)
- Add to MetaCart
In this paper, we investigate the consistency of extended Kalman filter (EKF)-based cooperative localization (CL) from the perspective of observability. We analytically show that the error-state system model employed in the standard EKF-based CL always has an observable subspace of higher dimension
A Sparse Signal Reconstruction Perspective for Source Localization With Sensor Arrays
, 2005
"... We present a source localization method based on a sparse representation of sensor measurements with an overcomplete basis composed of samples from the array manifold. We enforce sparsity by imposing penalties based on the 1-norm. A number of recent theoretical results on sparsifying properties of ..."
Abstract
-
Cited by 231 (6 self)
- Add to MetaCart
We present a source localization method based on a sparse representation of sensor measurements with an overcomplete basis composed of samples from the array manifold. We enforce sparsity by imposing penalties based on the 1-norm. A number of recent theoretical results on sparsifying properties
Distributed Odor Source Localization
- IEEE Sensors
, 2002
"... This paper presents an investigation of odor localization by groups of autonomous mobile robots. First, we describe a distributed algorithm by which groups of agents can solve the full odor localization task. Next, we establish that conducting polymer-based odor sensors possess the combination of sp ..."
Abstract
-
Cited by 91 (14 self)
- Add to MetaCart
of speed and sensitivity necessary to enable real world odor plume tracing, and we demonstrate that simple local position, odor, and flow information tightly coupled with robot behavior is sufficient to allow a robot to localize the source of an odor plume. Finally, we show that elementary communication
Decentralized source localization and tracking
- In Proc. of ICASSP 2004
"... This paper describes a new approach to the source localization and tracking problem in wireless sensor networks. A fast, easy-toimplement algorithm for localizing a source using received signal strength measurements is presented. The algorithm is based on incremental subgradient optimization methods ..."
Abstract
-
Cited by 41 (3 self)
- Add to MetaCart
This paper describes a new approach to the source localization and tracking problem in wireless sensor networks. A fast, easy-toimplement algorithm for localizing a source using received signal strength measurements is presented. The algorithm is based on incremental subgradient optimization
EEG Source Localization
"... Investigation of brain tissue segmentation error and its effect on EEG source localization This document has been downloaded from Chalmers Publication Library (CPL). It is the author´s version of a work that was accepted for publication in: ..."
Abstract
- Add to MetaCart
Investigation of brain tissue segmentation error and its effect on EEG source localization This document has been downloaded from Chalmers Publication Library (CPL). It is the author´s version of a work that was accepted for publication in:
Cooperative strategies and capacity theorems for relay networks
- IEEE TRANS. INFORM. THEORY
, 2005
"... Coding strategies that exploit node cooperation are developed for relay networks. Two basic schemes are studied: the relays decode-and-forward the source message to the destination, or they compress-and-forward their channel outputs to the destination. The decode-and-forward scheme is a variant of ..."
Abstract
-
Cited by 739 (19 self)
- Add to MetaCart
outputs and the destination’s channel output. The strategies are applied to wireless channels, and it is shown that decode-and-forward achieves the ergodic capacity with phase fading if phase information is available only locally, and if the relays are near the source node. The ergodic capacity coincides
GPSR: Greedy perimeter stateless routing for wireless networks
- MOBICOM
, 2000
"... We present Greedy Perimeter Stateless Routing (GPSR), a novel routing protocol for wireless datagram networks that uses the positions of touters and a packer's destination to make packet forwarding decisions. GPSR makes greedy forwarding decisions using only information about a router's i ..."
Abstract
-
Cited by 2290 (8 self)
- Add to MetaCart
's immediate neighbors in the network topology. When a packet reaches a region where greedy forwarding is impossible, the algorithm recovers by routing around the perimeter of the region. By keeping state only about the local topology, GPSR scales better in per-router state than shortest-path and ad
Capacity of Ad Hoc Wireless Networks
"... Early simulation experience with wireless ad hoc networks suggests that their capacity can be surprisingly low, due to the requirement that nodes forward each others’ packets. The achievable capacity depends on network size, traffic patterns, and detailed local radio interactions. This paper examine ..."
Abstract
-
Cited by 636 (14 self)
- Add to MetaCart
Early simulation experience with wireless ad hoc networks suggests that their capacity can be surprisingly low, due to the requirement that nodes forward each others’ packets. The achievable capacity depends on network size, traffic patterns, and detailed local radio interactions. This paper
Results 1 - 10
of
24,091
