CRTRA: Coloring route-tree based resource allocation algorithm for industrial wireless sensor networks

Industrial wireless sensor network design requires efficient channel usages and timeslot assignment. In this paper, we describe an integrated channel-timeslot allocation algorithm based on a routing-tree coloring scheme. According to a strict routing-tree definition and corresponding resource allocation principles, the algorithm performs in two phases. In the first phase, a traditional mesh sensor network is mapped to a routing tree and each node is colored algorithmically. In the second phase, timeslots are assigned on the colored routing tree according to principles of timeslot allocation. The total number of timeslots necessary by this algorithm for a generic sensor network is theoretically analyzed and the algorithm performance is also evaluated by simulations. The algorithm is compatible with all three latest industrial wireless network standards, WIA-PA, WirelessHART, and ISA 100.11a.