Sciweavers

412 search results - page 17 / 83
» Single-Sink Network Design with Vertex Connectivity Requirem...
Sort
View
ACSC
2005
IEEE
14 years 1 months ago
Simulating Network Robustness for Critical Infrastructure Networks
We examine the robustness of critical infrastructure networks in the face of terrorist attack, using a simulation experiment that incorporates link capacity; and an extension of d...
Anthony H. Dekker
STOC
2009
ACM
139views Algorithms» more  STOC 2009»
14 years 8 months ago
Online and stochastic survivable network design
Consider the edge-connectivity survivable network design problem: given a graph G = (V, E) with edge-costs, and edgeconnectivity requirements rij Z0 for every pair of vertices i,...
Anupam Gupta, Ravishankar Krishnaswamy, R. Ravi
TOSN
2010
128views more  TOSN 2010»
13 years 6 months ago
Key predistribution for homogeneous wireless sensor networks with group deployment of nodes
Recent literature contains proposals for key predistribution schemes for sensor networks in which nodes are deployed in separate groups. In this paper we consider the implications...
Keith M. Martin, Maura B. Paterson, Douglas R. Sti...
SRDS
2005
IEEE
14 years 1 months ago
Distributed Construction of a Fault-Tolerant Network from a Tree
We present an algorithm by which nodes arranged in a tree, with each node initially knowing only its parent and children, can construct a fault-tolerant communication structure (a...
Michael K. Reiter, Asad Samar, Chenxi Wang
ICITS
2011
12 years 11 months ago
Homogeneous Faults, Colored Edge Graphs, and Cover Free Families
In this paper, we use the concept of colored edge graphs to model homogeneous faults in networks. We then use this model to study the minimum connectivity (and design) requirements...
Yongge Wang, Yvo Desmedt