Sciweavers

219 search results - page 27 / 44
» Survivable network design with degree or order constraints
Sort
View
INFOCOM
2011
IEEE
12 years 11 months ago
Multiple task scheduling for low-duty-cycled wireless sensor networks
—For energy conservation, a wireless sensor network is usually designed to work in a low-duty-cycle mode, in which a sensor node keeps active for a small percentage of time durin...
Shuguang Xiong, Jianzhong Li, Mo Li, Jiliang Wang,...
TON
2008
125views more  TON 2008»
13 years 7 months ago
Two techniques for fast computation of constrained shortest paths
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
Shigang Chen, Meongchul Song, Sartaj Sahni
WORM
2003
13 years 9 months ago
Experiences with worm propagation simulations
Fast Internet worms are a relatively new threat to Internet infrastructure and hosts. We discuss motivation and possibilities to study the behaviour of such worms and degrees of f...
Arno Wagner, Thomas Dübendorfer, Bernhard Pla...
MSWIM
2006
ACM
14 years 1 months ago
Testing methodology for an ad hoc routing protocol
In this paper, we define a model of an ad hoc routing protocol, i.e. the OLSR (Optimized Link-State Routing) protocol. This model handles novel constraints related to such networ...
Stéphane Maag, Fatiha Zaïdi
DAC
2006
ACM
14 years 8 months ago
Harvesting aware power management for sensor networks
Energy harvesting offers a promising alternative to solve the sustainability limitations arising from battery size constraints in sensor networks. Several considerations in using ...
Aman Kansal, Jason Hsu, Mani B. Srivastava, Vijay ...