Bounding the Sensing Data Collection Time with Ring-based Routing for Industrial Wireless Sensor Networks

Bounding the Sensing Data Collection Time with Ring-based Routing for Industrial Wireless Sensor Networks

Industrial wireless sensor network (IWSN) exhibits data delivery time constraint from sensor node to sink node. The data delivery time in IWSN is unpredictable because of the dynamic routing and transmission collision in ad hoc networks. Considering the power consumption, the sensor node close to the sink node will incur substantial power consumption for data forwarding or data aggregation. This study adopts a proactive routing, which constructs the sensor nodes into a logical circular chain topology (i.e., ring topology), to avoid data collision problem and to bound sensing data collection time in IWSN. A load-balancing issue is considered to prolong the network lifetime. In this study, the construction of a logical circular chain is converted to the traveling salesman problem (TSP) with genetic algorithm to determine the load-balancing circular chain. Simultaneously, we use the linear programming scheme to model the logical circular chain construction. The simulated annealing algorithm is adopted to determine the optimal load-balancing chain. A ping-pong token mechanism is proposed to balance the residual power of each sensor node and to prolong the network lifetime. Simulation results reveal that the linear programming scheme with ping-pong token has the best data delivery time and system lifetime.