基于区域划分的连通支配集协议

Protocols of determining connected dominating sets based on region partition

针对规模较大、节点分布密集的无线传感器网络容易产生冗余数据包以及信号冲突,导致过多的节点能量消耗,加速死亡过程等问题,在深入研究现有的分布式连通支配集构造算法的基础上,提出基于区域划分的连通支配集协议——RPMPR协议。RPMPR协议中每个节点针对网络拓扑信息,对邻居节点进行区域划分,在各区域内选择中继转发节点集,并以节点的度作为选择支配节点的依据,构建覆盖全网的连通支配集。仿真实验结果表明,RPMPR协议充分考虑网络拓扑信息,显著减小连通支配集规模,同时支配节点分布更为均匀。

Large-scale, highly distributed and relatively dense wireless sensor networks are characterized by more redundant data packets in broadcasting process, and more conflict and node energy consumptioru Aimed at these problems, a distributed algo- rithms based on region partition is employed in this work. We begin with a thorough investigation and understanding of the per- formance limitations of existing typical protocols. On this basis, region partition based multipoint relaying protocol （RPMPR） for determining connected dominating sets is proposed. A set of forwarding neighbors, which covers the node＇s 2-hop neighbor set, is elected in each region. Each node is able to make a decision whether it should act as a dominating node. The purpose is to form a CDS, and to ensure full coverage. Our simulation results demonstrate that RPMPR performs better than these other lo- calized algorithms, in terms of backbone size, route length and so on.