|
000
| 02567cam 2200361zi 4500 |
|---|
| 001 | 9.875878 |
|---|
| 003 | CaOODSP |
|---|
| 005 | 20221107164548 |
|---|
| 006 | m o d f |
|---|
| 007 | cr |n||||||||| |
|---|
| 008 | 190704t20182017nsca #ob f000 0 eng d |
|---|
| 040 | |aCaOODSP|beng|erda|cCaOODSP |
|---|
| 043 | |an-cn--- |
|---|
| 086 | 1 |aD68-10/135-2018E-PDF |
|---|
| 100 | 1 |aAsadi, M. M., |eauthor. |
|---|
| 245 | 10|aConnectivity assessment of random directed graphs with application to underwater sensor networks / |cMohammad Mehdi Asadi [and four others]. |
|---|
| 264 | 1|a[Dartmouth, Nova Scotia] : |bDefence Research and Development Canada = Recherche et développement pour la défense Canada, |c2018. |
|---|
| 264 | 4|c©2017 |
|---|
| 300 | |a1 online resource (8 pages) : |bfigures. |
|---|
| 336 | |atext|btxt|2rdacontent |
|---|
| 337 | |acomputer|bc|2rdamedia |
|---|
| 338 | |aonline resource|bcr|2rdacarrier |
|---|
| 490 | 1 |aExternal literature (P) ; |vDRDC-RDDC-2018-P135 |
|---|
| 500 | |aCover title. |
|---|
| 500 | |a"Can unclassified." |
|---|
| 500 | |a"April 2018." |
|---|
| 504 | |aIncludes bibliographical references, page [8]. |
|---|
| 520 | |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. |
|---|
| 692 | 07|2gccst|aNetworks |
|---|
| 692 | 07|2gccst|aMilitary technology |
|---|
| 710 | 2 |aDefence R&D Canada. |bAtlantic Research Centre. |
|---|
| 830 | #0|aExternal literature (P) (Defence R&D Canada)|vDRDC-RDDC-2018-P135.|w(CaOODSP)9.854437 |
|---|
| 856 | 40|qPDF|s836 KB|uhttps://publications.gc.ca/collections/collection_2019/rddc-drdc/D68-10-135-2018-eng.pdf |
|---|