Minimizing retransmission nodes in broadcasting is equivalent to minimizing connected dominating set in graph theory, and finding a minimum connected dominating set is NP-complete for graphs.
广播过程中最小化参与转发节点数问题与图论中求解最小连通支配集问题等价，而在任意图中求解最小连通支配集是NP完全问题。
The node that can logically communicate with the nodes in other clusters has the ability to be gateway, and the set of these nodes is defined as gateway dominating set relative to cluster-head.
逻辑上能和其他簇内节点通信的节点都可以做网关，这些节点相对于簇首节点称为网关支配集。
The node that can logically communicate with the nodes in other clusters has the ability to be gateway, and the set of these nodes is defined as gateway dominating set relative to cluster-head.
逻辑上能和其他簇内节点通信的节点都可以做网关，这些节点相对于簇首节点称为网关支配集。
应用推荐