{"title":"Anchor selection and Geo-Logical Routing in 3D Wireless Sensor Networks","authors":"Yisong Jiang, A. Jayasumana","doi":"10.1109/LCN.2014.6925827","DOIUrl":null,"url":null,"abstract":"Inherent differences in geometric, deployment and propagation constraints prevent many 2D sensor network routing algorithms from scaling to 3D. Complex 3D shapes and surfaces make geometric coordinate based techniques inefficient or impractical for 3D. Geo-Logical Routing (GLR) switches between virtual and topology coordinate domains to overcome the local minima of each other. GLR is demonstrated to be highly effective for complex 3D networks. Addition of a second initial anchor pair in Extreme Node Search (ENS) increases the number of anchors, thus enhancing performance in networks with very high node degree, while traditional 2D ENS performs just as well in other cases. Simulations demonstrate that GLR with ENS anchor placement significantly outperforms the Greedy Distributed Spanning Tree Routing (3D-GDSTR) algorithm, but without the need for localization.","PeriodicalId":143262,"journal":{"name":"39th Annual IEEE Conference on Local Computer Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"39th Annual IEEE Conference on Local Computer Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LCN.2014.6925827","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4
Abstract
Inherent differences in geometric, deployment and propagation constraints prevent many 2D sensor network routing algorithms from scaling to 3D. Complex 3D shapes and surfaces make geometric coordinate based techniques inefficient or impractical for 3D. Geo-Logical Routing (GLR) switches between virtual and topology coordinate domains to overcome the local minima of each other. GLR is demonstrated to be highly effective for complex 3D networks. Addition of a second initial anchor pair in Extreme Node Search (ENS) increases the number of anchors, thus enhancing performance in networks with very high node degree, while traditional 2D ENS performs just as well in other cases. Simulations demonstrate that GLR with ENS anchor placement significantly outperforms the Greedy Distributed Spanning Tree Routing (3D-GDSTR) algorithm, but without the need for localization.