Name
Abstract | ||
|---|---|---|
AbstractThis 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. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.4018/IJITN.2018100101 | Periodicals |
Keywords | Field | DocType |
6LoWPAN, Addressing, Anycast, Routing Tree | Computer science,Computer network,Anycast,6LoWPAN | Journal |
Volume | Issue | ISSN |
10 | 4 | 1941-8663 |
Citations | PageRank | References |
0 | 0.34 | 15 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhengxiong Dou | 1 | 4 | 3.77 |
| Xiaonan Wang | 2 | 238 | 34.66 |
| Yanli Li | 3 | 8 | 5.51 |