1017 search results - page 39 / 204 » On the Computational Complexity of Sensor Network Localizati... |
SENSYS
2003
ACM
14 years 2 months ago
2003
ACM
In the absence of location errors, geographic routing - using a combination of greedy forwarding and face routing - has been shown to work correctly and efficiently. The effects o...
MOBIHOC
2008
ACM
14 years 8 months ago
2008
ACM
In this paper, we identify a new problem in wireless sensor networks, distance sensitive service discovery, where nearby or closest service selection guarantee is expected. We pro...
ICCNMC
2005
Springer
14 years 2 months ago
2005
Springer
This study deals with the topology discovery for the capacitated minimum spanning tree network. The problem is composed of finding the best way to link nodes to a source node and, ...
ICRA
2005
IEEE
14 years 2 months ago
2005
IEEE
— The paper proposes several improvements on the Direction of Gradient (DOG) algorithm proposed in [1] for detecting and localizing a biochemical source with moving sensors. In p...
PC
2010
13 years 7 months ago
2010
The fat-tree is one of the topologies most widely used to build high-performance parallel computers. However, they are expensive and difficult to build. In this paper we propose t...