Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
32
0

Year Published

2012
2012
2015
2015

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 35 publications
(32 citation statements)
references
References 6 publications
0
32
0
Order By: Relevance
“…Moreover, the initial setup phase is still based on a tree topology. In addition, MeshMAC [12] proposed a distributed beacon scheduling for a mesh network, but it did not address a neighboring beacon slot collection method, which is the key point of distributed beacon scheduling. The IEEE802.15.4e standard [15], more specifically, DSME capability, provides the specifications regarding the concept level of bitmap-based distributed beacon scheduling.…”
Section: Related Workmentioning
confidence: 99%
See 2 more Smart Citations
“…Moreover, the initial setup phase is still based on a tree topology. In addition, MeshMAC [12] proposed a distributed beacon scheduling for a mesh network, but it did not address a neighboring beacon slot collection method, which is the key point of distributed beacon scheduling. The IEEE802.15.4e standard [15], more specifically, DSME capability, provides the specifications regarding the concept level of bitmap-based distributed beacon scheduling.…”
Section: Related Workmentioning
confidence: 99%
“…However, in multi-hop networks, beacon packets from different nodes have a high collision probability, and a beacon collision problem is therefore considered to be one of the most significant challenges in designing a multi-hop network that is based on IEEE802. 15.4. Over the past few years, several studies [2][3][4][5][6][7][8][9][10][11][12][13] have been conducted on improving the energy efficiency and reliability in multi-hop networks that are based on IEEE802.15.4. Most of them have mainly focused on solving beacon collision problems.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Thus, such solution does not permit to save energy. A greedy localized solution was proposed in [21]: a node picks a free slot in its 2-neighborhood to schedule its superframe. However, it only takes into account interferences among coordinators, and not with children, which occur frequently in a cluster-tree.…”
Section: Superframe Schedulingmentioning
confidence: 99%
“…Children extract the BE from beacons and stop any computation (lines 6-10). A coordinator has to continuously update its BE: when the throughput is decreasing, the node changes its direction for the exploration (lines [19][20][21]. When the throughput has changed significantly (more than ∆) or stayed unchanged for a too long time, the BE is increased/decreased, depending on the direction (line 22).…”
Section: Consistencymentioning
confidence: 99%