Sciweavers

999 search results - page 167 / 200
» Localization for anisotropic sensor networks
Sort
View

Presentation
945views
12 years 1 months ago
A Decentralized Method for Maximizing k-coverage Lifetime in WSNs
In this paper, we propose a decentralized method for maximizing lifetime of data collection wireless sensor networks (WSNs) by making minimal number of nodes operate and putting ot...
IPSN
2005
Springer
14 years 1 months ago
A family of distributed space-time trellis codes with asynchronous cooperative diversity
—In current cooperative communication schemes, to achieve cooperative diversity, synchronization between terminals is usually assumed, which may not be practical since each termi...
Yabo Li, Xiang-Gen Xia
ALGOSENSORS
2010
Springer
13 years 6 months ago
Self-localization Based on Ambient Signals
We present an approach for the localization of passive nodes in a communication network using ambient radio or sound signals. In our settings the communication nodes have unknown p...
Thomas Janson, Christian Schindelhauer, Johannes W...
EMMCVPR
2003
Springer
14 years 29 days ago
Asymptotic Characterization of Log-Likelihood Maximization Based Algorithms and Applications
The asymptotic distribution of estimates that are based on a sub-optimal search for the maximum of the log-likelihood function is considered. In particular, estimation schemes that...
Doron Blatt, Alfred O. Hero
MOBIHOC
2006
ACM
14 years 7 months ago
DRAND: : distributed randomized TDMA scheduling for wireless ad-hoc networks
This paper presents a distributed implementation of RAND, a randomized time slot scheduling algorithm, called DRAND. DRAND runs in O() time and message complexity where is the max...
Injong Rhee, Ajit Warrier, Jeongki Min, Lisong Xu