无线传感器网络中绕过障碍物的地理路由
Geographic Routing Around Obstacles in Wireless Sensor Networks
摘要：
地理路由正成为许多传感器网络应用的首选协议。目前的技术水平是不能令人满意的：一些算法是非常有效的，但他们需要一个初步的平面化的通信图。平面化会导致开销，在许多情况下是不现实的。另一方面，不依赖于平面化的georouting算法具有相当低的成功率，并且除了最简单的障碍物之外不能围绕所有障碍物路由消息，或者具有高的拓扑控制开销（例如轮廓检测算法）。为了克服这些限制，我们提出GRIC，第一个轻量级和高效的按需（即所有对所有）的地理路由算法，不需要平面化，并具有几乎100%的交付率（当没有障碍物添加）。此外，即使在存在大的凸障碍物的情况下，我们的算法的优良行为也被保持。硬凹障碍的情况下也进行了研究，这样的障碍是硬的情况下，性能下降。
英文摘要：
Geographic routing is becoming the protocol of choice for many sensor network applications. The current state of the art is unsatisfactory: some algorithms are very efficient, however they require a preliminary planarization of the communication graph. Planarization induces overhead and is not realistic in many scenarios. On the otherhand, georouting algorithms which do not rely on planarization have fairly low success rates and either fail to route messages around all but the simplest obstacles or have a high topology control overhead (e.g. contour detection algorithms). To overcome these limitations, we propose GRIC, the first lightweight and efficient on demand (i.e. all-to-all) geographic routing algorithm which does not require planarization and has almost 100% delivery rates (when no obstacles are added). Furthermore, the excellent behavior of our algorithm is maintained even in the presence of large convex obstacles. The case of hard concave obstacles is also studied; such obstacles are hard instances for which performance diminishes.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
