Sciweavers

2001 search results - page 252 / 401
» Local solutions for global problems in wireless networks
Sort
View
AICCSA
2006
IEEE
126views Hardware» more  AICCSA 2006»
16 years 13 days ago
Restricted Shortest Path Routing with Concave Costs
Multi-constraint quality-of-service routing has become increasingly important as the Internet evolves to support real-time services. Restricted shortest path (RSP) is one of the i...
Pejman Khadivi, Shadrokh Samavi, Hossein Saidi
CISS
2008
IEEE
16 years 25 days ago
Reconstruction of compressively sensed images via neurally plausible local competitive algorithms
Abstract—We develop neurally plausible local competitive algorithms (LCAs) for reconstructing compressively sensed images. Reconstruction requires solving a sparse approximation ...
Robert L. Ortman, Christopher J. Rozell, Don H. Jo...
IWCMC
2009
ACM
16 years 27 days ago
Optimal cooperative spectrum sensing in cognitive sensor networks
This paper addresses the problem of optimal cooperative spectrum sensing in a cognitive-enabled sensor network where cognitive sensors can cooperate in the sensing of the spectrum...
Hai Ngoc Pham, Yan Zhang, Paal E. Engelstad, Tor S...
CORR
2011
Springer
172views Education» more  CORR 2011»
14 years 10 months ago
Uncovering the Temporal Dynamics of Diffusion Networks
Time plays an essential role in the diffusion of information, influence and disease over networks. In many cases we only observe when a node copies information, makes a decision ...
Manuel Gomez-Rodriguez, David Balduzzi, Bernhard S...

Presentation
945views
14 years 6 days ago
A Decentralized Method for Maximizing k-coverage Lifetime in WSNs
In this paper, we propose a decentralized method for maximizing lifetime of data collection wireless sensor networks (WSNs) by making minimal number of nodes operate and putting ot...