Distributed connectivity optimization in asymmetric networks / Mohammad Mehdi Asadi, Stéphane Blouin, Amir G. Aghdam.: D68-10/026-2018E-PDF
"The problem of distributed connectivity optimization of an asymmetric sensor network represented by a weighted directed graph (digraph) is investigated in this paper. The notion of generalized algebraic connectivity is used to measure the connectivity of a time-varying weighted digraph. The generalized algebraic connectivity is regarded as a nonconcave and nondifferentiable continuous cost function, and a distributed approach, based on the subspace consensus algorithm, is developed to compute the supergradient vector of the network connectivity. By considering the above-mentioned network connectivity as a function of the transmission power vector of the network, a discrete-time update procedure is proposed to compute a stationary transmission power vector of the network which locally maximizes the network connectivity. The effectiveness of the developed algorithm is subsequently demonstrated by simulations"--Abstract.
Permanent link to this Catalogue record:
publications.gc.ca/pub?id=9.875766&sl=0
| Department/Agency |
|
|---|---|
| Title | Distributed connectivity optimization in asymmetric networks / Mohammad Mehdi Asadi, Stéphane Blouin, Amir G. Aghdam. |
| Series title |
|
| Publication type | Monograph - View Master Record |
| Language | [English] |
| Format | Digital text |
| Electronic document | |
| Note(s) |
|
| Publishing information |
|
| Author / Contributor |
|
| Description | 1 online resource (10 pages). |
| Catalogue number |
|
| Subject terms |
Request alternate formats
To request an alternate format of a publication, complete the Government of Canada Publications email form. Use the form’s “question or comment” field to specify the requested publication.Page details
- Date modified: