Near-Optimal Placement of Secrets in Graphs
نویسندگان
چکیده
We consider the reconstruction of shared secrets in communication networks, which are modelled by graphs whose components are subject to possible failure. The reconstruction probability can be approximated using minimal cuts, if the failure probabilities of vertices and edges are close to zero. As the main contribution of this paper, node separators are used to design a heuristic for the near-optimal placement of secrets sets on the vertices of the graph.
منابع مشابه
Improving 3-D Imaging Breast Cancer Diagnosis Systems Using a New Method for Placement of Near-Infrared Sources and Detectors
The objective of this research was to improve 3-D imaging system by near-infrared light emission in breast tissue to achieve a more accurate diagnosis of tumor. The results of repeated experiments in this research have shown that with this imaging system, a more accurate diagnosis of abnormal area depends on the location of the sources and detectors. Therefore, an optimal location model has bee...
متن کاملAn Improved Standard Cell Placement Methodology using Hybrid Analytic and Heuristic Techniques
In recent years, size of VLSI circuits is dramatically grown and layout generation of current circuits has become a dominant task in design flow. Standard cell placement is an effective stage of physical design and quality of placement affects directly on the performance, power consumption and signal immunity of design. Placement can be performed analytically or heuristically. Analytical placer...
متن کاملOptimal Capacitor Allocation in Radial Distribution Networks for Annual Costs Minimization Using Hybrid PSO and Sequential Power Loss Index Based Method
In the most recent heuristic methods, the high potential buses for capacitor placement are initially identified and ranked using loss sensitivity factors (LSFs) or power loss index (PLI). These factors or indices help to reduce the search space of the optimization procedure, but they may not always indicate the appropriate placement of capacitors. This paper proposes an efficient approach for t...
متن کاملAn Optimal Symmetric Secret Distribution of Star Networks1
In this paper, we focus on the problem of key distribution that permits local broadcast authentication. We focus on four types of graphs (1) star graphs, (2) bipartite graphs, (3) planer graphs and (4) fully connected graphs. For star graphs, we show that as n, the number of satellite nodes in the star network, tends to ∞, it suffices to maintain log n + 1/2 log log n + 1 secrets at the center ...
متن کاملSimulation-based Vibration Sensor Placement for Centrifugal Pump Impeller Fault Detection
In this paper, a simulation-based method is proposed for optimal placement of vibration sensors for the purpose of fault detection in a centrifugal pump. The centrifugal pump is modeled to investigate the effect of vane tip fault on fluid flow patterns numerically. Pressure pulsations are investigated at different locations at the inner surface of the pump before and after the presence of the f...
متن کامل