混合通信网络中的竞争路由
Competitive Routing in Hybrid Communication Networks
摘要：
路由是无线自组织网络的一个具有挑战性的问题，特别是当节点是移动的，分布如此广泛，在大多数情况下，需要多跳路由消息从一个节点到另一个。事实上，已知任何在线路由协议在最坏情况下具有较差的性能，在某种意义上，存在导致该协议的较差路由路径的节点分布，即使节点知道它们的地理位置并且消息的目的地的地理位置是已知的。其原因是，自组织网络中的无线电漏洞可能需要消息绕路很长时间才能到达目的地，而这在在线方式中很难找到。在本文中，我们假设无线自组织网络可以有限地使用由全球通信基础设施，如蜂窝基础设施或卫星提供的长距离链路，以计算无线自组织网络的抽象，允许在自组织网络中沿近最短路径发送消息。我们提出了分布式算法，计算抽象的ad hoc网络在$\mathcal{O}\left(\log ^2 n\right)$时间使用远程链接，这将导致在$c$竞争路由路径的ad hoc网络的任何两个节点之间的一些恒定的$c$，如果无线电孔的凸包不相交。我们还表明，抽象所需的存储只取决于无线自组织网络中的无线电洞的数量和大小，是独立的节点总数，这个信息只需要知道几个节点的路由工作。
英文摘要：
Routing is a challenging problem for wireless ad hoc networks, especially when the nodes are mobile and spread so widely that in most cases multiple hops are needed to route a message from one node to another. In fact, it is known that any online routing protocol has a poor performance in the worst case, in a sense that there is a distribution of nodes resulting in bad routing paths for that protocol, even if the nodes know their geographic positions and the geographic position of the destination of a message is known. The reason for that is that radio holes in the ad hoc network may require messages to take long detours in order to get to a destination, which are hard to find in an online fashion. In this paper, we assume that the wireless ad hoc network can make limited use of long-range links provided by a global communication infrastructure like a cellular infrastructure or a satellite in order to compute an abstraction of the wireless ad hoc network that allows the messages to be sent along near-shortest paths in the ad hoc network. We present distributed algorithms that compute an abstraction of the ad hoc network in $\mathcal{O}\left(\log ^2 n\right)$ time using long-range links, which results in $c$-competitive routing paths between any two nodes of the ad hoc network for some constant $c$ if the convex hulls of the radio holes do not intersect. We also show that the storage needed for the abstraction just depends on the number and size of the radio holes in the wireless ad hoc network and is independent on the total number of nodes, and this information just has to be known to a few nodes for the routing to work.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
