摘要
论文研究在节点不移动的无线传感器网络中的邻居发现,可为路由和调度算法提供邻居节点信息。提出一种邻居发现算法,具有分布式、异步的特点。该算法基于概率,每个节点可以得到一份可能不完整的邻居节点清单。并对算法进行了性能分析。
Neighbor discovery is useful in sensor networks whose nodes are immobile, since routing and scheduling algorithms can make good use of neighbor information. We propose an asynchronous neighbor discovery algorithm. The algorithm is probabilistic: each node obtains a list of its neighbors which is possibly incomplete. Performance is analyzed and optimal parameter settings are obtained.
出处
《微计算机信息》
2009年第4期145-146,224,共3页
Control & Automation
关键词
无线传感器网
邻居发现
异步算法
Wireless Sensor Networks
Neighbor Discovery
Asynchronous Algorithm