{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T06:10:29Z","timestamp":1697868629302},"reference-count":7,"publisher":"Wiley","issue":"4","license":[{"start":{"date-parts":[[2007,9,5]],"date-time":"2007-09-05T00:00:00Z","timestamp":1188950400000},"content-version":"vor","delay-in-days":8282,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Systems &amp; Computers in Japan"],"published-print":{"date-parts":[[1985,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The vulnerability of an integrated communication network composed of a terrestrial network and a satellite network is discussed in a graph\u2010theoretic manner. A ground switching station (a switch board) is abstracted as a vertex, a wire and an antenna, respectively, for a communication with a satellite as an edge of a graph. As a measure of the vulnerability of a communication network we introduce anew the concept of \u201cS\u2010connectivity.\u201d Although the concept of S\u2010connectivity is obtained by generalizing the conventional idea of vertex\u2010connectivity, since it takes into consideration the difference in the reliability between a satellite as a wireless transistor and a ground station controlled by software, it appears suitable as a means to determine the vulnerability of a communication network consisting of a terrestrial network and a satellite network.<\/jats:p><jats:p>This paper discusses: (1) What is the S\u2010connectivity when antennas that transmit to and receive from a satellite, are used on each ground station? (2) If ground stations exist which cannot communicate through the terrestrial network, at which stations should antennas be installed to enable communications with the minimum number of antennas via satellite? (3) When the number of edges of a terrestrial network is fixed, what kind of terrestrial network maximizes the S\u2010connectivity? (4) What are the computation times of algorithms for solving the preceding problems (1) and (2)?<\/jats:p>","DOI":"10.1002\/scj.4690160403","type":"journal-article","created":{"date-parts":[[2007,7,7]],"date-time":"2007-07-07T10:18:13Z","timestamp":1183803493000},"page":"19-28","source":"Crossref","is-referenced-by-count":0,"title":["Vulnerability of a communication network with a satellite"],"prefix":"10.1002","volume":"16","author":[{"given":"Ken'Ichi","family":"Hagihara","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toshimltsu","family":"Masuzawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nobuki","family":"Tokura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mitsuji","family":"Ikeda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2007,9,5]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1137\/0205044"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.21236\/AD0705364"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1981.1675809"},{"issue":"1","key":"e_1_2_1_5_2","first-page":"77","article-title":"The k\u2010node\u2010connectivity augmentation problem for directed binary trees","volume":"76","author":"Masuzawa T.","year":"1984","journal-title":"Trans. I.E.C.E. (D)"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1137\/0201010"},{"key":"e_1_2_1_7_2","unstructured":"S.M.Reddy D.K.PradhanandJ.G.Kuhl.Directed graphs with minimum diameter and maximum node connectivity Tech. Rep. School of Eng. Orkland Univ. Rochester Michigan (1980)."},{"key":"e_1_2_1_8_2","article-title":"Connectivity of directed regular graphs with small diameter","volume":"83","author":"Soneoka T.","year":"1983","journal-title":"Tech. Rep. I.E.C.E., Japan"}],"container-title":["Systems and Computers in Japan"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fscj.4690160403","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/scj.4690160403","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,20]],"date-time":"2023-10-20T15:24:48Z","timestamp":1697815488000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/scj.4690160403"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,1]]},"references-count":7,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1985,1]]}},"alternative-id":["10.1002\/scj.4690160403"],"URL":"https:\/\/doi.org\/10.1002\/scj.4690160403","archive":["Portico"],"relation":{},"ISSN":["0882-1666","1520-684X"],"issn-type":[{"value":"0882-1666","type":"print"},{"value":"1520-684X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,1]]}}}