网络连通度约束下低开销的拓扑控制

为实现网络开销与网络连通度的权衡设计，分别基于链路添加和链路删除提出2个启发式的拓扑构建算法.通过采用网络图的代数连通度，并定义无线链路的连通度开销比这一新的拓扑度量，计算每条链路在拓扑优化中的权值.所提的启发式算法可根据该链路权值进行无线链路的添加或删除.设计了若干网络开销函数，以满足不同的网络场景.仿真结果表明，所提的启发式算法能够生成低开销的网络拓扑，同时满足给定的连通度约束.

Low-Cost Topology Control under Network Connectivity Constraint

In order to achieve the tradeoff between network cost and network connectivity, two heuristic algorithms for topology control, which are based on link addition and link removal, respectively, are proposed. Each link's weight in the topology optimization is calculated by employing the theory of algebraic connectivity and introducing a new topology metric for each wireless link. The proposed algorithms add or delete a link according to its weight. We conceive some cost functions for different network scenarios. Simulations show that our proposed algorithms could generate the low-cost topologies under the network connectivity constraint.