Wireless Network Reliability Analysis for Arbitrary Network Topologies

The outage performance of wireless networks with unstructured network topologies is investigated. The network reliability perspective of graph theory is used to obtain the network outage polynomial of generalized wireless networks by enumerating paths and cut-sets of its graph representation for both uncorrelated and correlated wireless channels. A relation is established between the max-flow min-cut theorem and key communication performance indicators. The diversity order is equal to the size of the minimum cut-set between source and destination, and the coding gain is the number of cut-sets with size equal to the minimum cut. An ergodic capacity analysis of networks with arbitrary topologies based on the network outage polynomial is also presented. Numerical results are used to illustrate the technical definitions and verify the derivations.

[1]  D. R. Fulkerson,et al.  Maximal Flow Through a Network , 1956 .

[2]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[3]  Sieteng Soh,et al.  A computer approach for reliability evaluation of telecommunication networks with heterogeneous link-capacities , 1991 .

[4]  George E. Andrews,et al.  Number theory , 1971, Bicycle or Unicycle?.

[5]  Georgios B. Giannakis,et al.  A simple and general parameterization quantifying performance in fading channels , 2003, IEEE Trans. Commun..

[6]  Charles J. Colbourn,et al.  Chapter 11 Network reliability , 1995 .

[7]  John G. Proakis,et al.  Digital Communications , 1983 .

[8]  Anne Berry,et al.  Generating All the Minimal Separators of a Graph , 1999, Int. J. Found. Comput. Sci..

[9]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[10]  Piyush Gupta,et al.  Critical Power for Asymptotic Connectivity in Wireless Networks , 1999 .

[11]  G. Grimmett,et al.  Flow in networks with random capacities , 1982 .

[12]  R. Koetter,et al.  An algebraic approach to network coding , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).

[13]  Piet Van Mieghem,et al.  Connectivity in Wireless Ad-hoc Networks with a Log-normal Radio Model , 2006, Mob. Networks Appl..

[14]  Christian Bettstetter,et al.  Connectivity of Wireless Multihop Networks in a Shadow Fading Environment , 2005, Wirel. Networks.

[15]  R. C. French.  The effect of fading and shadowing on channel reuse in mobile radio , 1979, IEEE Transactions on Vehicular Technology.

[16]  Fred Moskowitz,et al.  The analysis of redundancy networks , 1958, Transactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics.

[17]  Charles J. Colbourn,et al.  The Combinatorics of Network Reliability , 1987 .

[18]  Lizhong Zheng,et al.  Diversity and multiplexing: a fundamental tradeoff in multiple-antenna channels , 2003, IEEE Trans. Inf. Theory.

[19]  Paul A. Jensen,et al.  An Algorithm to Determine the Reliability of a Complex System , 1969 .

[20]  B. J. Leon,et al.  A New Algorithm for Symbolic System Reliability Analysis , 1976, IEEE Transactions on Reliability.

[21]  John May,et al.  Reliability modeling and prediction of Wireless Multi-Hop Networks with correlated shadowing , 2014, 2014 IEEE 25th Annual International Symposium on Personal, Indoor, and Mobile Radio Communication (PIMRC).

[22]  O. Wing,et al.  Analysis of Probabilistic Networks , 1964 .

[23]  E. Jamoulle,et al.  Transportation networks with random arc capacities , 1972 .

[24]  Neal Patwari,et al.  Correlated link shadow fading in multi-hop wireless networks , 2008, IEEE Transactions on Wireless Communications.

[25]  Takeo Abe,et al.  Evaluating Reliability of Telecommunications Networks Using Traffic Path Information , 2008, IEEE Transactions on Reliability.

[26]  Douglas R. Shier,et al.  A paradigm for listing (s, t)-cuts in graphs , 2005, Algorithmica.