Sciweavers

1432 search results - page 112 / 287
» Hardness of robust network design
Sort
View
PERVASIVE
2008
Springer
15 years 6 months ago
Localized power-aware routing in linear wireless sensor networks
Energy-efficency is a key concern when designing protocols for wireless sensor networks (WSN). This is of particular importance in commercial applications where demonstrable retur...
Marco Zimmerling, Waltenegus Dargie, Johnathan M. ...
ICNP
2007
IEEE
16 years 15 days ago
Network-based and Attack-resilient Length Signature Generation for Zero-day Polymorphic Worms
—It is crucial to detect zero-day polymorphic worms and to generate signatures at the edge network gateways or honeynets so that we can prevent the worms from propagating at thei...
Zhichun Li, Lanjia Wang, Yan Chen, Zhi Fu
AINA
2010
IEEE
15 years 11 months ago
A Quadratic, Complete, and Minimal Consistency Diagnosis Process for Firewall ACLs
— Developing and managing firewall Access Control Lists (ACLs) are hard, time-consuming, and error-prone tasks for a variety of reasons. Complexity of networks is constantly incr...
Sergio Pozo, A. J. Varela-Vaca, Rafael M. Gasca
PUC
2007
116views more  PUC 2007»
15 years 5 months ago
Periodic properties of user mobility and access-point popularity
Understanding user mobility and its effect on access points (APs) is important in designing location-aware systems and wireless networks. Although various studies of wireless netwo...
Minkyong Kim, David Kotz
JCO
2010
101views more  JCO 2010»
15 years 4 months ago
Separator-based data reduction for signed graph balancing
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
Falk Hüffner, Nadja Betzler, Rolf Niedermeier