1017 search results - page 167 / 204 » On the Computational Complexity of Sensor Network Localizati... |
EWSN
2007
Springer
14 years 7 months ago
2007
Springer
Methods for node localisation in sensor networks usually rely upon the measurement of received strength, time-of-arrival, and/or angle-of-arrival of an incoming signal. In this pap...
CISS
2008
IEEE
14 years 2 months ago
2008
IEEE
— In this paper, we study the problem of distributed detection in the presence of unknown carrier frequency offset (CFO) and initial phase, the issue we encounter in the emerging...
HPDC
2009
IEEE
14 years 2 months ago
2009
IEEE
Since the advent of electronic computing, the processors’ clock speed has risen tremendously. Now that energy efficiency requirements have stopped that trend, the number of proc...
MOBIHOC
2002
ACM
14 years 7 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
DSN
2006
IEEE
14 years 1 months ago
2006
IEEE
Fault-tolerant time-triggered communication relies on the synchronization of local clocks. The startup problem is the problem of reaching a sufficient degree of synchronization a...