VGC:虚拟组协同邻居发现算法

VGC:Virtual Group-Coordinated Neighbor Discovery Algorithm for Low Duty Cycle WSNs

在低占空比无线传感器网络中,节点的占空比越大,其发现邻居的概率也就越大,为此,提出虚拟组协同邻居发现算法(VGC),VGC的主要思想是通过协同所有组内节点(已经相互发现的节点)的工作时隙,使之形成一个占空比更大的虚拟节点来发现邻居。由于该虚拟节点的占空比远大于组内任何节点,VGC能极大地减少组的平均发现延迟和提高能量使用效率。在静态和动态场景中都做仿真,通过和Group-base及WiFlock相比较,提高邻居发现率,减少平均发现延迟。

In low duty cycle wireless sensor networks （WSNs）, the greater the duty cycle of the node, the greater the probability that it will discover the neighbors. Proposes a novel neighbor discovery algorithm named virtual group-coordinated neighbor discovery algorithm （VGC） for low duty cycle WSNs. The main idea of VGC is that cooperate with all in-group （these nodes which have already discovered each other） nodes, working schedule, so all in-group nodes as a whole are considered as a virtual node to discover their neighbors. Takes the advantage of the virtual node whose duty cycle is bigger than any in-group node to discover its neighbors, VGC can greatly reduce the average discovery de- lay and improve the energy efficiency for the group. Performs the simulations both in static and dynamic scenario. Compared VGC with Group-based Discovery and WiFlock, the discovery rate is increased and the average discovery delay is reduced.