Once you select a node (or a collection of nodes), you can find the data you're looking for and manipulate the document when you need to.
一旦选择了一个节点(或一个节点集合),就可以找到您正在寻找的数据以及在需要时操纵文档。
This paper proposes a breath-first search based data collection tree algorithm that taking in account size of backbone, energy of node and path. The data collection tree is maintained locally.
本文综合考虑骨干网的大小、节点能量及路径,提出了一种基于广度优先搜索的数据收集树算法,并采用局部式方法进行维护。
应用推荐