1、发现它的邻居节点，并知道其网络地址。 2、测量到各邻居节点的延时或开销。 3、构造一个分组，分组中包含所有它刚刚知道的信息。 4、将这个分组发送给所有其他的路由器。 5、计算出到每个其他路由器的最短距离。 -1, found in its neighbor nodes, and to know its network address. 2, measured to the neighbor node latency or overhead. 3, constructs a

This paper introduces a message forwarding algorithm for search applications within mobile ad hoc networks that is based on the concept of selecting the nearest node from a set of designated nodes. The algorithm, which is called Minimum Distance P

This paper introduces a message forwarding algorithm for search applications within mobile ad hoc networks that is based on the concept of selecting the nearest node from a set of designated nodes. The algorithm, which is called Minimum Distance Pack