无线自组织和传感器网络中基于部分Delaunay三角测量的数据中心存储和路由保证传输

2009 Mexican International Conference on Computer Science Pub Date : 2009-09-21 DOI:10.1109/ENC.2009.15

Yanli Deng, I. Stojmenovic

{"title":"无线自组织和传感器网络中基于部分Delaunay三角测量的数据中心存储和路由保证传输","authors":"Yanli Deng, I. Stojmenovic","doi":"10.1109/ENC.2009.15","DOIUrl":null,"url":null,"abstract":"Existing memory-less greedy-face-greedy (GFG) routing algorithm [1] can guarantee the delivery in wireless ad hoc networks modeled by a connected unit disk graph. The FACE mode in GFG routing is a recovery mode used when no neighbor closer to destination exists. Face mode requires extracting a planar sub graph out of the unit disk graph. In this paper, we propose to apply partial Delaunay triangulation (PDT) instead of Gabriel graph (GG) used in the original GFG routing. PDT is locally defined without any message exchange in addition to those needed to learn locations of neighbors. This appears to be the densest known such message free planar graph. PDT can be used instead of GG for storing data in wireless sensor networks, where each datum is stored in the face of PDT containing hashed location of datum. Simulation results show the GFG routing has better performance on a PDT than on a GG, since PDT is denser than GG. Applying dominating set based routing or a shortcut scheme can further enhance the PDT-based routing performance.","PeriodicalId":273670,"journal":{"name":"2009 Mexican International Conference on Computer Science","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Partial Delaunay Triangulations Based Data-Centric Storage and Routing with Guaranteed Delivery in Wireless Ad Hoc and Sensor Networks\",\"authors\":\"Yanli Deng, I. Stojmenovic\",\"doi\":\"10.1109/ENC.2009.15\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Existing memory-less greedy-face-greedy (GFG) routing algorithm [1] can guarantee the delivery in wireless ad hoc networks modeled by a connected unit disk graph. The FACE mode in GFG routing is a recovery mode used when no neighbor closer to destination exists. Face mode requires extracting a planar sub graph out of the unit disk graph. In this paper, we propose to apply partial Delaunay triangulation (PDT) instead of Gabriel graph (GG) used in the original GFG routing. PDT is locally defined without any message exchange in addition to those needed to learn locations of neighbors. This appears to be the densest known such message free planar graph. PDT can be used instead of GG for storing data in wireless sensor networks, where each datum is stored in the face of PDT containing hashed location of datum. Simulation results show the GFG routing has better performance on a PDT than on a GG, since PDT is denser than GG. Applying dominating set based routing or a shortcut scheme can further enhance the PDT-based routing performance.\",\"PeriodicalId\":273670,\"journal\":{\"name\":\"2009 Mexican International Conference on Computer Science\",\"volume\":\"16 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-09-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 Mexican International Conference on Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ENC.2009.15\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 Mexican International Conference on Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ENC.2009.15","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 5

摘要

现有的无内存贪婪面贪婪(GFG)路由算法[1]能够保证以连通单元磁盘图为模型的无线自组织网络的传输。在GFG路由中，FACE模式是在不存在更接近目的地的邻居时使用的一种恢复模式。面模式需要从单位磁盘图中提取一个平面子图。在本文中，我们提出用偏德劳内三角剖分(PDT)来代替原来GFG路由中使用的加布里埃尔图(GG)。PDT是本地定义的，除了学习邻居位置所需的消息交换外，没有任何消息交换。这似乎是已知最密集的这样的信息自由平面图。PDT可以代替GG在无线传感器网络中存储数据，其中每个数据都存储在包含哈希数据位置的PDT面前。仿真结果表明，由于PDT比GG密度大，GFG在PDT上的路由性能优于GG，采用支配集路由或捷径方案可以进一步提高基于PDT的路由性能。

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

查看原文本刊更多论文

Partial Delaunay Triangulations Based Data-Centric Storage and Routing with Guaranteed Delivery in Wireless Ad Hoc and Sensor Networks

Existing memory-less greedy-face-greedy (GFG) routing algorithm [1] can guarantee the delivery in wireless ad hoc networks modeled by a connected unit disk graph. The FACE mode in GFG routing is a recovery mode used when no neighbor closer to destination exists. Face mode requires extracting a planar sub graph out of the unit disk graph. In this paper, we propose to apply partial Delaunay triangulation (PDT) instead of Gabriel graph (GG) used in the original GFG routing. PDT is locally defined without any message exchange in addition to those needed to learn locations of neighbors. This appears to be the densest known such message free planar graph. PDT can be used instead of GG for storing data in wireless sensor networks, where each datum is stored in the face of PDT containing hashed location of datum. Simulation results show the GFG routing has better performance on a PDT than on a GG, since PDT is denser than GG. Applying dominating set based routing or a shortcut scheme can further enhance the PDT-based routing performance.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2009 Mexican International Conference on Computer Science

自引率

0.00%

发文量