地理转发中避免局部极小值的邻居不经意和非状态算法
Neighbor Oblivious and Finite-State Algorithms for Circumventing Local Minima in Geographic Forwarding
摘要:
我们提出分布式链路反转算法,以规避地理路由的通信空隙。并解决了这些算法中伴随的整数溢出问题。这些目标分两步实现。首先,我们推导出不需要单跳邻居信息的部分和完全链路反转算法,并将目的地无定向有向无环图(DAG)转换为目的地定向DAG。我们嵌入这些算法的框架中的Gafni和Bertsekas(“分布式算法在网络中生成无环路由频繁变化的拓扑结构”,1981年),以建立其终止属性。我们还分析了我们的邻居不经意链路反转算法所表现出的某些关键属性,例如,对于任何两个邻居,它们的t-状态总是连续的整数,并且对于任何节点,其t-状态大小的上界为log(N)。在第二步中,我们解决了整数溢出问题,解析推导出一位完整的链接反转和两位部分链接反转版本的邻居不经意的链接反转算法。
英文摘要:
We propose distributed link reversal algorithms to circumvent communication voids in geographic routing. We also solve the attendant problem of integer overflow in these algorithms. These are achieved in two steps. First, we derive partial and full link reversal algorithms that do not require one-hop neighbor information, and convert a destination-disoriented directed acyclic graph (DAG) to a destination-oriented DAG. We embed these algorithms in the framework of Gafni and Bertsekas ("Distributed algorithms for generating loop-free routes in networks with frequently changing topology", 1981) in order to establish their termination properties. We also analyze certain key properties exhibited by our neighbor oblivious link reversal algorithms, e.g., for any two neighbors, their t-states are always consecutive integers, and for any node, its t-state size is upper bounded by log(N). In the second step, we resolve the integer overflow problem by analytically deriving one-bit full link reversal and two-bit partial link reversal versions of our neighbor oblivious link reversal algorithms.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。