Brief announcement: routing with obstacle avoidance mechanism with constant approximation ratio

Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing Pub Date : 2010-07-25 DOI:10.1145/1835698.1835727

Florian Huc, Aubin Jarry, Pierre Leone, J. Rolim

{"title":"Brief announcement: routing with obstacle avoidance mechanism with constant approximation ratio","authors":"Florian Huc, Aubin Jarry, Pierre Leone, J. Rolim","doi":"10.1145/1835698.1835727","DOIUrl":null,"url":null,"abstract":"We study the problem of routing messages in sensor networks where the energy saving issue is essential. In this paper, we propose ROAM2, an improvement of ROAM (Routing protocol with Obstacle Avoidance Mechanism) proposed in [HJL+09]. This distributed protocol has a light obstacle detection and avoidance component with low message and computation overhead and a routing component which sends messages along short paths, thus saving energy. We improved it so that is has an 100% delivery rate and we prove that ROAM finds with high probability paths whose lengths are comparable to the length of the shortest paths. Furthermore, we prove a general result on the length of any path computed in a greedy way. Whereas ROAM uses one bit of memory in nodes (even if there are several destinations), in [KWZ08], it was shown that no geographic routing algorithm not using any sensor memory can compute a path whose length is guaranteed to be of order less than O(l2), where l is the length of the shortest path. Finally, we compare the energy efficiency of ROAM against GPSR (or GFG) [KK00], the algorithm proposed in [MLNR08] and SLGF [JMLW08], by running simulations which validates our theoretical results","PeriodicalId":447863,"journal":{"name":"Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1835698.1835727","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 4

Abstract

We study the problem of routing messages in sensor networks where the energy saving issue is essential. In this paper, we propose ROAM2, an improvement of ROAM (Routing protocol with Obstacle Avoidance Mechanism) proposed in [HJL+09]. This distributed protocol has a light obstacle detection and avoidance component with low message and computation overhead and a routing component which sends messages along short paths, thus saving energy. We improved it so that is has an 100% delivery rate and we prove that ROAM finds with high probability paths whose lengths are comparable to the length of the shortest paths. Furthermore, we prove a general result on the length of any path computed in a greedy way. Whereas ROAM uses one bit of memory in nodes (even if there are several destinations), in [KWZ08], it was shown that no geographic routing algorithm not using any sensor memory can compute a path whose length is guaranteed to be of order less than O(l2), where l is the length of the shortest path. Finally, we compare the energy efficiency of ROAM against GPSR (or GFG) [KK00], the algorithm proposed in [MLNR08] and SLGF [JMLW08], by running simulations which validates our theoretical results

查看原文本刊更多论文

简要公告:采用恒近似比避障机制的路由

我们研究了传感器网络中的消息路由问题，其中节能问题是至关重要的。在本文中，我们提出了ROAM2，这是对[HJL+09]中提出的ROAM (Routing protocol with Obstacle Avoidance Mechanism)的改进。该分布式协议具有较轻的障碍物检测和避障组件，具有较低的消息和计算开销，以及沿短路径发送消息的路由组件，从而节省了能量。我们改进了它，使其具有100%的交付率，并且我们证明了ROAM以高概率找到长度与最短路径长度相当的路径。进一步，我们证明了用贪心方法计算任意路径长度的一般结果。尽管ROAM在节点中使用1位内存(即使有多个目的地)，但在[KWZ08]中，研究表明，不使用任何传感器内存的地理路由算法都无法计算出长度保证小于O(l2)的路径，其中l为最短路径的长度。最后，我们通过运行仿真验证了我们的理论结果，将ROAM的能量效率与[MLNR08]和[JMLW08]中提出的GPSR(或GFG) [KK00]进行了比较

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing

自引率

0.00%

发文量