Sciweavers

279 search results - page 13 / 56
» Randomized k-Coverage Algorithms For Dense Sensor Networks
Sort
View
TSP
2010
13 years 2 months ago
Decentralized sparse signal recovery for compressive sleeping wireless sensor networks
Abstract--This paper develops an optimal decentralized algorithm for sparse signal recovery and demonstrates its application in monitoring localized phenomena using energy-constrai...
Qing Ling, Zhi Tian
CORR
2007
Springer
117views Education» more  CORR 2007»
13 years 7 months ago
Sensor Networks with Random Links: Topology Design for Distributed Consensus
—In a sensor network, in practice, the communication among sensors is subject to: 1) errors that can cause failures of links among sensors at random times; 2) costs; and 3) const...
Soummya Kar, José M. F. Moura
CORR
2008
Springer
136views Education» more  CORR 2008»
13 years 7 months ago
Distributed Sensor Localization in Random Environments using Minimal Number of Anchor Nodes
Abstract--The paper introduces DILOC, a distributed, iterative algorithm to locate sensors (with unknown locations) in 1, with respect to a minimal number of + 1 anchors with known...
Usman A. Khan, Soummya Kar, José M. F. Mour...
TMC
2010
210views more  TMC 2010»
13 years 5 months ago
Exploiting Reactive Mobility for Collaborative Target Detection in Wireless Sensor Networks
—Recent years have witnessed the deployments of wireless sensor networks in a class of mission-critical applications such as object detection and tracking. These applications oft...
Rui Tan, Guoliang Xing, Jianping Wang, Hing-Cheung...
ICCNMC
2005
Springer
14 years 1 months ago
Curve-Based Greedy Routing Algorithm for Sensor Networks
Routing packets along a specified curve is a new approach to forwarding packets in large-scale dense sensor networks. Forwarding packets along trajectories can be very effective in...
Jin Zhang, Yaping Lin, Mu Lin, Ping Li, Si-wang Zh...