支配集

采用连通图中极小支配集概念对平面分布的adhoc网络进行层次划分；

We use distributed minimum dominating set algorithm to construct a hierarchical architecture for mobile Ad hoc networks ;

本文提出了两个图支配集问题的变形即C强支配集和完全支配集问题，这两个问题都有重要的实际应用背景。

Two variations of the dominating set problem are presented , both of which have corresponding application background . In this paper , we prove the decision problems of the two variations are NPC .

一种改进的基于连通支配集的P2P搜索算法

An Improved Searching Algorithm Based on Connected Dominating Set in Peer-to-Peer Networks

移动adhoc网络中最小连通支配集的分布式高效近似算法

An Efficient Distributed Approximation Algorithm for Finding Minimal Dominating Set in Mobile Ad Hoc Network

一种快速构造多目标Pareto非支配集的方法：选举法则

Fast method of constructing multi-objective Pareto non-dominated set : election principle

在无结构P2P搜索技术中，详细描述了一种无结构P2P的搜索技术&基于连通支配集的搜索技术。

Among these unstructured P2P searching technologies , the dominating set based search scheme is recited , which is proposed by Wu .

一种适用于单向ad-hoc网络的连通支配集算法

An Energy Efficient Algorithm for Connected Dominating Set in Unidirectional Wireless Ad-Hoc Networks

它在多个信息孤岛（即域）中使用UAV和支配集的DS节点共同完成通信。

It uses an UAV and DS nodes together to complete communication in many islands of information that is area .

基于图论中的连通支配集（CDS）概念，提出了一种有效的广播途径。

This paper proposes an efficient broadcast scheme based on the concept of connected dominating set ( CDS ) in graph theory .

广播过程中最小化参与转发节点数问题与图论中求解最小连通支配集问题等价，而在任意图中求解最小连通支配集是NP完全问题。

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 .

连通支配集问题在网络广播上有着广泛的应用，本文引入测度函数的概念，提出了带测度函数的连通支配集问题（CDS（F）），使得它具有更广的应用范围。

Connected dominating sets problem has widely used in network broadcast . This paper introduces the concept of measured function and defines connected dominating sets problem with measured functions ( CDS ( F )) .

多目标遗传算法（MOGA）大体上可以分为两个步骤：构造非支配集和保持解分布度。

Multi-objective Genetic Algorithm has two main steps : creating non-dominated set and keeping diversity .

求取连通支配集的算法主要分为集中式和分布式两种，因为WSN的动态性特点，集中式算法难以适应网络的实时变化，故多采用分布式的求取算法。

Because of the dynamic characteristics of WSN , the centralized algorithm is difficult to adapt to the real-time changes of the networks , so the distributed algorithm is usually adopted .

在构建连通支配集的基础上，提出了一种基于连通支配集的覆盖控制算法CBCCA（CDS-basedCoverageControlAlgorithm）。

Based on the construction of a connected dominating set , and a connected dominating set on the coverage of control algorithms CBCCA ( CDS-based Coverage Control Algorithm ) is proposed .

最小连通支配集的求取已经被证明是NP完全问题，现在最通用的手段是通过启发式的方法求得最优解。

Calculating the minimum Connected Dominating Sets has been proven to be a NP complete problem , so heuristic method is often used to calculate approximatively the optimal solution as the most common means .

针对无线adhoc网络中存在的相关问题，论文重点研究了无线adhoc网络的体系结构，极小连通支配集算法和TCP性能，目的在于对无线adhoc网络的性能进行优化。

By analyzing the exiting problem of wireless ad hoc networks , this thesis mainly studies framework , minimal connected dominating sets ( MCDS ) algorithms and TCP performance , which aims at the performance optimization in wireless ad hoc networks .

第二章介绍了Pareto最优解集和Pareto最优边界的概念以及庄家法则的基本思想等，并通过举例详细地说明了用庄家法则构造非支配集的过程。

The second chapter introduces Pareto optimal solution sets , Pareto optimality boundary , the basic thought of banker law , and it detail described a example about finding non-dominated sets by banker law . 3 .

针对移动骨干网，采用分布式方法在OCMM模型中设置备用节点，并在此基础上设计了一种考虑障碍物的最小连通支配集算法OCDS。

For the mobile backbone networks , standby nodes are setup using distributed method and a new algorithm OCDS is proposed .

提出了一种新的拓扑感知的最小连通支配集（MCDS）启发式算法&TACDS，并证明了其正确性。

A new topology-aware heuristic algorithm on minimum connected dominating sets ( MCDS ), TACDS is proposed in this dissertation and which correctness is proved .

当节点采用全向天线时，该问题可以归结为图论中的最小连通支配集（MCDS）问题。

With the assumption of omni-directional antenna , broadcast in MANETs can be reduced as the minimal connected dominating set ( MCDS ) problem in graph theory .

并证明了提出的基于网格的连通支配集（Mesh-CDS）算法具有最好的能耗性能，指导无线传感器网络自组织算法的设计和选择。

And we prove that Grid-based connected dominating set ( Mesh-CDS ) algorithm which we submitted has the best energy performance .

为了避免由洪泛搜索方法引起的大量网络流量问题，基于连通支配集的广播算法BCDS通过减少转发节点来减少查询消息数。

To avoid a large volume of unnecessary network traffic , the broadcast algorithm based on connected dominating set ( BCDS ) can decrease the redundant messages by reducing the forwarding nodes .

结合传感器网络的节点特性和位置信息，提出了一种基于连通支配集的传感器网络定向传播模型，以及一种基于域的分布式数据汇聚模型DDAM（distributeddataaggregationmodel）。

Considering the characteristics and location information of nodes in sensor networks , a modified directed transfer model of sensor networks and a new distributed data aggregation model based on area are proposed .

针对实际情况中移动自组织网络中节点的复杂性问题，该文提出了一种基于极大权的最小连通支配集（MWMCDS）的有效广播途径。

In view of the problem of the nodal complexity in mobile ad hoc networks ( MANETs ), an efficient broadcast scheme based on the concept of minimum connected dominating set with maximal weight ( MWMCDS ) is proposed .

无线自组网络中的基于多个支配集的路由协议

Routing Protocol Based on Multiple Dominating Set in Ad hoc Networks

无线传感器网络中一种启发式最小连通支配集算法

A Heuristic Minimum Connected Dominating Set Algorithm for Wireless Sensor Network

基于最小生成树的连通支配集求解算法

Novel connected dominating set algorithm based on minimum spanning tree

联合约束无线传感器网络连通支配集算法

Distributed Connected Dominating Set Algorithm with Combined Constraints in Wireless Sensor Network

一种快速构造非支配集的方法&擂台法则

A fast method of constructing the non-dominated set : arena 's principle

构造连通支配集的人防警报网络路由算法

Routing Algorithm by Constructing Connected Dominating Set of Air Defense Warning Network