首页> 外文会议>IEEE Annual Conference on Decision and Control >Distributed connectivity optimization in asymmetric networks
【24h】

Distributed connectivity optimization in asymmetric networks

机译:非对称网络中的分布式连接优化

获取原文

摘要

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.
机译:本文研究了由加权定向图(DIGRAPH)表示的非对称传感器网络的分布式连接优化问题。广义代数连接的概念用于测量时变加权数字的连接性。通过基于子空间共识算法的广义代数连通性被认为是非旋转和非增强的连续成本函数,并且开发了一种分布式方法,以计算网络连接的SuperGRadient向量。通过考虑上述网络连接作为网络的传输功率向量的功能,提出了一种离散时间更新过程来计算局部最大化网络连接的网络的静止传输功率矢量。随后通过模拟证明了发达算法的有效性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号