在无线传感器网络的拓扑控制(TC)中,基于Cell的TC算法被认为是一类可以节省传感器节点能量并延长网络生命周期的方法,但是其需要较多的骨干网节点并且无法保证连通性.通过分析现今算法的内在局限性,提出了一种1-Con思想:当一个Cell的头节点被加入当前骨干网时,所有其可以连接的Cell使用该节点连入拓扑结构,然后此新骨干网递归地继续扩大.基于此思想,设计了一种基于可连Cell的拓扑控制算法(CCTC),并从理论上证明:1)CCTC可以保证其所形成的拓扑结构维持网络连通;2)每一轮用于形成骨干网的工作节点非常少.CCTC的计算复杂度是线性的,空间复杂度和信息交换量都是常数量级.仿真实验同样显示,CCTC可以在提供良好鲁棒性和较少的消息交换的情况下,更有效地节省节点能耗并延长网络生命周期.
In wireless sensor networks topology control (TC), cell based TC algorithms have been recognized as a type of methods which could conserve nodes' energy and extend network lifetime. However, they require too many backbone nodes and can't guarantee connectivity. By investigating the limitations of these algorithms, a 1-con method is proposed: when a cell head is connected into the current backbone, all cells that could be reached by this head will be connected to the topology structure through it, and then the new backbone expands itself recursively in this way. By leveraging the 1-con method, a connectible-cell based topology control algorithm (CCTC) is designed. It could be theoretically proved that 1) CCTC could guarantee the network connectivity; and 2) In every round, CCTC needs fewer active nodes than other algorithms do. The computing complexity of CCTC is linear; and the storage space and the message amount are bounded by constant magnitude. Simulation results also validate that CCTC provides impressive energy conservation and longer network lifetime with decent robustness and limited control overheads.