传感器网络中信息受限的地理路由
Geographic Routing with Limited Information in Sensor Networks
摘要：
基于贪婪中继策略的地理路由作为传感器网络中的一种路由策略得到了广泛的研究。这些方案假设节点具有关于目的地位置的完美信息。当源和目的地之间的距离被归一化为1时，这些方案中的渐近路由延迟是$Θ(\frac{1}{M(n)}),$，其中M（n）是在单跳中行进的最大距离（无线电的传输范围）。在本文中，我们考虑路由的情况下，节点有位置错误（不精确的GPS），或只有粗糙的地理信息的目的地是可用的，只有一小部分的节点有路由信息。我们表明，即使这样的不精确或有限的目的地位置信息，路由延迟是$Θ(\frac{1}{M(n)})$。我们还考虑了网络的吞吐量与渐进的路由策略，使数据包更接近目的地在每一步，但不一定沿着直线。我们表明，与渐进式路由的吞吐量是明智的最大可实现的吞吐量相同。
英文摘要：
Geographic routing with greedy relaying strategies have been widely studied as a routing scheme in sensor networks. These schemes assume that the nodes have perfect information about the location of the destination. When the distance between the source and destination is normalized to unity, the asymptotic routing delays in these schemes are $Θ(\frac{1}{M(n)}),$ where M(n) is the maximum distance traveled in a single hop (transmission range of a radio). In this paper, we consider routing scenarios where nodes have location errors (imprecise GPS), or where only coarse geographic information about the destination is available, and only a fraction of the nodes have routing information. We show that even with such imprecise or limited destination-location information, the routing delays are $Θ(\frac{1}{M(n)})$. We also consider the throughput-capacity of networks with progressive routing strategies that take packets closer to the destination in every step, but not necessarily along a straight-line. We show that the throughput-capacity with progressive routing is order-wise the same as the maximum achievable throughput-capacity.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
