2732 search results - page 291 / 547 » Fast and Distributed Computation of Schedules in Wireless Ne... |
170
click to vote
ANCS
2006
ACM
16 years 21 days ago
2006
ACM
The fast spreading worm is becoming one of the most serious threats to today’s networked information systems. A fast spreading worm could infect hundreds of thousands of hosts w...
192
click to vote
CDC
2010
IEEE
15 years 1 months ago
2010
IEEE
Most existing work uses dual decomposition and subgradient methods to solve Network Utility Maximization (NUM) problems in a distributed manner, which suffer from slow rate of con...
209
Voted
PERCOM
2011
ACM
14 years 10 months ago
2011
ACM
—In this work we study the problem of query privacy in large scale sensor networks. Motivated by a novel trust model in which clients query networks owned by trusted entities but...
203
Voted
ANCS
2005
ACM
16 years 8 days ago
2005
ACM
Task to resource mapping problems are encountered during (i) hardware-software co-design and (ii) performance optimization of Network Processor systems. The goal of the first pro...
172
click to vote
MOBIHOC
2008
ACM
16 years 6 months ago
2008
ACM
Local monitoring is an effective mechanism for the security of wireless sensor networks (WSNs). Existing schemes assume the existence of sufficient number of active nodes to carry...