2014
DOI: 10.19026/rjaset.7.645
|View full text |Cite
|
Sign up to set email alerts
|

Multiple Cluster Tree Routing and Scheduling for Collision Avoidance in 802.15.4. Sensor Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2015
2015
2015
2015

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 14 publications
0
1
0
Order By: Relevance
“…To avoid such inter-cluster collisions, many beacon scheduling algorithms have been proposed [4]- [6], [8]- [10]. The previous works solved this inter-cluster collision problem by serializing all beacon frames, not allowing overlaps of beacon frames among clusters.…”
Section: Introductionmentioning
confidence: 99%
“…To avoid such inter-cluster collisions, many beacon scheduling algorithms have been proposed [4]- [6], [8]- [10]. The previous works solved this inter-cluster collision problem by serializing all beacon frames, not allowing overlaps of beacon frames among clusters.…”
Section: Introductionmentioning
confidence: 99%