Connectivity Assessment of Random Directed Graphs with Application to Underwater Sensor Networks

PDF

Authors
  1. Asadi, M.M.
  2. Mahboubi, H.
  3. Habibi, J.
  4. Aghdam, A.G.
  5. Blouin, S.
Corporate Authors
Defence Research and Development Canada, Atlantic Research Centre, Halifax NS (CAN);Concordia Univ, Montreal QUE (CAN) Dept of Electrical and Computer Engineering;McGill Univ, Montreal QUE (CAN)
Abstract
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.
Report Number
DRDC-RDDC-2018-P135 — External Literature
Date of publication
01 Apr 2018
Number of Pages
12
Reprinted from
IEEE Transactions on Control Systems Technology, Volume 25, Issue 4, July 2017, Page(s) 1457-1464
DSTKIM No
CA045893
CANDIS No
806348
Format(s):
Electronic Document(PDF)

Permanent link

Document 1 of 1

Date modified: