Skip to main content

A Rapid Algorithm for Computing ST Reliability of Radio-Communication Networks

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4693))

Abstract

A new formula for computing ST reliability of radio-communication networks (RCN) from Source to Terminal t was presented. The new formula contains terms which correspond one by one to a class special ST path (SPRT). For a given networks, the terms of the new formula are fewer than those corresponding Inclusion-Exclusion principle. An algorithm for computing ST reliability was presented, it computed ST reliability or produced a ST reliability expression by enumerating a class of special networks of given networks. Because the structure of this class of new networks which need to be enumerated was relativity small, the new algorithm’s performance was better than Inclusion-Exclusion principle algorithm .Finally an example illustrates our conclusion.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. AboEIFotoh, H.M., Colbourn, C.J.: Computing 2-terminal Reliability for Radio-broadcast Networks. IEEE Trans. on Reliability 38(5), 538–555 (1989)

    Article  MATH  Google Scholar 

  2. AboEIFotoh, H.M., Colbourn, C.J.: Efficient Algorithm for Computing the Reliability of Permutation and Interval Graph. Networks 20(6), 883–899 (1990)

    Article  MathSciNet  Google Scholar 

  3. AboEIFotoh, H.M.: Algorithm for Computing Message Delay for Wireless Networks. Networks 29(1), 117–124 (1997)

    Article  MathSciNet  Google Scholar 

  4. Fanjia, K., Baiyou, Q., Guangxing, W.: An Algorithm for Reliability of Radio Broadcast Networks. Journal of Northeastern University (Natural Science) 19(5), 492–494 (1998)

    MATH  Google Scholar 

  5. Zhao, L.C., Kong, F.J.: A New Formula and an Algorithm for Reliability Analysis of Networks. Microelectron and Reliability 37(3), 511–518 (1997)

    Article  Google Scholar 

  6. Satyaranayanna, A., Prabhakar, A.: New Topological Formula and Rapid Algorithm for Reliability Analysis of Complex Networks. IEEE Trans. on Reliability 27(1), 82–100 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  7. Satyaranayanna, H.J.N.: A New Algorithm for Reliability Analysis of Multiterminal Network. IEEE Trans. on Reliability 30, 25–33 (1981)

    Google Scholar 

  8. Satyaranayanna, A.: Unified Formula for Analysis for Some Networks Reliability Problems. Trans. on Reliability 31(1), 23–32 (1982)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gao, F., Liu, X., Liu, H. (2007). A Rapid Algorithm for Computing ST Reliability of Radio-Communication Networks. In: Apolloni, B., Howlett, R.J., Jain, L. (eds) Knowledge-Based Intelligent Information and Engineering Systems. KES 2007. Lecture Notes in Computer Science(), vol 4693. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74827-4_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-74827-4_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-74826-7

  • Online ISBN: 978-3-540-74827-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics