Sciweavers

1941 search results - page 121 / 389
» On Generalizations of Network Design Problems with Degree Bo...
Sort
View
STOC
2007
ACM
109views Algorithms» more  STOC 2007»
15 years 10 months ago
Stability of the max-weight routing and scheduling protocol in dynamic networks and at critical loads
We study the stability of the Max-Weight protocol for combined routing and scheduling in communication networks. Previous work has shown that this protocol is stable for adversari...
Matthew Andrews, Kyomin Jung, Alexander L. Stolyar
WS
2006
ACM
15 years 3 months ago
Modeling Ad-hoc rushing attack in a negligibility-based security framework
In this paper, we propose a formal notion of network security for ad hoc networks. We adopt a probabilistic security framework, that is, security is defined by a polynomially bou...
Jiejun Kong, Xiaoyan Hong, Mario Gerla
IAT
2009
IEEE
15 years 4 months ago
Cluster-Swap: A Distributed K-median Algorithm for Sensor Networks
In building practical sensor networks, it is often beneficial to use only a subset of sensors to take measurements because of computational, communication, and power limitations....
Yoonheui Kim, Victor R. Lesser, Deepak Ganesan, Ra...
ICASSP
2011
IEEE
14 years 1 months ago
A robust clock synchronization algorithm for wireless sensor networks
Recently, the maximum likelihood estimator (MLE) and Cramer-Rao Lower Bound (CRLB) were proposed with the goal of maximizing and assessing the synchronization accuracy in wireless...
Jang-Sub Kim, Jaehan Lee, Erchin Serpedin, Khalid ...
KIC
2000
14 years 11 months ago
Knowledge Discovery and Data Mining within a Design Environment
Designers, in the process of satisfying design requirements, generally encounter difficulties in, firstly, understanding the problem and secondly, finding a solution [Cross 1998]....
Mark K. D. Haffey, Alex H. B. Duffy