| 轮值无线传感器网络邻居发现算法 |
| |
| 引用本文： | 闫宇博,周文昌,杨盘隆,张磊.轮值无线传感器网络邻居发现算法[J].东南大学学报(自然科学版),2010,40(Z2). |
| |
| 作者姓名： | 闫宇博 周文昌 杨盘隆 张磊 |
| |
| 作者单位： | 解放军理工大学通信工程学院;南京大学软件新技术国家重点实验室; |
| |
| 基金项目： | 国家自然科学基金，江苏省自然科学基金 |
| |
| 摘 要： | 为了使工作于轮值周期下的无线传感器网络节点能以较大的概率发现邻居节点,提出了在轮值网络下基于同步和概率的邻居发现算法.将此邻居发现问题建模为餐券收集者问题,并求解了这一问题,给出了网络节点发现任意个数的邻居所需时间片数量的期望值.另外,证明了在轮值周期为1时,该理论结果退化为普通ALHOA网络的结论.仿真结果表明,在一般情况下,该理论分析结果与实际情况符合得很好,即使在极端情况下(每一时间片仅有2个节点进入活跃状态)该理论结果仍具有较好的预测能力.
|
| 关 键 词： | 无线传感器网络 邻居发现 轮值周期 餐券收集者问题 |
Neighbor discovery in wireless sensor networks with duty cycles |
| |
| Yan Yubo,Zhou Wenchang,Yang Panlong,Zhang Lei.Neighbor discovery in wireless sensor networks with duty cycles[J].Journal of Southeast University(Natural Science Edition),2010,40(Z2). |
| |
| Authors: | Yan Yubo Zhou Wenchang Yang Panlong Zhang Lei |
| |
| Institution: | Yan Yubo1 Zhou Wenchang2 Yang Panlong1 Zhang Lei1(1Institute of Communications Engineering,PLA University of Science and Technology,Nanjing 210007,China)(2State Key Laboratory for Novel Software Technology,Nanjing University,Nanjing 210093,China) |
| |
| Abstract: | 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... |
| |
| Keywords: | wireless sensor networks neighbor discovery duty cycle coupon collector's problem |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
