The Reliability Measure of Disconnected Network Based on Surviving Edges

Article Preview

Abstract:

In wireless sensor networks, the disconnected network is an important and special one. Generally, the disconnected network is often characterized as a graph in graph theory. Suppose that edges fail independently of each other with equal probability and nodes are perfect. In this paper, a new reliability measure of disconnected network is proposed and defined as the probability that the edge-induced subgraph induced by surviving edges is connected. Different from traditional all-terminal reliability, this new reliability measure focuses on residual edge connectedness and is able to distinguish the reliability of two disconnected networks which are in the same class. Furthermore, the partial-star S is also proved to be uniformly best disconnected network under our proposed reliability measure in its class.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 756-759)

Pages:

1669-1673

Citation:

Online since:

September 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] I.F. Akyildiz, W. Su, Y. Sankarasubramaniam and E. Cayirci, Wireless sensor networks: a Survey, Computer Networks, vol. 38, no. 4, pp.393-422, (2002).

DOI: 10.1016/s1389-1286(01)00302-4

Google Scholar

[2] David Culler, D. Estrin and M. Srivastava, Overview of sensor networks, IEEE Computer, August, pp.41-49, (2004).

Google Scholar

[3] B. Badrinath and M. Srivastava, Smart spaces and environments, IEEE Personal Commun., vol. 7, no. 5, Oct. (2000).

Google Scholar

[4] H.M.F. AboElFotoh, S.S. Iyengar, and K. Chakrabarty, Computing reliability and message delay for cooperative wireless distributed sensor networks subject to random failures, IEEE Transactions on Reliability, vol. 54, no. 1, pp.145-155, (2005).

DOI: 10.1109/tr.2004.842540

Google Scholar

[5] C. J. Colbourn, The Combinatorics of Network Reliability. New York, Oxford University Press, (1987).

Google Scholar

[6] D. R. Shier, Network Reliability and Algebraic Structures. New York, Oxford University Press, (1991).

Google Scholar

[7] H.M. F AboElFotoh, C.J. Colbourn, Computing 2-Terminal Reliability for Radio-Broadcast Networks, IEEE Transactions Reliability, vol. 38, 1989, pp.538-555.

DOI: 10.1109/24.46478

Google Scholar

[8] J.Y. Shin, C.B. Jr, K-terminal reliability in ring networks, IEEE Transactions Reliability, vol. 43, 1994, pp.359-401.

Google Scholar

[9] C. Srivaree-ratana, A. Konak, A.E. Smith, Estimation of all-terminal network reliability using an artificial neural network, Computers and Operations Research vol. 29, 2002, pp.849-868.

DOI: 10.1016/s0305-0548(00)00088-5

Google Scholar

[10] J.A. Bondy, U.S.R. Murty, Graph Theory with Applications. Macamillan, London, (1976).

Google Scholar