On the characterization of the domination of a diameter-constrained network reliability model
Discrete Applied Mathematics - Special issue: Traces of the Latin American conference on combinatorics, graphs and applications: a selection of papers from LACGA 2004, Santiago, Chile
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
The availability and reliability of wireless multi-hop networks with stochastic link failures
IEEE Journal on Selected Areas in Communications - Special issue on stochastic geometry and random graphs for the analysis and designof wireless networks
| Hi-index | 0.00 |
In this paper we propose the application of a network reliability measure to assess performance objectives of wireless mesh networks in order to address different optimization problems in communication theory. In classical reliability theory, a communication network can be modeled as a directed graph G=(V,E), composed of a finite set V of nodes, and a finite set E of links. Given that the links of a network underlying graph fail independently with known probabilities (nodes are perfectly reliable), and given a set K of terminal nodes and a source node s of K, the Source-to-K-terminal reliability Rs,K(G), is the probability of the event that source s will communicate with the terminal nodes thru operational directed paths. This reliability measure is then used to address several optimization problems in mesh networks, in which each link represents a stochastic wireless communication channel connecting two nodes of a network and whose probability of failure is based upon recent results in Information Theory. We present efficient algorithmic techniques to tackle optimization problems in communication networks such as nodes redundancy and areas' connectivity.