2009 Fifth International Joint Conference on INC, IMS and IDC 2009
DOI: 10.1109/ncm.2009.331
|View full text |Cite
|
Sign up to set email alerts
|

The Bias Routing Tree Avoiding Technique for Hierarchical Routing Protocol over 6LoWPAN

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2010
2010
2019
2019

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 9 publications
(2 citation statements)
references
References 3 publications
0
2
0
Order By: Relevance
“…In the parent node selection, someone [4] chooses the node that has the least child node as its parent. But it doesn't take into account the problem of limited energy of nodes.…”
Section: Related Workmentioning
confidence: 99%
“…In the parent node selection, someone [4] chooses the node that has the least child node as its parent. But it doesn't take into account the problem of limited energy of nodes.…”
Section: Related Workmentioning
confidence: 99%
“…It was designed to establish a hierarchical tree with parent and child nodes to transmit packets. The problems present in the existing hierarchical routing protocol were only the address allocation and routing mechanism .But in this TA-HiLow [20], a mechanism was suggested to avoid the bias routing tree that could happen if the child nodes does not attach to the parent nodes evenly. The bias routing tree problem is avoided by transmitting attached child number information.…”
Section: The Bias Tree Avoiding Technique For Hierarchical Routing Prmentioning
confidence: 99%