期刊文献+

一种基于时隙优化的邻居发现算法研究 被引量:1

A Neighbor Discovery Algorithm Based on Time Slot Optimization
下载PDF
导出
摘要 作为无线传感器网络组网及路由的先决条件,邻居发现问题受到越来越人们的关注。为了提高无线传感器网络中节点的发现概率,减少发现延时,提出一种基于时隙优化的邻居发现算法(SOND)。SOND算法基于Searchlight[1]原理,对Searchlight中时隙进行优化,从而提高邻居节点之间的发现效率和减少邻居的发现延迟。仿真实验表明SOND算法具有良好的发现性能。 As a prerequisite for networking and routing in wireless sensor networks, neighbor discovery is concerned by more and more people. In or-der to improve the discovery probability of nodes in wireless sensor networks and reduce the delay of discovery, proposes a neighbor discovery algorithm based on time slot optimization(SOND). SOND algorithm based on the principle of Searchlight, the Searchlight in the slot is optimized, so as to improve the efficiency of the discovery between neighbor nodes and reduce the delay of the neighbor discovery.Simulation results show that the SOND algorithm has good performance.
作者 庞利平 殷峰
出处 《现代计算机(中旬刊)》 2017年第2期11-13,共3页 Modern Computer
关键词 无线传感器网络(WSNs) 邻居发现算法 时隙优化 Wireless Sensor Networks(WSNs) Neighbor Discovery Algorithm Slot Optimization
  • 相关文献

同被引文献9

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部