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.
Lien permanent pour cette publication :
publications.gc.ca/pub?id=9.875766&sl=1
| Ministère/Organisme |
|
|---|---|
| Titre | Distributed connectivity optimization in asymmetric networks / Mohammad Mehdi Asadi, Stéphane Blouin, Amir G. Aghdam. |
| Titre de la série |
|
| Type de publication | Monographie - Voir l'enregistrement principal |
| Langue | [Anglais] |
| Format | Texte numérique |
| Document électronique | |
| Note(s) |
|
| Information sur la publication |
|
| Auteur / Contributeur |
|
| Description | 1 online resource (10 pages). |
| Numéro de catalogue |
|
| Descripteurs |
Demander des formats alternatifs
Pour demander une publication dans un format alternatif, remplissez le formulaire électronique des publications du gouvernement du Canada. Utilisez le champ du formulaire «question ou commentaire» pour spécifier la publication demandée.Détails de la page
- Date de modification :