2007 2nd International Symposium on Wireless Pervasive Computing 2007
DOI: 10.1109/iswpc.2007.342571
|View full text |Cite
|
Sign up to set email alerts
|

Shortcut Tree Routing in ZigBee Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
50
0

Year Published

2009
2009
2015
2015

Publication Types

Select...
3
3
1

Relationship

0
7

Authors

Journals

citations
Cited by 118 publications
(56 citation statements)
references
References 2 publications
0
50
0
Order By: Relevance
“…Each device, maintains a table of the neighbors that has all neighbors information's in it in the first step of transition [9].…”
Section: B Neighbors Tablementioning
confidence: 99%
See 3 more Smart Citations
“…Each device, maintains a table of the neighbors that has all neighbors information's in it in the first step of transition [9].…”
Section: B Neighbors Tablementioning
confidence: 99%
“…If all of the nodes are not acceptable then the parent node realizes that the source node is one of his underneath nodes. Fig.2 shows this case in the data from of transmitting the data from node 7 to node 9 [12] and [8], [9].…”
Section: The Imptr Algorithmmentioning
confidence: 99%
See 2 more Smart Citations
“…There has been researches going on the Zigbee standard for path efficiency improvement in ZTR. Initial version of this paper [17] indicates the use of 1-Hop neighbor table. This concerns with reduced routing cost of ZTR and STR"s proposed algorithm just projects and determines the lowest routing path reducing up to 30 hop counts.…”
Section: Related Workmentioning
confidence: 99%