Efficient Algorithms for Distributed Detection of Holes and Boundaries in Wireless Networks
Efficient Algorithms for Distributed Detection of Holes and Boundaries in Wireless Networks
复制标题
无线网络中空洞和边界分布式检测的高效算法
DOI：
10.1007/978-3-642-20662-7_33
复制
发表时间：
2011
期刊：
影响因子：
--
通讯作者：
D. Wagner
中科院分区：
文献类型：
--
作者：
D. Schieferdecker;M. Völker;D. Wagner
我们提出了两种新型算法，用于无线传感器网络中的分布式和无位边界识别。两种方法都使一个节点能够自主确定它是否是边界节点，仅基于小社区的连接信息。这使得我们的算法非常适用于节点可以移动或不起作用的动态网络。
我们在定性和定量上与以前的几种方法进行比较。在广泛的模拟中，我们考虑了各种模型和场景。尽管我们的算法比大多数其他方法使用的信息少，但它们产生的结果明显更好。它们在节点程度的变化方面非常强大，并且不依赖于通信模型的简化假设。此外，与大多数现有方法相比，它们在实际传感器节点上实现要容易得多。
We propose two novel algorithms for distributed and locationfree boundary recognition in wireless sensor networks. Both approaches enable a node to decide autonomously whether it is a boundary node, based solely on connectivity information of a small neighborhood. This makes our algorithms highly applicable for dynamic networks where nodes can move or become inoperative.
We compare our algorithms qualitatively and quantitatively with several previous approaches. In extensive simulations, we consider various models and scenarios. Although our algorithms use less information than most other approaches, they produce significantly better results. They are very robust against variations in node degree and do not rely on simplified assumptions of the communication model. Moreover, they are much easier to implement on real sensor nodes than most existing approaches.