中文摘要：

为了使工作于轮值周期下的无线传感器网络节点能以较大的概率发现邻居节点,提出了在轮值网络下基于同步和概率的邻居发现算法.将此邻居发现问题建模为餐券收集者问题,并求解了这一问题,给出了网络节点发现任意个数的邻居所需时间片数量的期望值.另外,证明了在轮值周期为1时,该理论结果退化为普通ALHOA网络的结论.仿真结果表明,在一般情况下,该理论分析结果与实际情况符合得很好,即使在极端情况下（每一时间片仅有2个节点进入活跃状态）该理论结果仍具有较好的预测能力.

英文摘要：

To increase the probability of neighbor discovery in duty cycle wireless sensor networks,where nodes stay in dormant state most of the time,the neighbor discovery problem is proposed based on synchronization and probability.By formulating the problem into a coupon collector＇s problem,the neighbor discovery problem in wireless sensor networks with duty cycle is solved.The expected slots for a node to discover determined neighbors are proposed.Then it is proved that the analytical results fall into a neighbor discovery problem in ALHOA networks when duty cycle is 1.Simulation results show that the analytical results match simulation results well,even in extreme case where only two nodes are expected to be active in one slot.