基于任意播树寻址的6LoWPAN路由

Zhengxiong Dou, Xiaonan Wang, Yanli Li
{"title":"基于任意播树寻址的6LoWPAN路由","authors":"Zhengxiong Dou, Xiaonan Wang, Yanli Li","doi":"10.4018/IJITN.2018100101","DOIUrl":null,"url":null,"abstract":"This article proposes an anycast-tree addressing-based routing scheme for 6LoWPAN. In this scheme, multiple gateways are introduced to 6LoWPAN and divide 6LoWPAN into multiple tree topologies. Anycast is used to construct a tree topology which is called an anycast tree and where a gateway works as a root. A node joins the anycast tree identified by the nearest gateway to acquire a unique address, and achieves communications with the Internet via the nearest gateway. Anycast trees are distributed around 6LoWPAN, so the depth of an anycast tree is substantially shortened and the routing path and latency are also reduced. Moreover, if a gateway fails, its descendants can communicate with the Internet via the nearest active gateway and update their addresses instead of reacquiring new addresses. The performance parameters of this scheme are evaluated, and the data results show that this scheme effectively shortens the routing latency.","PeriodicalId":120331,"journal":{"name":"Int. J. Interdiscip. Telecommun. Netw.","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Anycast-Tree Addressing-Based Routing for 6LoWPAN\",\"authors\":\"Zhengxiong Dou, Xiaonan Wang, Yanli Li\",\"doi\":\"10.4018/IJITN.2018100101\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This article proposes an anycast-tree addressing-based routing scheme for 6LoWPAN. In this scheme, multiple gateways are introduced to 6LoWPAN and divide 6LoWPAN into multiple tree topologies. Anycast is used to construct a tree topology which is called an anycast tree and where a gateway works as a root. A node joins the anycast tree identified by the nearest gateway to acquire a unique address, and achieves communications with the Internet via the nearest gateway. Anycast trees are distributed around 6LoWPAN, so the depth of an anycast tree is substantially shortened and the routing path and latency are also reduced. Moreover, if a gateway fails, its descendants can communicate with the Internet via the nearest active gateway and update their addresses instead of reacquiring new addresses. The performance parameters of this scheme are evaluated, and the data results show that this scheme effectively shortens the routing latency.\",\"PeriodicalId\":120331,\"journal\":{\"name\":\"Int. J. Interdiscip. Telecommun. Netw.\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Int. J. Interdiscip. Telecommun. Netw.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4018/IJITN.2018100101\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Interdiscip. Telecommun. Netw.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4018/IJITN.2018100101","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文提出了一种基于任意播树寻址的6LoWPAN路由方案。该方案在6LoWPAN中引入多个网关,并将6LoWPAN划分为多个树状拓扑结构。Anycast用于构造树形拓扑,该拓扑称为Anycast树,其中网关作为根。节点加入由最近的网关标识的任播树,获取唯一的地址,并通过最近的网关实现与Internet的通信。任意播树分布在6LoWPAN附近,因此大大缩短了任意播树的深度,也减少了路由路径和延迟。此外,如果一个网关发生故障,它的后代可以通过最近的活动网关与Internet通信,并更新它们的地址,而不是重新获取新地址。对该方案的性能参数进行了评估,数据结果表明,该方案有效地缩短了路由延迟。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Anycast-Tree Addressing-Based Routing for 6LoWPAN
This article proposes an anycast-tree addressing-based routing scheme for 6LoWPAN. In this scheme, multiple gateways are introduced to 6LoWPAN and divide 6LoWPAN into multiple tree topologies. Anycast is used to construct a tree topology which is called an anycast tree and where a gateway works as a root. A node joins the anycast tree identified by the nearest gateway to acquire a unique address, and achieves communications with the Internet via the nearest gateway. Anycast trees are distributed around 6LoWPAN, so the depth of an anycast tree is substantially shortened and the routing path and latency are also reduced. Moreover, if a gateway fails, its descendants can communicate with the Internet via the nearest active gateway and update their addresses instead of reacquiring new addresses. The performance parameters of this scheme are evaluated, and the data results show that this scheme effectively shortens the routing latency.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信