Paper Info
Title
ZigBee cluster tree formation for time-bounded data flows in one collision domain
Abstract
We study one-collision domain ZigBee cluster-tree design problems to satisfy periodic time-bounded data flows. The formation of the cluster-tree topology can be seen as a bounded-degree-and-depth tree which is an NP-complete problem. The objective is to minimize the number of clusters such that all flows can take place and there exists a cluster schedule that meets the deadlines of the flows. For the resulting tree, the cluster schedule is required to be energy efficient, which can be achieved by maximizing the length of the schedule period, and consequently, increasing the lifetime of the network. We present a Cluster-Tree Formation and Energy-Efficient clusters scheduling algorithm, CFEFS, based on the Hungarian algorithm, the Maximum Matching algorithm and the Branch and Bound algorithm to tackle this design problem that integrates the cluster formation and the cluster scheduling in one problem.
Year
DOI
Venue
2015
10.1109/WFCS.2015.7160572
2015 IEEE World Conference on Factory Communication Systems (WFCS)
Keywords
Field
DocType
ZigBee cluster tree formation,time-bounded data flow,cluster-tree topology,bounded-degree-and-depth tree,NP-complete problem,energy efficient cluster scheduling algorithm,CFEFS,Hungarian algorithm,maximum matching algorithm,branch and bound algorithm
Collision domain,Hungarian algorithm,Cluster (physics),Branch and bound,Mathematical optimization,Scheduling (computing),Efficient energy use,Matching (graph theory),Mathematics,Bounded function
Conference
Citations 
PageRank 
References 
0
0.34
5
Authors
2
Name
Order
Citations
PageRank
Aasem Ahmad151.94
Zdenek Hanzalek291.60