Sciweavers

279 search results - page 27 / 56
» Randomized k-Coverage Algorithms For Dense Sensor Networks
Sort
View
ICUMT
2009
13 years 5 months ago
Free-CLASH - improved localization-free clustering in large wireless sensor networks
This paper investigates topology management of large wireless sensor networks. Due to their random deployment, nodes have to organize themselves as energy efficient as possible to ...
Jakob Salzmann, Ralf Behnke, Jiaxi You, Dirk Timme...
ADHOC
2006
116views more  ADHOC 2006»
13 years 7 months ago
Efficient clustering algorithms for self-organizing wireless sensor networks
Self-organization of wireless sensor networks, which involves network decomposition into connected clusters, is a challenging task because of the limited bandwidth and energy reso...
Rajesh Krishnan, David Starobinski
SECON
2008
IEEE
14 years 1 months ago
On Distributed Optimization Using Peer-to-Peer Communications in Wireless Sensor Networks
—We describe and evaluate a suite of distributed and computationally efficient algorithms for solving a class of convex optimization problems in wireless sensor networks. The pr...
Björn Johansson, Cesare M. Carretti, Mikael J...
IPSN
2005
Springer
14 years 1 months ago
Ecolocation: a sequence based technique for RF localization in wireless sensor networks
Abstract— In this paper we present a novel sequence-based RF localization algorithm called Ecolocation. Our algorithm determines the location of unknown nodes by examining the or...
Kiran Yedavalli, Bhaskar Krishnamachari, Sharmila ...
CN
2006
145views more  CN 2006»
13 years 7 months ago
Understanding optimal data gathering in the energy and latency domains of a wireless sensor network
The problem of optimal data gathering in wireless sensor networks (WSNs) is addressed by means of optimization techniques. The goal of this work is to lay the foundations to devel...
Ugo Monaco, Francesca Cuomo, Tommaso Melodia, Fabi...