Sciweavers

528 search results - page 23 / 106
» Approximation algorithm for minimal convergecast time proble...
Sort
View
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...
ALGOSENSORS
2006
Springer
13 years 11 months ago
Self-deployment Algorithms for Mobile Sensors on a Ring
Abstract. We consider the self-deployment problem in a ring for a network of identical sensors: starting from some initial random placement in the ring, the sensors in the network ...
Paola Flocchini, Giuseppe Prencipe, Nicola Santoro
DIALM
2004
ACM
117views Algorithms» more  DIALM 2004»
13 years 11 months ago
A resource--efficient time estimation for wireless sensor networks
We study the problem of providing a sensor node with an accurate estimate of the current time, from a novel prospective which is complementary to the well
Daniela Tulone
ESA
2007
Springer
140views Algorithms» more  ESA 2007»
14 years 1 months ago
On Minimum Power Connectivity Problems
Given a (directed or undirected) graph with edge costs, the power of a node is the maximum cost of an edge leaving it, and the power of the graph is the sum of the powers of its n...
Yuval Lando, Zeev Nutov
ICASSP
2011
IEEE
12 years 11 months ago
Predictive modeling of the spatiotemporal evolution of an environmental hazard and its sensor network implementation
Predicting accurately the spatiotemporal evolution of a diffusive environmental hazard is of paramount importance for its effective containment. We approximate the front line of a...
Dimitris V. Manatakis, Elias S. Manolakos