Performance analysis of network connective probability of multihop network under correlated breakage

Shigeki Shiokawa, Iwao Sasase

Research output: Contribution to conferencePaperpeer-review

Abstract

One of important properties of multihop network is the network connective probability which evaluate the connectivity of the network. The network connective probability is defined as the probability that when some nodes are broken, rest nodes connect each other. Multihop networks are classified to the regular network whose link assignment is regular and the random network whose link assignment is random. It has been shown that the network connective probability of regular network is larger than that of random network. However, all of these results is shown under independent node breakage. In this paper, we analyze the network connective probability of multihop networks under the correlated node breakage. It is shown that regular network has better performance of the network connective probability than random network under the independent breakage, on the other hand, random network has better performance than regular network under the correlated breakage.

Original languageEnglish
Pages1581-1585
Number of pages5
Publication statusPublished - 1996
EventProceedings of the 1996 IEEE International Conference on Communications, ICC'96. Part 1 (of 3) - Dallas, TX, USA
Duration: 1996 Jun 231996 Jun 27

Other

OtherProceedings of the 1996 IEEE International Conference on Communications, ICC'96. Part 1 (of 3)
CityDallas, TX, USA
Period96/6/2396/6/27

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Performance analysis of network connective probability of multihop network under correlated breakage'. Together they form a unique fingerprint.

Cite this