Sciweavers

1783 search results - page 219 / 357
» Low-Complexity Distributed Scheduling Algorithms for Wireles...
Sort
View
STOC
2003
ACM
90views Algorithms» more  STOC 2003»
16 years 3 months ago
Work-competitive scheduling for cooperative computing with dynamic groups
The problem of cooperatively performing a set of t tasks in a decentralized setting where the computing medium is subject to failures is one of the fundamental problems in distrib...
Chryssis Georgiou, Alexander Russell, Alexander A....
141
Voted
IPSN
2004
Springer
15 years 8 months ago
Distributed optimization in sensor networks
Wireless sensor networks are capable of collecting an enormous amount of data over space and time. Often, the ultimate objective is to derive an estimate of a parameter or functio...
Michael Rabbat, Robert D. Nowak
123
Voted
IPSN
2007
Springer
15 years 9 months ago
Underground structure monitoring with wireless sensor networks
Environment monitoring in coal mines is an important application of wireless sensor networks (WSNs) that has commercial potential. We discuss the design of a Structure-Aware Self-...
Mo Li, Yunhao Liu
134
Voted
IWCMC
2006
ACM
15 years 9 months ago
On the robustness of grid-based deployment in wireless sensor networks
Grid-based sensor deployment is an effective and efficient practice for provisioning wireless sensor networks. Previous work has addressed grid-based deployment of sensors in orde...
Kenan Xu, Glen Takahara, Hossam S. Hassanein
INFOCOM
2011
IEEE
14 years 7 months ago
Utility optimization for dynamic peer-to-peer networks with tit-for-tat constraints
— We consider a peer-to-peer network where nodes can send and receive files amongst their peers. File requests are generated randomly, and each new file can correspond to a dif...
Michael J. Neely, Leana Golubchik