Sciweavers

460 search results - page 32 / 92
» Bounding the locality of distributed routing algorithms
Sort
View
IPCCC
2005
IEEE
14 years 2 months ago
Dynamic localization control for mobile sensor networks
Localization is a fundamental operation in mobile and self-configuring networks such as sensor networks and mobile ad hoc networks. For example, sensor location is often critical...
Sameer Tilak, Vinay Kolar, Nael B. Abu-Ghazaleh, K...
AUTOMATICA
2010
94views more  AUTOMATICA 2010»
13 years 9 months ago
Optimality analysis of sensor-target localization geometries
The problem of target localization involves estimating the position of a target from multiple and typically noisy measurements of the target position. It is well known that the re...
Adrian N. Bishop, Baris Fidan, Brian D. O. Anderso...
EUROPAR
2008
Springer
13 years 10 months ago
Deque-Free Work-Optimal Parallel STL Algorithms
This paper presents provable work-optimal parallelizations of STL (Standard Template Library) algorithms based on the workstealing technique. Unlike previous approaches where a deq...
Daouda Traoré, Jean-Louis Roch, Nicolas Mai...
ICWN
2003
13 years 10 months ago
Localization in Wireless Sensor Networks: A Probabilistic Approach
— In this paper we consider a probabilistic approach to the problem of localization in wireless sensor networks and propose a distributed algorithm that helps unknown nodes to de...
Vaidyanathan Ramadurai, Mihail L. Sichitiu
INFOCOM
2008
IEEE
14 years 3 months ago
Which Distributed Averaging Algorithm Should I Choose for my Sensor Network?
Average consensus and gossip algorithms have recently received significant attention, mainly because they constitute simple and robust algorithms for distributed information proc...
Patrick Denantes, Florence Bénézit, ...