159 search results - page 28 / 32 » A Distributed Optimization Algorithm for Multi-Hop Cognitive... |
ICASSP
2009
IEEE
14 years 16 days ago
2009
IEEE
A Bayesian formulation of quickest change detection in multiple onoff processes is obtained within a decision-theoretic framework. For geometrically distributed busy and idle time...
ATAL
2010
Springer
13 years 6 months ago
2010
Springer
In large wireless sensor networks, the problem of assigning radio frequencies to sensing agents such that no two connected sensors are assigned the same value (and will thus inter...
PODC
2009
ACM
14 years 6 months ago
2009
ACM
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...
ESA
2005
Springer
13 years 11 months ago
2005
Springer
Sensor nodes are very weak computers that get distributed at random on a surface. Once deployed, they must wake up and form a radio network. Sensor network bootstrapping research t...
IS
2011
13 years 22 days ago
2011
In order to process continuous queries over Wireless Sensor Networks (WSNs), sensors are typically organized in a Query Routing Tree (denoted as T) that provides each sensor with ...