中文摘要：

提出了异构无线传感器网络的最小转发连通覆盖问题,其目标是寻找一个满足以下要求的最小转发连通覆盖集（minimum relay-connecting set cover,简称MRCSC）：1）活跃节点完全覆盖任务区域.从三角点阵排列可以获得节点数量近似最优的结论出发,给出了节点随机部署策略下的位置点优化选取原则,该原则着重考虑了当出现相邻节点间距离偏离3rs的情形时,能够限制不规则性的传播,最终构成近似规则的三角点阵排列.2）所有活跃节点与转发骨干网连通.由于节点到达sink的路径可能较长,导致路径的数据成功转发率较低,因而不要求节点与sink的连通,而是至少存在一条到达骨干节点、较高数据转发率的路径,因此提出了转发连通验证和增强算法.理论分析和仿真实验表明,最小转发连通覆盖集的覆盖质量与OGDC算法接近,但在提高了转发连通率的同时也有效地控制了覆盖集的规模.

英文摘要：

This paper proposes a relay-connecting coverage problem in heterogeneous wireless sensor networks. The aim is to find a minimum relay-connecting set cover （MRCSC） that satisfies the following： 1） Active nodes in a set cover fully sense the task area. Motivated by triangular lattice placement with asymptotic priority, a rule is designed to restrict abnormal spreading and to form an approximate triangular lattice; 2） Active nodes are relay-connecting, which means any active node connects at least one super node with a given success data forwarding rate. Relay-connecting prevents the interference of nodes that have low success data forwarding rates that are caused by the long path nodes take to the sink and radio channel. Theoretical analysis simulations show that the coverage of MRCSC nearly reaches that of OGCD, but relay-connectivity of active nodes is strongly reinforced with a limited number of additional nodes.