Sciweavers

1078 search results - page 12 / 216
» Optimal multiple-coverage of sensor networks
Sort
View
MP
2010
162views more  MP 2010»
13 years 5 months ago
Approximation accuracy, gradient methods, and error bound for structured convex optimization
Convex optimization problems arising in applications, possibly as approximations of intractable problems, are often structured and large scale. When the data are noisy, it is of i...
Paul Tseng
EWSN
2011
Springer
12 years 11 months ago
A Mobility Management Framework for Optimizing the Trajectory of a Mobile Base-Station
Abstract. We describe a software framework for prescribing the trajectory path of a mobile sink in a wireless sensor network under an extensible set of optimization criteria. The f...
Madhu Mudigonda, Trisul Kanipakam, Adam Dutko, Man...
DCOSS
2005
Springer
14 years 1 months ago
Multi-query Optimization for Sensor Networks
The widespread dissemination of small-scale sensor nodes has sparked interest in a powerful new database abstraction for sensor networks: Clients “program” the sensors through ...
Niki Trigoni, Yong Yao, Alan J. Demers, Johannes G...
ICC
2011
IEEE
239views Communications» more  ICC 2011»
12 years 7 months ago
The Insights of DV-Based Localization Algorithms in the Wireless Sensor Networks with Duty-Cycled and Radio Irregular Sensors
—Location information of nodes is the basis for many applications in wireless sensor networks (WSNs). However, most previous localization methods make the unrealistic assumption:...
Yuanfang Chen, Lei Shu, Mingchu Li, Ziqi Fan, Lei ...
ESA
2005
Springer
108views Algorithms» more  ESA 2005»
14 years 1 months ago
Bootstrapping a Hop-Optimal Network in the Weak Sensor Model
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...
Martin Farach-Colton, Rohan J. Fernandes, Miguel A...