CRTRA: Coloring Route-Tree Based Resource Allocation Algorithm for Industrial Wireless Sensor Networks
Source: University of Savoie
Industrial wireless sensor network design requires efficient channel usages and timeslot assignment. In this paper, the authors 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.