Bypassing holes in sensor networks: Load-balance vs. latency

Bypassing holes in sensor networks: Load-balance vs. latency
复制标题

绕过传感器网络中的漏洞:负载平衡与延迟

DOI:
10.1016/j.adhoc.2017.03.002
复制
发表时间:
2017
期刊:
影响因子:
4.8
通讯作者:
Scheuermann, Peter
Scheuermann, Peter
中科院分区:
计算机科学2区
文献类型:
--
作者:
Zhou, Fan;Trajcevski, Goce;Tamassia, Roberto;Avci, Besim;Khokhar, Ashfaq;Scheuermann, Peter

文献摘要

被引文献

相似文献

这项工作解决了地理路由时出现的问题,在无线传感器网络中存在的漏洞。我们假设,依赖于现有的算法绕过覆盖漏洞可能会导致更严重的耗尽节点之间的能量储备(或附近),孔的边界。这又将使得这些节点中的一些对于任何路由(和/或感测)目的都是无用的,从而有效地扩大了现有孔的大小,并且对于某些(源、宿)对引起更长的通信延迟。我们提出了解决这些互补问题的算法:(1)减轻给定空洞边界周围节点的路由负载,以延长它们的生存期;以及(2)通过使用在基于最短路径的路由的一定范围内的路由来减少分组递送的延迟。(否则)需要沿着给定孔的边界布线的孔,应该改为开始偏离它们的原始路径,进一步远离该孔。为了研究潜在的好处,我们引入近似的孔的边界与矩形,圆形和椭圆形,分别。我们推导出这三个近似减少路由延迟的界限。实验结果表明,与传统的面路由相比,该方法不仅可以延长沿着给定空洞边界的节点的生存时间,并使其附近的能量储备消耗更加均匀,而且可以降低通信延迟.
This work addresses problems that arise when geographic routing is used in the presence of holes in wireless sensor networks. We postulate that relying on the existing algorithms for bypassing a coverage hole may cause more severe depletion of the energy reserves among the nodes at (or near) that hole’s boundary. This, in turn, will render some of those nodes useless for any routing (and/or sensing) purposes, thereby effectively enlarging the size of existing hole and inducing longer communication delays for certain(source, sink)pairs. We propose heuristics that address these complementary problems: (1) relieving some of the routing-load for the nodes around the boundary of a given hole, for the purpose of extending their lifetime; and (2) reducing the latency of the packets-delivery by using routes that are within certain bounds from the route based on the shortest-path. Our approaches are based on the idea that some of the packets that would (otherwise) need to be routed along the boundary of a given hole, should instead start to deviate from their original path further away from that hole. To investigate the potential benefits, we introduce approximations of the hole’s boundary with a rectangle, a circle and an ellipse, respectively. We derive the bounds on reducing the routing latency for these three approximations. Our experiments demonstrate that the proposed approaches not only increase the lifetime of the nodes along the boundary of a given hole and yield a more uniform depletion of the energy reserves in its vicinity, but also reduce the communication latency, compared to the traditional face routing.