一种新的无线传感器网络拓扑发现算法

Topology discovery algorithm for wireless sensor networks

GBGD是一种面向攻击的隐蔽性较强的拓扑发现算法,通过分析发现,该算法对实际网络进行了过于理想化的假设,导致无法在实际中应用。在GBGD算法工作模式的基础上,对实际网络提出了合理假设,设计实现了一种新的网络拓扑发现算法,通过对报文向基站汇聚过程中每一跳转发时延进行分析得出节点在路由树中的层次关系,进而推算出网络的拓扑。仿真实验结果表明,该算法能准确推断出网络的拓扑,并在报文存在丢失较多的情况下具有较好的鲁棒性。由Mica2节点组成的原型系统实验结果表明,该算法能够较好地应用于实际网络。

GBGD is an attack oriented topology discovery algorithm with high confidentiality. However, found that this algorithm could not be applied in actual network due to its unrealistic assumptions of real situations. This paper proposed reasonable assumptions of actual network based on the work pattern of GBGD, furthermore, designed and implemented a new topology discovery algorithm. By analyzing the forwarding delay of every hop during message convergence process from nodes to base station, it could get the levels of the nodes in the topology tree from which could finally deduce the topology of the surveillance network. Analysis and simulations show that, this algorithm can get the topology of the network exactly even when many messages lost during transmission.