<?xml version="1.0" encoding="UTF-8"?><marc:collection xmlns:marc="http://www.loc.gov/MARC21/slim">
  <marc:record>
    <marc:leader>00000nam  2200000zi 4500</marc:leader>
    <marc:controlfield tag="001">9.875878</marc:controlfield>
    <marc:controlfield tag="003">CaOODSP</marc:controlfield>
    <marc:controlfield tag="005">20221107164548</marc:controlfield>
    <marc:controlfield tag="006">m     o  d f      </marc:controlfield>
    <marc:controlfield tag="007">cr |n|||||||||</marc:controlfield>
    <marc:controlfield tag="008">190704t20182017nsca   #ob   f000 0 eng d</marc:controlfield>
    <marc:datafield tag="040" ind1=" " ind2=" ">
      <marc:subfield code="a">CaOODSP</marc:subfield>
      <marc:subfield code="b">eng</marc:subfield>
      <marc:subfield code="e">rda</marc:subfield>
      <marc:subfield code="c">CaOODSP</marc:subfield>
    </marc:datafield>
    <marc:datafield tag="043" ind1=" " ind2=" ">
      <marc:subfield code="a">n-cn---</marc:subfield>
    </marc:datafield>
    <marc:datafield tag="086" ind1="1" ind2=" ">
      <marc:subfield code="a">D68-10/135-2018E-PDF</marc:subfield>
    </marc:datafield>
    <marc:datafield tag="100" ind1="1" ind2=" ">
      <marc:subfield code="a">Asadi, M. M., </marc:subfield>
      <marc:subfield code="e">author.</marc:subfield>
    </marc:datafield>
    <marc:datafield tag="245" ind1="1" ind2="0">
      <marc:subfield code="a">Connectivity assessment of random directed graphs with application to underwater sensor networks / </marc:subfield>
      <marc:subfield code="c">Mohammad Mehdi Asadi [and four others].</marc:subfield>
    </marc:datafield>
    <marc:datafield tag="264" ind1=" " ind2="1">
      <marc:subfield code="a">[Dartmouth, Nova Scotia] : </marc:subfield>
      <marc:subfield code="b">Defence Research and Development Canada = Recherche et développement pour la défense Canada, </marc:subfield>
      <marc:subfield code="c">2018.</marc:subfield>
    </marc:datafield>
    <marc:datafield tag="264" ind1=" " ind2="4">
      <marc:subfield code="c">©2017</marc:subfield>
    </marc:datafield>
    <marc:datafield tag="300" ind1=" " ind2=" ">
      <marc:subfield code="a">1 online resource (8 pages) : </marc:subfield>
      <marc:subfield code="b">figures.</marc:subfield>
    </marc:datafield>
    <marc:datafield tag="336" ind1=" " ind2=" ">
      <marc:subfield code="a">text</marc:subfield>
      <marc:subfield code="b">txt</marc:subfield>
      <marc:subfield code="2">rdacontent</marc:subfield>
    </marc:datafield>
    <marc:datafield tag="337" ind1=" " ind2=" ">
      <marc:subfield code="a">computer</marc:subfield>
      <marc:subfield code="b">c</marc:subfield>
      <marc:subfield code="2">rdamedia</marc:subfield>
    </marc:datafield>
    <marc:datafield tag="338" ind1=" " ind2=" ">
      <marc:subfield code="a">online resource</marc:subfield>
      <marc:subfield code="b">cr</marc:subfield>
      <marc:subfield code="2">rdacarrier</marc:subfield>
    </marc:datafield>
    <marc:datafield tag="490" ind1="1" ind2=" ">
      <marc:subfield code="a">External literature (P) ; </marc:subfield>
      <marc:subfield code="v">DRDC-RDDC-2018-P135</marc:subfield>
    </marc:datafield>
    <marc:datafield tag="500" ind1=" " ind2=" ">
      <marc:subfield code="a">Cover title.</marc:subfield>
    </marc:datafield>
    <marc:datafield tag="500" ind1=" " ind2=" ">
      <marc:subfield code="a">"Can unclassified."</marc:subfield>
    </marc:datafield>
    <marc:datafield tag="500" ind1=" " ind2=" ">
      <marc:subfield code="a">"April 2018."</marc:subfield>
    </marc:datafield>
    <marc:datafield tag="504" ind1=" " ind2=" ">
      <marc:subfield code="a">Includes bibliographical references, page [8].</marc:subfield>
    </marc:datafield>
    <marc:datafield tag="520" ind1=" " ind2=" ">
      <marc:subfield code="a">"In this brief, the problem of connectivity assessment for a random network is investigated. The weighted vertex connectivity (WVC) is introduced as a metric to evaluate the connectivity of the weighted expected graph of a random sensor network, where the elements of the weight matrix characterize the operational probability of their corresponding communication links. The WVC measure extends the notion of vertex connectivity (VC) for random graphs by taking into account the joint effects of path reliability and network robustness to node failure. The problem of computing the WVC measure is transformed into a sequence of iterative deepening depth-first search and maximum weight clique problems. An algorithm is developed accordingly to find the proposed connectivity metric. The approximate WVC measure is defined subsequently as a lower bound on the introduced connectivity metric which can be found by applying a polynomial-time shortest path algorithm in a sequential manner. The performance of the proposed algorithms is validated using an experimental underwater acoustic sensor network"--Abstract.</marc:subfield>
    </marc:datafield>
    <marc:datafield tag="692" ind1="0" ind2="7">
      <marc:subfield code="2">gccst</marc:subfield>
      <marc:subfield code="a">Networks</marc:subfield>
    </marc:datafield>
    <marc:datafield tag="692" ind1="0" ind2="7">
      <marc:subfield code="2">gccst</marc:subfield>
      <marc:subfield code="a">Military technology</marc:subfield>
    </marc:datafield>
    <marc:datafield tag="710" ind1="2" ind2=" ">
      <marc:subfield code="a">Defence R&amp;D Canada. </marc:subfield>
      <marc:subfield code="b">Atlantic Research Centre.</marc:subfield>
    </marc:datafield>
    <marc:datafield tag="830" ind1="#" ind2="0">
      <marc:subfield code="a">External literature (P) (Defence R&amp;D Canada)</marc:subfield>
      <marc:subfield code="v">DRDC-RDDC-2018-P135.</marc:subfield>
      <marc:subfield code="w">(CaOODSP)9.854437</marc:subfield>
    </marc:datafield>
    <marc:datafield tag="856" ind1="4" ind2="0">
      <marc:subfield code="q">PDF</marc:subfield>
      <marc:subfield code="s">836 KB</marc:subfield>
      <marc:subfield code="u">https://publications.gc.ca/collections/collection_2019/rddc-drdc/D68-10-135-2018-eng.pdf</marc:subfield>
    </marc:datafield>
  </marc:record>
</marc:collection>
